Author of the publication

How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority

, , and . STOC, page 218-229. ACM, (1987)

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

A "Paradoxical'"Solution to the Signature Problem (Abstract)., , and . CRYPTO, volume 196 of Lecture Notes in Computer Science, page 467. Springer, (1984)A Fair Protocol for Signing Contracts (Extended Abstract)., , , and . ICALP, volume 194 of Lecture Notes in Computer Science, page 43-52. Springer, (1985)Fractal Merkle Tree Representation and Traversal., , , and . CT-RSA, volume 2612 of Lecture Notes in Computer Science, page 314-326. Springer, (2003)Micropayments Revisited., and . CT-RSA, volume 2271 of Lecture Notes in Computer Science, page 149-163. Springer, (2002)Secret-Key Agreement without Public-Key Cryptography., and . CRYPTO, volume 773 of Lecture Notes in Computer Science, page 456-479. Springer, (1993)The Notion of Security for Probabilistic Cryptosystems., , and . CRYPTO, volume 263 of Lecture Notes in Computer Science, page 381-392. Springer, (1986)Proofs that yield nothing but their validity and a methodology of cryptographic protocol design., , and . Providing Sound Foundations for Cryptography, ACM, (2019)Non-interactive zero-knowledge and its applications., , and . Providing Sound Foundations for Cryptography, ACM, (2019)Amortized E-Cash., and . Financial Cryptography, volume 2339 of Lecture Notes in Computer Science, page 1-20. Springer, (2001)ALGORAND: The Efficient and Democratic Ledger.. CoRR, (2016)