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

Perfect concrete implementation of arbitrary mechanisms: a quick summary of joint work with Sergei Izmalkov and Matt Lepinski.. BQGT, page 88:1-88:5. ACM, (2010)Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract), , and . STOC, page 103-112. ACM, (1988)Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements., , and . EUROCRYPT, volume 1807 of Lecture Notes in Computer Science, page 259-274. Springer, (2000)An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement., and . ICALP, volume 372 of Lecture Notes in Computer Science, page 341-378. Springer, (1989)Two-Way Deterministic Finite Automata are Exponentially More Succinct Than Sweeping Automata.. Inf. Process. Lett., 12 (2): 103-105 (1981)How To Sign Given Any Trapdoor Function., and . CRYPTO, volume 403 of Lecture Notes in Computer Science, page 200-215. Springer, (1988)Everything Provable is Provable in Zero-Knowledge., , , , , , and . CRYPTO, volume 403 of Lecture Notes in Computer Science, page 37-56. Springer, (1988)Crowdsourced Bayesian Auctions - (Abstract)., , and . AMMA, volume 80 of Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, page 53. Springer, (2011)Collusion, efficiency, and dominant strategies., and . Games Econ. Behav., (2017)Collusive dominant-strategy truthfulness., and . J. Econ. Theory, 147 (3): 1300-1312 (2012)