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
- Efficient multiparty protocols using circuit randomization
Cites work
- A simplified approach to threshold and proactive RSA
- Adaptively secure Feldman VSS and applications to universally-composable threshold cryptography
- Advances in Cryptology - CRYPTO 2003
- Efficient multiparty computations secure against an adaptive adversary
- 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
- Mutually independent commitments
- Non-interactive and information-theoretic secure verifiable secret sharing
- On Expected Constant-Round Protocols for Byzantine Agreement
- On the security of ElGamal based encryption
- Optimistic fair exchange of digital signatures. (Extended abstract)
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Secure and efficient asynchronous broadcast protocols. (Extended abstract)
- Secure distributed key generation for discrete-log based cryptosystems
- Simultaneous broadcast revisited
- Trading correctness for privacy in unconditional multi-party computation. (Extended abstract)
- Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes. (Extended abstract)
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)