Author:
Cramer Ronald,Damgård Ivan,Ishai Yuval
Publisher
Springer Berlin Heidelberg
Reference32 articles.
1. Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications (Manuscript) (2004)
2. Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: Proc. of 22nd STOC, pp. 503–513 (1990)
3. Lecture Notes in Computer Science;D. Beaver,1998
4. Beimel, A.: Secure schemes for secret sharing and key distribution. PhD thesis, Technion (1996)
5. Beimel, A., Ishai, Y., Kushilevitz, E., Raymond, J.F.: Breaking the O(n 1/(2k − 1)) Barrier for Information-Theoretic Private Information Retrieval. In: Proceedings of the 43rd IEEE Conference on the Foundations of Computer Science (FOCS 2002), pp. 261–270 (2002)
Cited by
123 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献