Public vs Private Coin in Bounded-Round Information

DOI10.1007/978-3-662-43948-7_42zbMath1395.68116OpenAlexW230726820MaRDI QIDQ5167768

Ankit Garg, Mark Braverman

Publication date: 1 July 2014

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

Full work available at URL: https://doi.org/10.1007/978-3-662-43948-7_42

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Authentication, digital signatures and secret sharing (94A62)

Related Items (7)

On Slepian-Wolf theorem with interaction ⋮ Towards a reverse Newman's theorem in interactive information complexity ⋮ Making Randomness Public in Unbounded-Round Information Complexity ⋮ Information complexity and applications. ⋮ On Slepian–Wolf Theorem with Interaction ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Public vs Private Coin in Bounded-Round Information