Author of the publication

More is Less: Perfectly Secure Oblivious Algorithms in the Multi-server Setting.

, , , , and . ASIACRYPT (3), volume 11274 of Lecture Notes in Computer Science, page 158-188. Springer, (2018)

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

Faster Secure Two-Party Computation Using Garbled Circuits., , , and . USENIX Security Symposium, USENIX Association, (2011)Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs., and . J. Cryptol., 21 (3): 303-349 (2008)IntegriDB: Verifiable SQL for Outsourced Databases., , and . ACM Conference on Computer and Communications Security, page 1480-1491. ACM, (2015)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)How to Authenticate any Data Structure., , , and . Tiny Trans. Comput. Sci., (2015)Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions., , , and . TCC, volume 6597 of Lecture Notes in Computer Science, page 559-578. Springer, (2011)Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation., and . FSE, volume 1978 of Lecture Notes in Computer Science, page 284-299. Springer, (2000)Scalable Protocols for Authenticated Group Key Exchange., and . CRYPTO, volume 2729 of Lecture Notes in Computer Science, page 110-125. Springer, (2003)On achieving the "best of both worlds" in secure multiparty computation.. STOC, page 11-20. ACM, (2007)Which Languages Have 4-Round Zero-Knowledge Proofs?. TCC, volume 4948 of Lecture Notes in Computer Science, page 73-88. Springer, (2008)