Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
From MaRDI portal
Publication:6070449
DOI10.1007/s00145-023-09484-0zbMath1527.94023arXiv2002.02516OpenAlexW3183600325MaRDI QIDQ6070449
Elette Boyle, Ran Cohen, Aarushi Goel
Publication date: 21 November 2023
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.02516
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
- Impossibility results for universal composability in public-key models and with fixed inputs
- Must the communication graph of MPC protocols be an expander?
- Easy impossibility proofs for distributed consensus problems
- Synchronized aggregate signatures from the RSA assumption
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Distributed SSH key management with proactive RSA threshold signatures
- The hunting of the SNARK
- Compact multi-signatures for smaller blockchains
- Robust threshold DSS signatures
- Security and composition of multiparty cryptographic protocols
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- Sublinear-round Byzantine agreement under corrupt majority
- Asynchronous Byzantine agreement with subquadratic communication
- Expected constant round Byzantine broadcast under dishonest majority
- Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions
- Probabilistic termination and composability of cryptographic protocols
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- Lower bound for scalable Byzantine agreement
- Secure multi-party computation in large networks
- Algorand: a secure and efficient distributed ledger
- Efficient cryptographic schemes provably as secure as subset sum
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
- Asynchronous Secure Multiparty Computation in Constant Time
- Universally Composable Authentication and Key-Exchange with Global PKI
- Sequential Aggregate Signatures Made Shorter
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Secure Two-Party Computation with Low Communication
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions
- The Hidden Graph Model
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- On the composition of authenticated Byzantine Agreement
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- New lattice based cryptographic constructions
- Scalable leader election
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Scalable and Unconditionally Secure Multiparty Computation
- Universal Arguments and their Applications
- From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits
- Bounds on information exchange for Byzantine agreement
- Fault Tolerance in Networks of Bounded Degree
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- The Byzantine generals strike again
- Group Signatures
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Foundations of Cryptography
- Communication Locality in Secure Multi-party Computation
- Reducibility among Combinatorial Problems
- Communication Complexity of Byzantine Agreement, Revisited
- Public-key cryptosystems from the worst-case shortest vector problem
- Fast byzantine agreement
- Fully polynomial Byzantine agreement in t + 1 rounds
- Advances in Cryptology - EUROCRYPT 2004
- Breaking the O ( n 2 ) bit barrier
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Scalable Secure Multiparty Computation
- On Expected Constant-Round Protocols for Byzantine Agreement
- Brief Announcement: Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
