( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds

, , , и . Electron. Colloquium Comput. Complex., (2001)

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.

Joe Lugalla

Joe Berghold

Johanna Joe

Joe Essien

Harry Joe

 

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

Impossibility results for recycling random bits in two-prover proof systems., и . STOC, стр. 457-468. ACM, (1995)A minimal model for secure computation (extended abstract)., , и . STOC, стр. 554-563. ACM, (1994)Betting boolean-style: a framework for trading in securities based on logical formulas., , , и . EC, стр. 144-155. ACM, (2003)Interactive Hashing: An Information Theoretic Tool (Invited Talk)., , и . ICITS, том 5155 из Lecture Notes in Computer Science, стр. 14-28. Springer, (2008)Improved Efficient Arguments (Preliminary Version).. CRYPTO, том 963 из Lecture Notes in Computer Science, стр. 311-324. Springer, (1995)A Web Based Covert File System., , и . HotOS, USENIX Association, (2007)Interactive Proofs with Space Bounded Provers., и . CRYPTO, том 576 из Lecture Notes in Computer Science, стр. 225-231. Springer, (1991)On Concurrent and Resettable Zero-Knowledge Proofs for NP, , и . CoRR, (2001)Two-Prover Protocols - Low Error at Affordable Rates., и . SIAM J. Comput., 30 (1): 324-346 (2000)Uses of randomness in algorithms and protocols.. MIT Press, (1990)