Proactive RSA

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

Volumn 1294, Issue , 1997, Pages 440-454

  Frankel, Yair ^a   Gemmell, Peter ^b   Mackenzie, Philip D ^c   Yung, Moti ^a  

^a CertCo   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

^c BOISE STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONTINUOUS FUNCTIONS; CRYPTOGRAPHIC PRIMITIVES; DISTRIBUTED REPRESENTATION; MOBILE ADVERSARY; PROACTIVE MAINTENANCE; RSA SIGNATURES; TECHNICAL DIFFICULTIES; THRESHOLD RSA;

CRYPTOGRAPHY;

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

References (25)

1. N. Alon, Z. Galil and M. Yung, Dynamic-resharing Verifiable Secret Sharing, European Symposium on Algorithms (ESA) 95, Springer-Verlag LNCS.
2. G.R. Blakley, Safeguarding Cryptographic Keys, AFIPS Con. Proc (v. 48), 1979, pp 313-317.
3. M. Blum, Designing programs to check their work, ICSI Technical report TR-88-009.
4. C. Boyd, Digital Multisignatures, IMA Conference on Cryptography and Coding, Claredon Press, 241-246, (Eds. H. Baker and F. Piper), 1986.
5. D. Boneh and M. Franklin, Efficient Generation of Shared RSA Keys, Crypto 97 (these proceedings).
6. R. Canetti and A. Herzberg, Maintaining Security in the presence of transient faults, Crypto '94, Springer-Verlag, 1994.
7. J. Cohen and M. Fischer, A robust and verifiable cryptographically secure election scheme, FOCS 85.
8. A. De Santis, Y. Desmedt, Y. Frankel and M. Yung, How to Share a Function Securely, ACM STOC 94. (First version May 92).
9. Y. Desmedt and Y. Frankel, Threshold cryptosystems, Crypto '89 Springer-Verlag, 1990.
10. Y. Desmedt and Y. Frankel, Shared generation of authenticators and signatures, Crypto 91, Springer-Verlag LNCS 576, 1992, pp. 307-315.
11. P. Feldman, A Practical Scheme for Non-Interactive Verifiable Secret Sharing, Proc. of the 28th IEEE FOCS pp. 427-437, 1987
12. Y. Frankel, A practical protocol for large group oriented networks, Eurocrypt '89, Springer-Verlarg LNCS 773, pp. 56-61.
13. Y. Frankel and Y. Desmedt. Distributed reliable threshold multisigna-tures, Tech. Report version TR-92-04-02, Dept. of EE &: CS, Univ. of Wisconsin-Milwaukee, April 1992.
14. Y. Frankel, P. Gemmell and M. Yung, Witness-based Cryptographic Program Checking and Robust Function Sharing Proc. of STOC 1996, pp. 499-508.
15. M. Franklin and M. Yung, Secure and Efficient Digital Coin, ICALP 93, Springer Verlag LNCS.
16. Z. Galil, S. Haber and M. Yung, Minimum-Knowledge Interactive Proofs for Decision Problems, SIAM Journal on Computing, vol. 18, n.4, pp. 711-739. (Previous version in FOCS 85)
17. R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin, Robust Threshold DSS Signatures, Eurocrypt 96
18. R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin, Robust and Efficient Sharing of RSA, Crypto 96
19. S. Goldwasser and S. Micali, Probabilistic Encryption, J. Comp. Sys. Sci. 28, 1984, pp. 270-299.
20. A. Herzberg, S. Jarecki, H. Krawczyk and M. Yung, How to Cope with Perpetual Leakage, or: Proactive Secret Sharing, Crypto 95.
21. A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, and M. Yung, Proactive public key and signature systems, The 4-th ACM Symp. on Comp. and Comm. Security. April 1997.
22. M. Luby, Pseudorandomness and its Cryptographic Applications, Princeton University Press, 1996
23. R. Ostrovsky and M. Yung, How to withstand mobile virus attacks, ACM Symposium on Principles of Distributed Computing (PODC), 1991, pp. 51-61.
24. R. Rivest, A. Shamir and L. Adleman, A Method for Obtaining Digital Signature and Public Key Cryptosystems, Comm. of the ACM, 21 (1978), pp. 120-126.
25. A. Shamir. How to share a secret, Comm. of the ACM, 22 (1979), pp. 612-613