(Enter summary)
Abstract: Secret sharing schemes protect secrets by distributing them over different locations (share holders). In particular, in k out of n threshold schemes, security is assured if throughout the entire life-time of the secret the adversary is restricted to compromise less than k of the n locations. For long-lived and sensitive secrets this protection may be insufficient. We propose an efficient proactive secret sharing scheme, where shares are periodically renewed (without changing the secret) in such ... (Update)
Cited by: More
Distributed "Magic Ink" Signatures - Markus Jakobsson Moti
(Correct)
Authentication in a Reconfigurable Byzantine - Fault Tolerant System
(Correct)
Verifiable Secret Redistribution - Theodore Wong Jeannette
(Correct)
Similar documents (at the sentence level):
55.8%: Proactive Secret Sharing and Public Key Cryptosystems - Jarecki (1995)
(Correct)
Active bibliography (related documents): More All
0.0: The Foundations of Modern Cryptography - Goldreich (1998)
(Correct)
0.0: Proactive RSA - Frankel, Gemmell, MacKenzie, Yung (1997)
(Correct)
0.0: Privacy vs. Authenticity - Jakobsson (1997)
(Correct)
Similar documents based on text: More All
0.5: Proactive Public Key and Signature Systems - Herzberg, Jakobsson, Jarecki.. (1997)
(Correct)
0.4: Efficient Threshold Cryptosystems - Jarecki (2001)
(Correct)
0.3: Optimal-Resilience Proactive Public-Key Cryptosystems - Frankel, Gemmell.. (1997)
(Correct)
Related documents from co-citation: More All
44: How to Share a Secret (context) - Shamir - 1979
34: How to withstand mobile virus attacks (context) - Ostrovsky, Yung - 1991
32: A Practical Scheme for Non-Interactive Verifiable Secret Sharing (context) - Feldman - 1987
BibTeX entry: (Update)
A.Herzberg, S.Jarecki, H.Krawczyk, M.Yung, "Proactive secret sharing or: How to cope with perpetual leakage", LNCS 963, Proc. Crypto'95, Springer Verlag, (1995), pp. 339--352. http://citeseer.ist.psu.edu/herzberg95proactive.html More
@article{ herzberg95proactive,
author = "Amir Herzberg and Stanislaw Jarecki and Hugo Krawczyk and Moti Yung",
title = "Proactive Secret Sharing Or: How to Cope With Perpetual Leakage",
journal = "Lecture Notes in Computer Science",
volume = "963",
pages = "339--352",
year = "1995",
url = "citeseer.ist.psu.edu/herzberg95proactive.html" }
Citations (may not include all citations):
645
How to share a secret (context) - Shamir - 1979
278
Probabilistic Encryption (context) - Goldwasser, Micali - 1984
193
Threshold cryptosystems (context) - Desmedt, Frankel - 1990
186
A Public key cryptosystem and a signature scheme based on di.. (context) - Gamal - 1985
174
Safeguarding Cryptographic Keys (context) - Blakley - 1979
165
Optimal Asymmetric Encryption
- Bellare, Rogaway
159
Non-Interactive and Information-Theoretic Secure Verifiable .. (context) - Pedersen
133
A Practical Scheme for Non-Interactive Verifiable Secret Sha.. (context) - Feldman - 1987
119
How to withstand mobile virus attacks (context) - Ostrovsky, Yung - 1991
109
Verifiable Secret Sharing and Achieving Simultaneous Broadca.. (context) - Chor, Goldwasser et al. - 1985
72
How to Share a Function Securely (context) - De Santis, Desmedt et al.
65
Proactive Public Key and Signatures Systems
- Herzberg, Jakobsson et al.
57
Distributed Provers with Applications to Undeniable Signatur.. (context) - Pedersen
40
Maintaining Security in the Presence of Transient Faults (context) - Canetti, Herzberg
20
A Secure Digital Signature Scheme (context) - Goldwasser, Micali et al. - 1988
3
How to Construct Cryptographically Strong Sequences of Pseud.. (context) - Blum, Micali - 1984
3
Proactive Maintenance of Authenticated Communication (context) - Canetti, Herzberg - 1995
1
Problem Hides O (context) - Long, Wigderson et al. - 1988
1
st Annual Symposium on the Foundations of Computer Science (context) - Dolev, Dwork et al. - 1990
1
Multi secret sharing (context) - Yung
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.counterpane.com/biblio/year-1995.html): More
The Security of MacGuffin - Wagner
(Correct)
Using Temporal Logic to Specify and Verify Cryptographic.. - Gray, III, McLean (1995)
(Correct)
A Key-schedule Weakness in SAFER K-64 - Knudsen (1995)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC