Author of the publication

A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation.

, and . J. Cryptol., 30 (1): 58-151 (2017)

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

OptORAMa: Optimal Oblivious RAM., , , , , and . EUROCRYPT (2), volume 12106 of Lecture Notes in Computer Science, page 403-432. Springer, (2020)Privacy-Preserving Search of Similar Patients in Genomic Data., , , and . Proc. Priv. Enhancing Technol., 2018 (4): 104-124 (2018)On Perfect Correctness without Derandomization., , , and . IACR Cryptology ePrint Archive, (2019)Limits on the Power of Indistinguishability Obfuscation and Functional Encryption., and . SIAM J. Comput., 45 (6): 2117-2176 (2016)A Complete Characterization of Game-Theoretically Fair, Multi-Party Coin Toss., , and . EUROCRYPT (1), volume 13275 of Lecture Notes in Computer Science, page 120-149. Springer, (2022)Privacy-preserving portfolio pricing., , and . ICAIF, page 35:1-35:8. ACM, (2021)Limits on the Power of Indistinguishability Obfuscation and Functional Encryption., and . FOCS, page 191-209. IEEE Computer Society, (2015)Towards Characterizing Complete Fairness in Secure Two-Party Computation.. TCC, volume 8349 of Lecture Notes in Computer Science, page 291-316. Springer, (2014)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)Sorting Short Keys in Circuits of Size o(n log n)., , and . CoRR, (2020)