Paper 2015/1046
From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back
Benny Applebaum and Pavel Raykov
Abstract
Göös, Pitassi and Watson (ITCS, 2015) have recently introduced the notion of \emph{Zero-Information Arthur-Merlin Protocols} (ZAM). In this model, which can be viewed as a private version of the standard Arthur-Merlin communication complexity game, Alice and Bob are holding a pair of inputs
Metadata
- Available format(s)
- Publication info
- A major revision of an IACR publication in TCC 2016
- Keywords
- information-theoretic securityPrivate Simultaneous MessagesZero-Information Arthur-MerlinSecure Computation
- Contact author(s)
- raykov pavel @ gmail com
- History
- 2016-07-13: last of 3 revisions
- 2015-10-29: received
- See all versions
- Short URL
- https://ia.cr/2015/1046
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2015/1046, author = {Benny Applebaum and Pavel Raykov}, title = {From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back}, howpublished = {Cryptology {ePrint} Archive, Paper 2015/1046}, year = {2015}, url = {https://eprint.iacr.org/2015/1046} }