Perfect (parallel) broadcast in constant expected rounds via statistical VSS
From MaRDI portal
Publication:6637549
DOI10.1007/978-3-031-58740-5_11MaRDI QIDQ6637549
Anirudh Chandramouli, Gilad Asharov
Publication date: 13 November 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols
- A lower bound for the time to assure interactive consistency
- Security and composition of multiparty cryptographic protocols
- Probabilistic termination and composability of cryptographic protocols
- Communication complexity of Byzantine agreement, revisited
- Information-theoretically secure protocols and security under composition
- The Round Complexity of Verifiable Secret Sharing: The Statistical Case
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- Sequential composition of protocols without simultaneous termination
- Round Efficient Unconditionally Secure Multiparty Computation Protocol
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
- Gossiping for communication-efficient broadcast
- Asymptotically free broadcast in constant expected time via packed VSS
- Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security
- Perfect (parallel) broadcast in constant expected rounds via statistical VSS
Related Items (1)
This page was built for publication: Perfect (parallel) broadcast in constant expected rounds via statistical VSS
