Proactive secret sharing or: How to cope with perpetual leakage

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

Volumn 963, Issue , 1995, Pages 339-352

  Herzberg, Amir ^a   Jarecki, Stanisław ^a   Krawczyk, Hugo ^a   Yung, Moti ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; INFORMATION THEORY;

AVAILABILITY AND INTEGRITIES; K-OUT-OF-N; LIFE-TIMES; PROACTIVE SECRET SHARING; PROACTIVE SECRET SHARING SCHEMES; SECRET SHARING SCHEMES; THRESHOLD SCHEMES; TIME-PERIODS;

LOCATION;

EID: 84957626176     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44750-4_27     Document Type: Conference Paper

References (19)

1. M. Bellare and P. Rogaway, Optimal Asymmetric Encryption, Eurocrypt '94.
2. G.R. Blkley, Safeguarding Cryptographic Keys, AFIPS Con. Proc (v. 48), 1979, pp 313-317.
3. R. Canetti and A. Herzberg, Maintaining Security in the Presence of Transient Faults, Proc. Crypto'94 (LNCS 839), pp. 425-438.
4. R. Canetti and A. Herzberg, Proactive Maintenance of Authenticated Communication, manuscript, 1995.
5. B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, Verifiable Secret Sharing and Achieving Simultaneoxis Broadcast, Proc. of IEEE Foes 1985, pp. 335-344.
6. M. Blum and S. Micali, How to Construct Cryptographically Strong Sequences of Pseudorandom Bits. SIAM J. Comp. 13, 1984.
7. A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung, How to Share a Function Securely, ACM STOC 94.
8. Y. Desmedt and Y. Frankel, Threshold cryptosystems, In G. Brassard, editor, Advances in Cryptology, Proc. of Crypto '89 (Lecture Notes in Computer Science 435), pages 307-315. Springer-Verlag, 1990.
9. D. Dolev, C. Dwork, O. Waarts, and M. Yung, Perfectly Secure Message Transmission, Proc. 31st Annual Symposium on the Foundations of Computer Science, 1990, (also JACM).
10. T. El Gamal, A Public key cryptosystem and a signature scheme based on discrete logarithm, IEEE TVans. on Information Theory 31, 465-472, 1985.
11. P. Feldman, A Practical Scheme for Non-Interactive Verifiable Secret Sharing, Proc. of the 28th IEEE Symposium on the Foundations of Computer Science, 1987, 427-437
12. S. Goldwasser and S. Micali, Probabilistic Encryption, 3. Com. Sys. Sci. 28 (1984), pp 270-299.
13. S. Goldwasser, S. Micali and R, Rivest, A Secure Digital Signature Scheme, Siam Journal on Computing, Vol. 17, 2 (1988), pp. 281-308.
14. A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk and M. Yung, Proactive Public Key and Signatures Systems, draft.
15. D.L. Long and A. Wigderson, The Discrete Log. Problem Hides 0(Log N) Bits. SIAM J. Comp. 17, 1988, pp. 363-372.
16. T. P. Pedersen, Distributed Provers with Applications to Undeniable Signature, Proc. Eurocrypt '91 (LNCS 547), pp. 221-242.
17. T. P. Pedersen, Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing, Proc. Crypto'91 (LNCS 576), pp. 129-140.
18. R. Ostrovsky and M Yung, How to withstand mobile virus attacks, Proc. of the 10th ACM Symp. on the Princ. of Distr. Comp., 1991, pp. 51-61.
19. A. Shamir. How to share a secret, Commun. ACM, 22 (1979), pp 612-613.