Network-agnostic security comes (almost) for free in DKG and MPC
From MaRDI portal
Publication:6186588
DOI10.1007/978-3-031-38557-5_3OpenAlexW4385654456MaRDI QIDQ6186588
Chen-Da Liu-Zhang, Renas Bacho, Julian Loss, Daniel Collins
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://infoscience.epfl.ch/record/304711/files/2022-1369.pdf
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Secure distributed key generation for discrete-log based cryptosystems
- Fairness versus guaranteed output delivery in secure multiparty computation
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Sublinear-round Byzantine agreement under corrupt majority
- Aggregatable distributed key generation
- Guaranteed output delivery comes free in honest majority MPC
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation
- Synchronous consensus with optimal asynchronous fallback guarantees
- Communication-efficient unconditional MPC with guaranteed output delivery
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
- On communication-efficient asynchronous MPC with adaptive security
- Asynchronous Secure Multiparty Computation in Constant Time
- Secure Multi-Party Computation with Identifiable Abort
- Publicly Verifiable Secret Sharing
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Authenticated Algorithms for Byzantine Agreement
- Polynomial Codes Over Certain Finite Fields
- Asynchronous Multi-Party Computation with Quadratic Communication
- Cryptography in the Multi-string Model
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Vector Commitments and Their Applications
- Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience
- Communication Complexity of Byzantine Agreement, Revisited
- Detectable byzantine agreement secure against faulty majorities
- Asynchronous secure computation
- Asynchronous secure computations with optimal resilience (extended abstract)
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
- Perfectly-Secure MPC with Linear Communication Complexity
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Robust Multiparty Computation with Linear Communication Complexity
- Scalable Secure Multiparty Computation
- Reaching consensus for asynchronous distributed key generation
- Gossiping for communication-efficient broadcast
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
- State machine replication under changing network conditions
- \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions
This page was built for publication: Network-agnostic security comes (almost) for free in DKG and MPC
