APSS, a proactive secret sharing (PSS) protocol for asynchronous systems, is explained and proved correct. The protocol enables a set of secret shares to be periodically refreshed with a new, independent set, thereby thwarting mobile-adversary attacks. Protocols for asynchronous systems are inherently less vulnerable to denial-of-service attacks, which slow processor execution or delay message delivery. So APSS tolerates certain attacks that PSS protocols for synchronous systems cannot.
|
1001
|
How to Share a Secret
– Shamir
- 1979
|
|
353
|
Practical Byzantine Fault Tolerance
– Castro, Liskov
- 1999
|
|
284
|
Byzantine quorum systems
– Malkhi, Reiter
- 1998
|
|
257
|
An Axiomatic Proof Technique for Parallel Programs I
– Owicki, Gries
- 1976
|
|
247
|
Safeguarding cryptographic keys
– Blakley
|
|
202
|
Non-interactive and information-theoretic secure veri secret sharing
– Pedersen
|
|
196
|
Threshold cryptosystem
– Desmedt, Frankel
- 1989
|
|
152
|
A practical scheme for non-interactive verifiable secret sharing
– Feldman
- 1987
|
|
137
|
Verifiable Secret Sharing and Achieving Simultaneity
– Chor, Goldwasser, et al.
- 1985
|
|
132
|
Proactive secret sharing, or: How to cope with perpetual leakage,”, Crypto 95
– Herzberg, Jarecki, et al.
- 1995
|
|
113
|
The rampart toolkit for building high-integrity services
– Reiter
- 1995
|
|
110
|
How to Withstand Mobile Virus Attacks
– Ostrovsky, Yung
|
|
102
|
Coca: A secure distributed online certification authority
– Zhou, Schneider, et al.
|
|
89
|
Concurrent Control with “Readers” and “Writers
– Courtois, Heymans, et al.
- 1971
|
|
82
|
Society and group oriented cryptography
– Desmedt
- 1987
|
|
82
|
Secret sharing schemes realizing general access structures
– Ito, Saito, et al.
- 1987
|
|
69
|
A Simplified Approach to Threshold and Proactive RSA. Crypto ’98
– Rabin
|
|
60
|
Automatically increasing the fault-tolerance of distributed algorithms
– Neiger, Toueg
- 1990
|
|
55
|
Secure and efficient asynchronous broadcast protocols (extended abstract
– Cachin, Kursawe, et al.
- 2001
|
|
53
|
Player simulation and general adversary structures in perfect multiparty computation
– Hirt, Maurer
- 2000
|
|
52
|
Survivable information storage systems
– Wylie, Bigrigg, et al.
|
|
49
|
Distributing trust with the Rampart toolkit
– REITER
- 1996
|
|
39
|
Digital Multisignatures
– Boyd
- 1989
|
|
38
|
Secure intrusion-tolerant replication on the internet
– Cachin, Poritz
- 2002
|
|
38
|
Optimal resilience proactive public-key cryptosystems
– Frankel, Gemmell, et al.
- 1997
|
|
33
|
Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks
– Aguilera, Chen, et al.
- 1999
|
|
33
|
Maintaining Authenticated Communication in the Presence of Break-Ins
– Canetti, Halevi, et al.
- 2000
|
|
33
|
Proactive RSA
– Frankel, Gemmell, et al.
|
|
30
|
Asynchronous verifiable secret sharing and proactive cryptosystems
– Cachin, Kursawe, et al.
- 2002
|
|
28
|
Redistributing secret shares to new access structures and its applications
– Desmedt, Jajodia
- 1997
|
|
19
|
Generalized Linear Threshold Scheme
– Kothari
- 1985
|
|
17
|
secret sharing and Public Key Cryptosystems
– Jarecki
- 1995
|
|
16
|
Proactive public-key and signature schemes
– Herzberg, Jakobsson, et al.
- 1997
|
|
13
|
Veri able secret sharing and achieving simultaneity in the presence of faults
– Chor, Goldwasser, et al.
- 1985
|
|
13
|
Byzantine agreement under restricted types of failures (not telling the truth is different from telling lies
– Hadzilacos
- 1983
|
|
9
|
Secure and ecient asynchronous broadcast protocols (extended abstract
– Cachin, Kursawe, et al.
- 2001
|
|
4
|
Concurrent reading while writing
– Lamport
- 1977
|
|
3
|
Towards building secure and fault-tolerant on-line services
– ZHOU
- 2001
|
|
2
|
personal communication
– Cachin
- 1994
|
|
1
|
Asynchronous veriable secret sharing and proactive cryptosystems. Unpublished draft
– Cachin, Kursawe, et al.
- 2002
|
