Asymptotically free broadcast in constant expected time via packed VSS
From MaRDI portal
Publication:6114239
Recommendations
- Broadcast (and round) efficient verifiable secret sharing
- Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience
- The broadcast message complexity of secure multiparty computation
- Gossiping for communication-efficient broadcast
- Multi-valued Byzantine broadcast: the \(t < n\) case
Cites work
- A full proof of the BGW protocol for perfectly secure multiparty computation
- A lower bound for the time to assure interactive consistency
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Asynchronous secure computation
- Bounds on information exchange for Byzantine agreement
- Communication-efficient unconditional MPC with guaranteed output delivery
- Compact VSS and efficient homomorphic UC commitments
- Efficient perfectly secure computation with optimal resilience
- Efficient player-optimal protocols for strong and differential consensus
- General secure multi-party computation from any linear secret-sharing scheme
- scientific article; zbMATH DE number 1583776 (Why is no real title available?)
- scientific article; zbMATH DE number 1722683 (Why is no real title available?)
- scientific article; zbMATH DE number 4121395 (Why is no real title available?)
- Improving the Round Complexity of VSS in Point-to-Point Networks
- Information-theoretically secure protocols and security under composition
- On Expected Constant-Round Protocols for Byzantine Agreement
- Optimal extension protocols for Byzantine broadcast and agreement
- Perfectly-Secure MPC with Linear Communication Complexity
- Perfectly-secure multiplication for any \(t < n/3\)
- Probabilistic termination and composability of cryptographic protocols
- Reaching Agreement in the Presence of Faults
- Resilient-optimal interactive consistency in constant time
- Security and composition of multiparty cryptographic protocols
- Sequential composition of protocols without simultaneous termination
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
- The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols
- The Byzantine Generals Problem
- The resiliency of MPC with low interaction: the benefit of making errors (extended abstract)
- The round complexity of verifiable secret sharing and secure multicast
Cited in
(13)- Communication optimal multi-valued asynchronous broadcast protocol
- Efficient Simultaneous Broadcast
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
- Gossiping for communication-efficient broadcast
- \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
- On fully-secure honest majority MPC without \(n^2\) round overhead
- Asymptotically optimal message dissemination with applications to blockchains
- Perfect (parallel) broadcast in constant expected rounds via statistical VSS
- Towards achieving asynchronous MPC with linear communication and optimal resilience
- Linear-communication asynchronous complete secret sharing with optimal resilience
- Nearly optimal parallel broadcast in the plain public key model
- Asymptotically free broadcast in constant expected time via packed VSS
- Asynchronous agreement on a core set in constant expected time and more efficient asynchronous VSS and MPC
This page was built for publication: Asymptotically free broadcast in constant expected time via packed VSS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6114239)
