Random oracles in constantipole

DOI10.1145/343477.343531MaRDI QIDQ5176778zbMATH OpenOpenAlexFDO

Authors Christian Cachin, Victor Shoup, Klaus Kursawe

Publication date 3 March 2015

Published in Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/343477.343531

zbMATH Keywords

asynchronous consensusByzantine faultscrytographic common coindual-threshold schemesthreshold signatures

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
• On Optimal Probabilistic Asynchronous Byzantine Agreement
• On expected constant-round protocols for Byzantine agreement
• On Expected Constant-Round Protocols for Byzantine Agreement
• Byzantine agreement in polynomial expected time (extended abstract)
• Randomized protocols for asynchronous consensus
• Asymptotically Optimal Validated Asynchronous Byzantine Agreement

Cited in

(23)

• Low complexity Byzantine-resilient consensus
• High-threshold AVSS with optimal communication complexity
• Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
• An asynchronous protocol for distributed computation of RSA inverses and its applications
• Non-determinism in Byzantine fault-tolerant replication
• PoW-based distributed cryptography with no trusted setup
• Asynchronous Multi-Party Computation with Quadratic Communication
• scientific article; zbMATH DE number 1942434 (Why is no real title available?)
• scientific article; zbMATH DE number 1973984 (Why is no real title available?)
• scientific article; zbMATH DE number 4121395 (Why is no real title available?)
• scientific article; zbMATH DE number 1848309 (Why is no real title available?)
• Distributed Computing
• scientific article; zbMATH DE number 7774290 (Why is no real title available?)
• Simplex consensus: a simple and fast consensus protocol
• Closing the efficiency gap between synchronous and network-agnostic consensus
• Asymptotically optimal adaptive asynchronous common coin and DKG with silent setup
• Simplified adaptively secure threshold BLS signatures
• DRAGON: decentralization at the cost of representation after arbitrary GrOupiNg and its applications to sub-cubic DKG and interactive consistency
• Swiper: a new paradigm for efficient weighted distributed protocols
• Probabilistic Byzantine fault tolerance
• BBCA-\textsc{Chain}: low latency, high throughput BFT consensus on a DAG
• Context-dependent threshold decryption and its applications
• Synchronous distributed key generation without broadcasts

This page was built for publication: Random oracles in constantipole

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176778)