Author:
Hazay Carmit,Mikkelsen Gert Læssøe,Rabin Tal,Toft Tomas,Nicolosi Angelo Agatino
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,Software
Reference64 articles.
1. J. Algesheimer, J. Camenisch, V. Shoup, Efficient computation modulo a shared secret with application to the generation of shared safe-prime products, in M. Yung, editor, CRYPTO. Lecture Notes in Computer Science, vol. 2442 (Springer, 2002), pp. 417–432
2. J. Bar-Ilan, D. Beaver, Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction, in P. Rudnicki, editor, Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing (ACM Press, New York, 1989), pp 201–209
3. S. Blackburn, S. Blake-Wilson, M. Burmester, S. Galbraith. Shared generation of shared RSA keys (1998).
http://cacr.math.uwaterloo.ca/techreports/1998/corr98-19.ps
4. R. Bendlin, I. Damgård, C. Orlandi, S. Zakarias. Semi-homomorphic encryption and multiparty computation, in EUROCRYPT (2011), pp. 169–188
5. D. Boneh, M. K. Franklin, Efficient generation of shared RSA keys. J. ACM
48(4), 702–722 (2001)
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献