Titlebook: Information Security and Cryptology - ICISC 2009; 12th International C Donghoon Lee,Seokhie Hong Conference proceedings 2010 Springer-Verla

泥沼

发酵

系列

追踪

Linear, Constant-Rounds Bit-Decompositions typical, and the case for both examples) the solution is constant-rounds and requires only .(log.) secure ring multiplications..The solution is secure against active adversaries assuming the existence of additional primitives. These exist for both the Shamir sharing based approach as well as the Paillier based one.