Author of the publication

Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract)

, , , and . FOCS, page 383-395. IEEE Computer Society, (1985)

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

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)Probabilistic encryption, and . Journal of Computer and System Sciences, 28 (2): 270 - 299 (1984)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)Computationally-Sound Proofs.. Logic Colloquium, volume 11 of Lecture Notes in Logic, page 214-268. Springer, (1995)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)Noninteractive Zero-Knowledge, , , and . SIAM Journal on Computing, (1991)Two-Way Deterministic Finite Automata are Exponentially More Succinct Than Sweeping Automata.. Inf. Process. Lett., 12 (2): 103-105 (1981)Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract), , and . STOC, page 103-112. ACM, (1988)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)An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement., and . ICALP, volume 372 of Lecture Notes in Computer Science, page 341-378. Springer, (1989)