A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
How to withstand mobile virus attacks (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Asynchronous secure computation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
The random oracle methodology, revisited (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
An asynchronous [(n - 1)/3]-resilient consensus protocol
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Towards fault-tolerant and secure on-line services
Towards fault-tolerant and secure on-line services
Secure distributed key generation for discrete-log based cryptosystems
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Practical threshold signatures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
An asynchronous protocol for distributed computation of RSA inverses and its applications
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Proactive secure message transmission in asynchronous networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
How to spread adversarial nodes?: rotate!
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
APSS: proactive secret sharing in asynchronous systems
ACM Transactions on Information and System Security (TISSEC)
Implementing Trustworthy Services Using Replicated State Machines
IEEE Security and Privacy
On fairness in simulatability-based cryptographic systems
Proceedings of the 2005 ACM workshop on Formal methods in security engineering
Proactive resilience through architectural hybridization
Proceedings of the 2006 ACM symposium on Applied computing
Hidden problems of asynchronous proactive recovery
HotDep'07 Proceedings of the 3rd workshop on on Hot Topics in System Dependability
Robust RSA distributed signatures for large-scale long-lived ad hoc networks
Journal of Computer Security - Special Issue on Security of Ad-hoc and Sensor Networks
Mobile proactive secret sharing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Efficient state transfer for hypervisor-based proactive recovery
Proceedings of the 2nd workshop on Recent advances on intrusiton-tolerant systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
HAIL: a high-availability and integrity layer for cloud storage
Proceedings of the 16th ACM conference on Computer and communications security
Modeling complexity in secure distributed computing
Future directions in distributed computing
Strong (n,t,n) verifiable secret sharing scheme
Information Sciences: an International Journal
MPSS: Mobile Proactive Secret Sharing
ACM Transactions on Information and System Security (TISSEC)
Distributed private-key generators for identity-based cryptography
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Fast asynchronous consensus with optimal resilience
DISC'10 Proceedings of the 24th international conference on Distributed computing
VPSS: a verifiable proactive secret sharing scheme in distributed systems
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
Verifiable secret sharing with comprehensive and efficient public verification
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
A proactive secret sharing for server assisted threshold signatures
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Asynchronous verifiable information dispersal
DISC'05 Proceedings of the 19th international conference on Distributed Computing
DSO: dependable signing overlay
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Computational verifiable secret sharing revisited
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Brief announcement: distributed cryptography using trinc
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Security and Communication Networks
Asynchronous computational VSS with reduced communication complexity
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
Hi-index | 0.00 |
Verifiable secret sharing is an important primitive in distributed cryptography. With the growing interest in the deployment of threshold cryptosystems in practice, the traditional assumption of a synchronous network has to be reconsidered and generalized to an asynchronous model. This paper proposes the first practical verifiable secret sharing protocol for asynchronous networks. The protocol creates a discrete logarithm-based sharing and uses only a quadratic number of messages in the number of participating servers. It yields the first asynchronous Byzantine agreement protocol in the standard model whose efficiency makes it suitable for use in practice. Proactive cryptosystems are another important application of verifiable secret sharing. The second part of this paper introduces proactive cryptosystems in asynchronous networks and presents an efficient protocol for refreshing the shares of a secret key for discrete logarithm-based sharings.