On the (im-)possibility of extending coin toss

DOI10.1007/S00145-018-9296-XzbMATH Open1442.94038OpenAlexW2802375366MaRDI QIDQ1994641FDOQ1994641

Authors: Joern Mueller-Quade, Dominique Unruh, Dennis Hofheinz 

Publication date: 1 November 2018

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-018-9296-x

Recommendations

• On the (Im-)Possibility of Extending Coin Toss
• The limits of common coins: further results
• An Optimally Fair Coin Toss
• Can optimally-fair coin tossing be based on one-way functions?
• An optimally fair coin toss

zbMATH Keywords

cryptographic protocolsuniversal composabilityreactive simulatabilitycoin toss

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• GNUC: a new universal composability framework
• Probabilistic encryption
• Random generation of combinatorial structures from a uniform distribution
• Universal classes of hash functions
• Foundations of Cryptography
• Foundations of Cryptography
• Uniform generation of NP-witnesses using an NP-oracle
• An optimally fair coin toss
• Universally composable two-party and multi-party secure computation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theory of Cryptography
• Distributed pseudo-random bit generators---a new way to speed-up shared coin tossing
• Universal one-way hash functions via inaccessible entropy

Cited In (3)

• On the (Im-)Possibility of Extending Coin Toss
• The limits of common coins: further results
• Constant-round simulation-secure coin tossing extension with guaranteed output

Uses Software

• GNUC

This page was built for publication: On the (im-)possibility of extending coin toss

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1994641)