Efficient Simultaneous Broadcast
From MaRDI portal
Recommendations
- Universally Composable Simultaneous Broadcast
- Simultaneous broadcast revisited
- Very-efficient simulatable flipping of many coins into a well (and a new universally-composable commitment scheme)
- Asymptotically free broadcast in constant expected time via packed VSS
- scientific article; zbMATH DE number 176564
Cites work
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- General secure multi-party computation from any linear secret-sharing scheme
- Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes
- How to share a secret
- scientific article; zbMATH DE number 1583789 (Why is no real title available?)
- scientific article; zbMATH DE number 1186873 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1302840 (Why is no real title available?)
- scientific article; zbMATH DE number 1302842 (Why is no real title available?)
- scientific article; zbMATH DE number 1304079 (Why is no real title available?)
- scientific article; zbMATH DE number 1304080 (Why is no real title available?)
- scientific article; zbMATH DE number 2081077 (Why is no real title available?)
- scientific article; zbMATH DE number 1848309 (Why is no real title available?)
- On Expected Constant-Round Protocols for Byzantine Agreement
- Optimistic fair exchange of digital signatures
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Simultaneous broadcast revisited
Cited in
(3)
This page was built for publication: Efficient Simultaneous Broadcast
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445453)