From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back

DOI10.1007/978-3-662-49099-0_3zbMath1377.94029OpenAlexW2395416426MaRDI QIDQ2799090

Benny Applebaum, Pavel Raykov

Publication date: 8 April 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49099-0_3

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Network protocols (68M12)

Related Items (9)

From private simultaneous messages to zero-information Arthur-Merlin protocols and back ⋮ Zero-Knowledge Proofs of Proximity ⋮ Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations ⋮ Unnamed Item ⋮ The communication complexity of private simultaneous messages, revisited ⋮ Placing conditional disclosure of secrets in the communication complexity universe ⋮ On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Ad Hoc PSM Protocols: Secure Computation Without Coordination

Cites Work

• Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
• Protecting data privacy in private information retrieval schemes
• Minimizing locality of one-way functions via semi-private randomized encodings
• A minimal model for secure computation (extended abstract)
• A strong direct product theorem for disjointness
• Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication
• Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
• On the Cryptographic Complexity of the Worst Functions
• Cryptography in $NC^0$

This page was built for publication: From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back