Author of the publication

Covert Security with Public Verifiability: Faster, Leaner, and Simpler.

, , , , and . IACR Cryptology ePrint Archive, (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

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)Complete Fairness in Multi-Party Computation Without an Honest Majority., and . IACR Cryptology ePrint Archive, (2008)One-Round Protocols for Two-Party Authenticated Key Exchange., , and . ACNS, volume 3089 of Lecture Notes in Computer Science, page 220-232. Springer, (2004)Which Languages Have 4-Round Zero-Knowledge Proofs?. TCC, volume 4948 of Lecture Notes in Computer Science, page 73-88. Springer, (2008)Scalable Protocols for Authenticated Group Key Exchange., and . CRYPTO, volume 2729 of Lecture Notes in Computer Science, page 110-125. Springer, (2003)Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications.. EUROCRYPT, volume 2656 of Lecture Notes in Computer Science, page 211-228. Springer, (2003)On achieving the "best of both worlds" in secure multiparty computation.. STOC, page 11-20. ACM, (2007)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)