Author:
Gradwohl Ronen,Naor Moni,Pinkas Benny,Rothblum Guy N.
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Balogh, J., Csirik, J.A., Ishai, Y., Kushilevitz, E.: Private computation using a PEZ dispenser. Theoretical Computer Science 306(1-3), 69–84 (2003)
2. Blum, M.: How to Prove a Theorem So No One Else Can Claim It. In: Proc. of the International Congress of Mathematicians, Berkeley, California, USA, pp.1444–1451 (1986)
3. Lecture Notes in Computer Science;C. Crépeau,1994
4. Fagin, R., Naor, M., Winkler, P.: Comparing Information Without Leaking It. Comm. of the ACM 39, 77–85 (1996)
5. Oded Goldreich, Modern Cryptography, Probabilistic Proofs and Pseudorandomness, Springer, Algorithms and Combinatorics, vol. 17 (1998)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献