Author of the publication

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

Complete Fairness in Multi-Party Computation Without an Honest Majority., and . IACR Cryptology ePrint Archive, (2008)Differentially Private Access Patterns in Secure Computation., and . IACR Cryptology ePrint Archive, (2017)Fully Secure PSI via MPC-in-the-Head., , and . IACR Cryptol. ePrint Arch., (2022)More Efficient (Reusable) Private Set Union., , , and . IACR Cryptol. ePrint Arch., (2022)Simple and Efficient Two-Server ORAM., , and . ASIACRYPT (3), volume 11274 of Lecture Notes in Computer Science, page 141-157. Springer, (2018)Two-party Private Set Intersection with an Untrusted Third Party., , and . ACM Conference on Computer and Communications Security, page 2403-2420. ACM, (2019)Multi-Input Functional Encryption., , , , and . IACR Cryptology ePrint Archive, (2013)Complete fairness in secure two-party computation., , , and . STOC, page 413-422. ACM, (2008)On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations., , , and . LATINCRYPT, volume 6212 of Lecture Notes in Computer Science, page 189-204. Springer, (2010)Complete Fairness in Multi-party Computation without an Honest Majority., and . TCC, volume 5444 of Lecture Notes in Computer Science, page 19-35. Springer, (2009)