How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
CRYPTO '89 Proceedings on Advances in cryptology
Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Global, unpredictable bit generation without broadcast
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Provably secure session key distribution: the three party case
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
A Secure Group Membership Protocol
IEEE Transactions on Software Engineering
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
SIAM Journal on Computing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Communications of the ACM
Distributed Algorithms
Society and Group Oriented Cryptography: A New Concept
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
A Simplified Approach to Threshold and Proactive RSA
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
An asynchronous [(n - 1)/3]-resilient consensus protocol
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Randomized Byzantine Agreements
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Distributed Pseudo-random functions and KDCs
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
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
Sequential composition of protocols without simultaneous termination
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Asynchronous verifiable secret sharing and proactive cryptosystems
Proceedings of the 9th ACM conference on Computer and communications security
Verifying Randomized Byzantine Agreement
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Secure and Efficient Asynchronous Broadcast Protocols
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
A Threshold Pseudorandom Function Construction and Its Applications
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Efficient Secure Multi-party Computation
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Distributing Trust on the Internet
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
PRISM: Probabilistic Symbolic Model Checker
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
An asynchronous protocol for distributed computation of RSA inverses and its applications
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Efficient player-optimal protocols for strong and differential consensus
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Asynchronous group key exchange with failures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A process-algebraic approach for the analysis of probabilistic noninterference
Journal of Computer Security
Proceedings of the 11th ACM conference on Computer and communications security
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems
IEEE Transactions on Dependable and Secure Computing
Reliable broadcast in unknown fixed-identity networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Fault tolerance for internet agent systems: in cases of stop failure and byzantine failure
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Implementing Trustworthy Services Using Replicated State Machines
IEEE Security and Privacy
Low complexity Byzantine-resilient consensus
Distributed Computing
Byzantine Fault Tolerant Coordination for Web Services Atomic Transactions
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Asynchronous Multi-Party Computation with Quadratic Communication
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Hardening Botnet by a Rational Botmaster
Information Security and Cryptology
Fully Robust Tree-Diffie-Hellman Group Key Exchange
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Dependability metrics
Modeling complexity in secure distributed computing
Future directions in distributed computing
On the theoretical gap between synchronous and asynchronous MPC protocols
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Fast asynchronous consensus with optimal resilience
DISC'10 Proceedings of the 24th international conference on Distributed computing
Signature-free broadcast-based intrusion tolerance: never decide a Byzantine value
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
A necessary and sufficient synchrony condition for solving Byzantine consensus in symmetric networks
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Intrusion-tolerant fine-grained authorization for Internet applications
Journal of Systems Architecture: the EUROMICRO Journal
Optimistic asynchronous atomic broadcast
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Symmetry reduction for probabilistic model checking
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Cryptographic asynchronous multi-party computation with optimal resilience
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
On expected constant-round protocols for byzantine agreement
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
A practical and secure coercion-resistant scheme for internet voting
Towards Trustworthy Elections
Scalable byzantine agreement with a random beacon
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Cooperative security in distributed networks
Computer Communications
| Hi-index | 0.00 |
Byzantine agreement requires a set of parties in a distributed system to agree on a value even if some parties are corrupted. A new protocol for Byzantine agreement in a completely asynchronous network is presented that makes use of cryptography, specifically of threshold signatures and coin-tossing protocols. These cryptographic protocols have practical and provably secure implementations in the “random oracle” model. In particular, a coin-tossing protocol based on the Diffie-Hellman problem is presented and analyzed.The resulting asynchronous Byzantine agreement protocol is both practical and nearly matches the known theoretical lower bounds. More precisely, it tolerates the maximum number of corrupted parties, runs in constant expected time, has message and communication complexity close to the maximum, and uses a trusted dealer only in a setup phase, after which it can process a virtually unlimited number of transactions. Novel dual-threshold variants of both cryptographic protocols are used.The protocol is formulated as a transaction processing service in a cryptographic security model, which differs from the standard information-theoretic formalization and may be of independent interest.