Constant-round simulation-secure coin tossing extension with guaranteed output

DOI10.1007/978-3-031-58740-5_5zbMATH Open1548.94886MaRDI QIDQ6637540FDOQ6637540

Authors: Damiano Abram, Jack Doerner, Yuval Ishai, Varun Narayanan 

Publication date: 13 November 2024

Recommendations

• On the (im-)possibility of extending coin toss
• On the (Im-)Possibility of Extending Coin Toss
• scientific article; zbMATH DE number 1842491
• Parallel coin-tossing and constant-round secure two-party computation
• On the Black-Box Complexity of Optimally-Fair Coin Tossing

zbMATH Keywords

cryptographic protocolsuniversal composabilityreactive simulatabilitycoin toss

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

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

Cited In (2)

• Constant-round simulation-secure coin tossing extension with guaranteed output
• Secure multiparty computation with identifiable abort via vindicating release

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)