On the computational complexity of coin flipping

DOI10.1109/FOCS.2010.64MaRDI QIDQ6990287zbMATH OpenFDO

Authors Manoj Prabhakaran, Amit Sahai, Hemanta K. Maji

Publication date 29 April 2025

Full work available at URL https://doi.org/10.1109/FOCS.2010.64

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(3)

• Fair coin flipping: tighter analysis and the many-party case
• On bounded storage key agreement and one-way functions
• A tight lower bound on adaptively secure full-information coin flip

This page was built for publication: On the computational complexity of coin flipping

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