From post

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.

 

Другие публикации лиц с тем же именем

Probabilistic encryption & how to play mental poker keeping secret all partial information, и . STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computing, стр. 365--377. New York, NY, USA, ACM Press, (1982)A "paradoxical" solution to the signature problem., , и . Providing Sound Foundations for Cryptography, ACM, (2019)Collusive dominant-strategy truthfulness., и . J. Econ. Theory, 147 (3): 1300-1312 (2012)Collusion, efficiency, and dominant strategies., и . Games Econ. Behav., (2017)Computationally-Sound Proofs.. Logic Colloquium, том 11 из Lecture Notes in Logic, стр. 214-268. Springer, (1995)How To Sign Given Any Trapdoor Function., и . CRYPTO, том 403 из Lecture Notes in Computer Science, стр. 200-215. Springer, (1988)Everything Provable is Provable in Zero-Knowledge., , , , , , и . CRYPTO, том 403 из Lecture Notes in Computer Science, стр. 37-56. Springer, (1988)Reconstructing Markov processes from independent and anonymous experiments., и . Discret. Appl. Math., (2016)Perfect concrete implementation of arbitrary mechanisms: a quick summary of joint work with Sergei Izmalkov and Matt Lepinski.. BQGT, стр. 88:1-88:5. ACM, (2010)Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract), , и . STOC, стр. 103-112. ACM, (1988)