Author:
Brakerski Zvika,Katz Jonathan,Segev Gil,Yerukhimovich Arkady
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications. Computational Complexity 15(2), 115–162 (2006)
2. Lecture Notes in Computer Science;B. Barak,2009
3. Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: 28th Annual ACM Symposium on Theory of Computing (STOC), pp. 479–488. ACM Press, New York (1996)
4. Lecture Notes in Computer Science;M. Bellare,1990
5. Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIAM Journal on Computing 30(2), 391–437 (2000)
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献