From private simultaneous messages to zero-information Arthur-Merlin protocols and back
From MaRDI portal
Publication:1698392
DOI10.1007/s00145-016-9239-3zbMath1386.94062OpenAlexW3023611952MaRDI QIDQ1698392
Publication date: 15 February 2018
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-016-9239-3
information-theoretic cryptographyconditional disclosure of secretsprivate simultaneous message protocolszero-information Arthur-Merlin protocols
Related Items (2)
Predicate encryption from bilinear maps and one-sided probabilistic rank ⋮ On the relationship between statistical zero-knowledge and statistical randomized encodings
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- On arithmetic branching programs
- From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back
- A minimal model for secure computation (extended abstract)
- A strong direct product theorem for disjointness
- Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication
- Private information retrieval
- Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
- Partial Garbling Schemes and Their Applications
- How to Garble Arithmetic Circuits
- 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
