Author:
Canetti Ran,Halevi Shai,Steiner Michael
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Lecture Notes in Computer Science;L. Ahn von,2003
2. Bellare, M., Impagliazzo, R., Naor, M.: Does parallel repetition lower the error in computationally sound protocols? In: 38th Annual Symposium on Foundations of Computer Science (FOCS 1997), pp. 374–383. IEEE, Los Alamitos (1997)
3. Ben-David, S., Chor, B., Goldreich, O., Luby, M.: On the theory of average case complexity. Journal of Computer and System Sciences 44(2), 193–219 (1992); Preliminary version in STOC 1989
4. Di Crescenzo, G., Ishai, Y., Ostrovsky, R.: Non-interactive and non-malleable commitment. In: Proceedings of the thirtieth annual ACM symposium on theory of computing (STOC 1998), pp. 141–150. ACM Press, New York (1998)
5. Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. SIAM J. on Computing 30(2), 391–437 (2000); Preliminary version in STOC 1991
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献