Adaptively Secure Coin-Flipping, Revisited

DOI10.1007/978-3-662-47666-6_53zbMath1447.94061arXiv1503.01588OpenAlexW2150404372MaRDI QIDQ3449514

Sunoo Park, Yael Tauman Kalai

Publication date: 4 November 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.01588

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (8)

On the round complexity of randomized Byzantine agreement ⋮ A lower bound for adaptively-secure collective coin flipping protocols ⋮ Adaptively Secure Coin-Flipping, Revisited ⋮ Estimating gaps in martingales and applications to coin-tossing: constructions and hardness ⋮ Completeness theorems for adaptively secure broadcast ⋮ Learning under \(p\)-tampering poisoning attacks ⋮ Polynomial-time targeted attacks on coin tossing for any number of corruptions ⋮ A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols

Cites Work

• Unnamed Item
• Some extremal problems arising from discrete control processes
• Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model
• Adaptively Secure Coin-Flipping, Revisited
• Adaptively Secure Broadcast
• Equilibrium points in n -person games

This page was built for publication: Adaptively Secure Coin-Flipping, Revisited