Author of the publication

Non-interactive zero-knowledge and its applications.

, , and . Providing Sound Foundations for Cryptography, ACM, (2019)

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

Probabilistic encryption & how to play mental poker keeping secret all partial information, and . STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computing, page 365--377. New York, NY, USA, ACM Press, (1982)Two-Way Deterministic Finite Automata are Exponentially More Succinct Than Sweeping Automata.. Inf. Process. Lett., 12 (2): 103-105 (1981)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)Collusion, efficiency, and dominant strategies., and . Games Econ. Behav., (2017)Collusive dominant-strategy truthfulness., and . J. Econ. Theory, 147 (3): 1300-1312 (2012)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)Computationally-Sound Proofs.. Logic Colloquium, volume 11 of Lecture Notes in Logic, page 214-268. Springer, (1995)Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract), , and . STOC, page 103-112. ACM, (1988)An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement., and . ICALP, volume 372 of Lecture Notes in Computer Science, page 341-378. Springer, (1989)