Simplified threshold RSA with adaptive and proactive security

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4004 LNCS, Issue , 2006, Pages 593-611

  Almansa, Jesús F ^a   Damgård, Ivan ^a   Nielsen, Jesper Buus ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Adaptive Security; Proactiveness; Threshold RSA; Universal Composability

Indexed keywords

CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; NETWORK PROTOCOLS; THRESHOLD ELEMENTS;

ADAPTIVE SECURITY; PROACTIVENESS; THRESHOLD RSA; UNIVERSAL COMPOSABILITY;

SECURITY OF DATA;

EID: 33746104064     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11761679_35     Document Type: Conference Paper

References (22)

1. [Alm05] Jesús F. Almansa. A Study for Cryptologic Protocols. PhD thesis, BRICS, University of Aarhus, Department of Computer Science, IT-parken, Aabogade 34, DK-8200 Århus N, Denmark, 2005.
2. [Boy89] C. Boyd. Digital multisignatures. In Oxford University Press, editor, Cryptography and Coding, pages 241-246, 1989.
3. [Can] R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive.
4. [Can01] R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, page 136, 2001. FOCS'01.
5. [Can04] R. Canetti. Universally composable signature, certification, and authentication. Cryptology ePrint Archive, August 2004. Corrected version of the paper in Proceedings of the 17th IEEE Computer Security Foundations Workshop, pages 219-235, 2004.
6. [CGJ+99] R. Canetti, R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Adaptive security for threshold cryptosystems. In LNCS, volume 1666, pages 98-115, 1999. CRYPTO'99.
7. [Des87] Yvo Desmedt. Society and group oriented cryptography: A new concept. In LNCS, volume 293, pages 120-127, 1987. CRYPTO'87.
8. [DN03] Ivan Damgård and Jesper Buus Nielsen. Universally composable efficient multiparty computation from threshold homomorphic encryption. In LNCS, volume 2729, pages 247-264, 2003. CRYPTO'03.
9. [FD02] E. Fujisaki and I. Damgård. A statistically-hiding integer commitment scheme based on groups with hidden order. In Proceedings of Asiacrypt 2002: 125-142, pages 125-142, 2002. ASIACRYPT02.
10. [FGMY97a] Y. Frankel, P. Gemmell, P. Mackenzie, and Moti Yung. Optimal resilience proactive public-key cryptosystems. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, page 384, 1997. FOCS'97.
11. [FGMY97b] Y. Frankel, P. Gemmell, P. Mackenzie, and Moti Yung. Proactive RSA. In LNCS, volume 1294, pages 440-454, 1997. CRYPTO'97.
12. [FGY96] Yair Frankel, Peter Gemmell, and Moti Yung. Witness-based cryptographic program and robust function sharing. In 28th Annual ACM Symposium on Theory of Computing, pages 499-508, 1996. STOC'96.
13. [FMY01] Yair Frankel, Philip D. MacKenzie, and Moti Yung. Adaptive security for the additive-sharing based proactive RSA. In LNCS, volume 1992, pages 240-263, 2001. PKC'01.
14. [Fra89] Yair Frankel. A practical protocol for large group oriented networks. In LNCS, volume 434, pages 56-61, 1989. EUROCRYPT'89.
15. [GJK96] Rosario Gennaro, Stanislaw Jarecki, and Hugo Krawczyk. Robust and efficient sharing of RSA functions. In LNCS, volume 1109, pages 157-172, 1996. CRYPTO'96.
16. [JJKY95] M. Jakobsson, S. Jarecki, H. Krawczyk, and Moti Yung. "proactive RSA for constant-size thresholds". Unpublished manuscript, 1995.
17. [JS05] Stanislaw Jarecki and Nitesh Saxena. Further simplifications in proactive RSA signature schemes. In LNCS, volume 3378, pages 510-528, 2005. TCC'05.
18. [Nie04] Jesper Buus Nielsen. On Protocol Security in the Cryptographic Model. PhD thesis, BRIGS, University of Aarhus, Department of Computer Science, IT-parken, Aabogade 34, DK-8200 Århus N, Denmark, 2004.
19. [OY91] R. Ostrovsky and M. Yung. How to withstand mobile virus attack. In Proceedings of the 10th ACM Symposium on Principles of Distributed Computing, pages 51-59, 1991. PODC'91.
20. [Rab98] T. Rabin. A simplified approach to threshold and proactive RSA. In LNCS, volume 1462, pages 89-104, 1998. CRYPTO'98.
21. [SDFY94] Alfredo De Santis, Yvo Desmedt, Yair Frankel, and Moti Yung. How to share a function securely. In 26th Annual ACM Symposium on Theory of Computing, pages 522-533, 1994. STOC'94.
22. [Sho00] Victor Shoup. Practical threshold signatures. In LNCS, volume 1807, pages 207-220, 2000. EUROCRYPT 2000.