A simplified approach to threshold and proactive RSA

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

Volumn 1462, Issue , 1998, Pages 89-104

  Rabin, Tal ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Proactive signatures; RSA; Threshold and proactive RSA; Threshold signatures

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONSTANT TIME; DISTRIBUTED COMPUTATIONS; PROACTIVE SIGNATURES; PROBABILITY OF ERRORS; ROBUST COMPUTATION; THRESHOLD AND PROACTIVE RSA; THRESHOLD RSA; THRESHOLD SIGNATURE;

CRYPTOGRAPHY;

EID: 84957689308     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0055722     Document Type: Conference Paper

References (27)

1. [BF97] D. Boneh and M. Franklin. Efficient generation of shared RSA keys. In Crypto '97, pages 425-439, 1997. Springer-Verlag. LNCS No. 1294.
2. [BGW88] M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations. In Proc. 20th Annual Symp. on the Theory of Computing, pages 1-10. ACM, 1988.
3. [Boy89] C. Boyd. Digital Multisignatures. In H. Baker and F. Piper, editors, Cryptography and Coding, pages 241-246. Claredon Press, 1989.
4. [CGHN97] R. Canetti, R. Gennaro, A. Herzberg, and D. Naor. Proactive Security: Long-term Protextion Against Break-ins. CryptoBytes, 3(1):1-8, 1997.
5. [CH89] R. A. Croft and S. P. Harris. Public-key cryptography and re-usable shared secrets. In H. Baker and F. Piper, editors, Cryptography and Coding, pages 189-201. Claredon Press, 1989.
6. [CH94] R. Canetti and Amir Herzberg. Maintaining security in the presence of transient faults. Crypto '94, pages 425-438, 1994. Springer-Verlag. LNCS No. 839.
7. [CMI93] M. Cerecedo, T. Matsumoto, and H. Imai. Efficient and secure multiparty generation of digital signatures based on discrete logarithms. IEICE Trans. Fundamentals, E76-A(4):532-545, 1993.
8. [DDFY94] Alfredo De Santis, Yvo Desmedt, Yair Frankel, and Moti Yung. How to share a function securely. In Proc. 26th Annual Symp. on the Theory of Computing, pages 522-533. ACM, 1994.
9. [Des87] Yvo Desmedt. Society and group oriented cryptography: A new concept. In Crypto '87, pages 120-127, Berlin, 1987. Springer-Verlag. LNCS No. 293.
10. [Des94] Yvo G. Desmedt. Threshold cryptography. European Transactions on Telecommunications, 5(4):449-457, July 1994.
11. [DF89] Yvo Desmedt and Yair Frankel. Threshold cryptosystems. In G. Brassard, editor, Advances in Cryptology-Crypto '89, pages 307-315, Berlin, 1989. Springer-Verlag. LNCS No. 435.
12. [DF91] Y. Desmedt and Y. Frankel. Shared generation of authenticators and signatures. In J. Feigenbaum, editor, Advances in Cryptology-Crypto '91, pages 457-469, Berlin, 1991. Springer-Verlag. LNCS No. 576.
13. [DJ97] Y. Desmedt and S. Jajodia. Redistributing secret shares to new access structures and its applications. Tech. Report ISSE-TR-97-01, George Mason University, July 1997. ftp://isse.gmu.edu/pub/techrep/97_01-jajodia.ps.gz.
14. [FD92] Yair Frankel and Yvo Desmedt. Parallel reliable threshold multisignature. TR-92-04-02, April, Dept, of EE and CS, U of Wisconsin, 1992.
15. [Fel87] P. Feldman. A Practical Scheme for Non-Interactive Verifiable Secret Sharing. In Proc. 28th Annual FOCS, pages 427-437. IEEE, 1987.
16. [FGMY97a] Yair Frankel, P. Gemmell, P. Mackenzie, and M. Yung. Proactive RSA. In Crypto '97, pages 440-454, 1997. Springer-Verlag. LNCS No. 1294.
17. [FGMY97b] Y. Frankel, P. Gemmell, P. Mackenzie, and M. Yung. Optimal resilience proactive public-key cryptosystems. In Proc. 38th FOCS, pages 384-393. IEEE, 1997.
18. [FGY96] Y. Frankel, P. Gemmell, and M. Yung. Witness-based Cryptographic Program Checking and Robust Function Sharing. In Proc. 28th STOC, pages 499-508. ACM, 1996.
19. [FM88] P. Feldman and S. Micali. An Optimal Algorithm for Synchronous Byzantine Agreement. In Proc. 20th STOC, pages 148-161. ACM, 1988.
20. [Fra89] Y. Frankel. A practical protocol for large group oriented networks. In Eurocrypt '89, pages 56-61, 1989. Springer-Verlag. LNCS No. 434.
21. [GHY87] Z. Galil, S. Haber, and M. Yung. Cryptographic computation: Secure faut-tolerant protocols and the public-key model. In Crypto '87, pages 135-155, 1987. Springer-Verlag. LNCS No. 293.
22. [GJKR96a] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust threshold DSS signatures. In Eurocrypt '96, pages 354-371, 1996. Springer-Verlag. LNCS No. 1070.
23. [GJKR96b] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust and efficient sharing of RSA functions. In Crypto '96, pages 157-172, 1996. Springer-Verlag. LNCS No. 1109.
24. [Har94] L. Ham. Group oriented (t,n) digital signature scheme. IEE Proc.-Comput.Digit. Tech, 141(5):307-313, Sept 1994.
25. +97] Amir Herzberg, M. Jakobsson, Stanislaw Jarecki, Hugo Krawczyk, and Moti Yung. Proactive public key and signature systems. In 1997 ACM Conference on Computers and Communication Security, 1997.
26. [JJKY95] M. Jakobsson, S. Jarecki, H. Krawczyk, and M. Yung. Proactive RSA for Constant-Size Thresholds. Upublished manuscript, 1995.
27. [OY91] R. Ostrovsky and M. Yung. How to withstand mobile virus attacks. In Proc. 10th PODC, pages 51-59. ACM, 1991.