Author of the publication

Perfectly-Secure Multiplication for Any t < n/3.

, , and . CRYPTO, volume 6841 of Lecture Notes in Computer Science, page 240-258. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries., and . IACR Cryptology ePrint Archive, (2008)Complete fairness in secure two-party computation., , , and . STOC, page 413-422. ACM, (2008)On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation., , , and . CRYPTO, volume 4117 of Lecture Notes in Computer Science, page 483-500. Springer, (2006)Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer., and . TCC, volume 5444 of Lecture Notes in Computer Science, page 183-201. Springer, (2009)Secure Computation without Agreement., and . DISC, volume 2508 of Lecture Notes in Computer Science, page 17-32. Springer, (2002)Text Mining at the Term Level., , , , , , , and . PKDD, volume 1510 of Lecture Notes in Computer Science, page 65-73. Springer, (1998)Efficient Constant Round Multi-party Computation Combining BMR and SPDZ., , , and . CRYPTO (2), volume 9216 of Lecture Notes in Computer Science, page 319-338. Springer, (2015)Fair and Efficient Secure Multiparty Computation with Reputation Systems., , and . ASIACRYPT (2), volume 8270 of Lecture Notes in Computer Science, page 201-220. Springer, (2013)Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries., and . J. Cryptol., 23 (3): 422-456 (2010)A Proof of Security of Yao's Protocol for Two-Party Computation., and . J. Cryptol., 22 (2): 161-188 (2009)