Author:
Ishai Yuval,Kushilevitz Eyal,Ostrovsky Rafail,Prabhakaran Manoj,Sahai Amit
Publisher
Springer Berlin Heidelberg
Reference44 articles.
1. Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications. In: IEEE Conference on Computational Complexity, pp. 260–274. IEEE Computer Society, Los Alamitos (2005)
2. Lecture Notes in Computer Science;D. Beaver,1995
3. Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: Proc. 28th STOC, pp. 479–488. ACM, New York (1996)
4. Lecture Notes in Computer Science;D. Beaver,1990
5. Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: STOC, pp. 503–513. ACM, New York (1990)
Cited by
89 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献