Author:
Canetti Ran,Cohen Asaf,Lindell Yehuda
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Lecture Notes in Computer Science;D Beaver,1992
2. Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, pp. 1444–1451, USA
3. Canetti, R.: Security and composition of multiparty cryptographic protocols. J. cryptology 13(1), 143–202 (2000)
4. Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: In the
$$42$$
42
nd FOCS, pp. 136–145 (2001)
5. Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000/067 (revision of 13 December 2005)
Cited by
51 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献