Constant-round simulation-secure coin tossing extension with guaranteed output
From MaRDI portal
Publication:6637540
Recommendations
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- A new outlook on Shannon's information measures
- An algebraic framework for silent preprocessing with trustless setup and active security
- Constant-round simulation-secure coin tossing extension with guaranteed output
- Distributed (correlation) samplers: how to remove a trusted dealer in one round
- Distributed pseudo-random bit generators---a new way to speed-up shared coin tossing
- Fair coin flipping: tighter analysis and the many-party case
- Foundations of Cryptography
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- Lossy trapdoor functions and their applications
- New directions in cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- On the (Im-)Possibility of Extending Coin Toss
- Optimal broadcast encryption from LWE and pairings in the standard model
- Parallel coin-tossing and constant-round secure two-party computation
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Randomness is linear in space
- Secure multi-party computation with identifiable abort
- Security and composition of multiparty cryptographic protocols
- Security-preserving distributed samplers: how to generate any CRS in one round without random oracles
- The Magic of ELFs
- Theory of Cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
Cited in
(2)
This page was built for publication: Constant-round simulation-secure coin tossing extension with guaranteed output
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637540)
