Notice

This is not the latest version of this item. The latest version can be found at:https://dspace.mit.edu/handle/1721.1/137835.2

Some Open Problems in Information-Theoretic Cryptography

Author(s)
Vaikuntananthan, Vinod
Thumbnail
DownloadPublished version (308.7Kb)
Terms of use
Creative Commons Attribution 4.0 International license https://creativecommons.org/licenses/by/4.0/
Metadata
Show full item record
Abstract
© Vinod Vaikuntanathan. Information-theoretic cryptography is full of open problems with a communication-complexity flavor. We will describe several such problems that arise in the study of private information retrieval, secure multi-party computation, secret sharing, private simultaneous messages (PSM) and conditional disclosure of secrets (CDS). In all these cases, there is a huge (exponential) gap between the best known upper and lower bounds. We will also describe the connections between these problems, some old and some new.
Date issued
2017
URI
https://hdl.handle.net/1721.1/137835
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Citation
Vaikuntananthan, Vinod. 2017. "Some Open Problems in Information-Theoretic Cryptography."
Version: Final published version
Collections

Version History

VersionItemDateSummary
21721.1/137835.22021-11-23T16:18:22ZAuthority information verified/added.
11721.1/137835*2021-11-08T21:11:21Z

*Selected version