From private simultaneous messages to zero-information Arthur-Merlin protocols and back
type: Item
instance of: scholarly article
title: From private simultaneous messages to zero-information Arthur-Merlin protocols and back
zbMATH Open document ID: 1386.94062
author: Benny Applebaum
author: Pavel Raykov
published in: Journal of Cryptology
publication date: 2018-02-15T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 91A80
Mathematics Subject Classification ID: 68M12
zbMATH DE Number: 6839567
zbMATH Keywords: information-theoretic cryptography
zbMATH Keywords: zero-information Arthur-Merlin protocols
zbMATH Keywords: private simultaneous message protocols
zbMATH Keywords: conditional disclosure of secrets
MaRDI profile type: Publication
full work available at URL: s00145-016-9239-3
OpenAlex ID: W3023611952
cites work: Cryptography in $NC^0$
cites work: How to Garble Arithmetic Circuits
cites work: Minimizing locality of one-way functions via semi-private randomized encodings
cites work: From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back
cites work: On arithmetic branching programs
cites work: On the Cryptographic Complexity of the Worst Functions
cites work: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
cites work: Private information retrieval
cites work: A minimal model for secure computation (extended abstract)
cites work: Protecting data privacy in private information retrieval schemes
cites work: Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
cites work: Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication
cites work: Q4737161
cites work: Partial Garbling Schemes and Their Applications
cites work: A strong direct product theorem for disjointness
cites work: Q4375799
DOI: 10.1007/S00145-016-9239-3
description: scientific article; zbMATH DE number 6839567