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)On achieving the "best of both worlds" in secure multiparty computation.. STOC, page 11-20. ACM, (2007)Parallel and Concurrent Security of the HB and HB$^+$ Protocols, , and . J. Cryptology, 23 (3): 402-421 (2010)Poststratification without population level information on the poststratifying variable with application to political polling, , and . J. Amer. Statist. Assoc., 96 (453): 1--11 (2001)Which Languages Have 4-Round Zero-Knowledge Proofs?. TCC, volume 4948 of Lecture Notes in Computer Science, page 73-88. Springer, (2008)Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS., , , and . Public Key Cryptography, volume 7778 of Lecture Notes in Computer Science, page 73-88. Springer, (2013)Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs., and . J. Cryptol., 21 (3): 303-349 (2008)Faster Secure Two-Party Computation Using Garbled Circuits., , , and . USENIX Security Symposium, USENIX Association, (2011)IntegriDB: Verifiable SQL for Outsourced Databases., , and . ACM Conference on Computer and Communications Security, page 1480-1491. ACM, (2015)Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications.. EUROCRYPT, volume 2656 of Lecture Notes in Computer Science, page 211-228. Springer, (2003)