Some Open Problems in Information-Theoretic Cryptography
© 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 (...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2021
|
| Online Access: | https://hdl.handle.net/1721.1/137835 |
| _version_ | 1811088096633028608 |
|---|---|
| author | Vaikuntananthan, Vinod |
| author2 | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
| author_facet | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Vaikuntananthan, Vinod |
| author_sort | Vaikuntananthan, Vinod |
| collection | MIT |
| description | © 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. |
| first_indexed | 2024-09-23T13:56:12Z |
| format | Article |
| id | mit-1721.1/137835 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T13:56:12Z |
| publishDate | 2021 |
| record_format | dspace |
| spelling | mit-1721.1/1378352021-11-09T03:16:32Z Some Open Problems in Information-Theoretic Cryptography Vaikuntananthan, Vinod Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory © 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. 2021-11-08T21:11:21Z 2021-11-08T21:11:21Z 2017 2019-07-09T16:52:29Z Article http://purl.org/eprint/type/ConferencePaper https://hdl.handle.net/1721.1/137835 Vaikuntananthan, Vinod. 2017. "Some Open Problems in Information-Theoretic Cryptography." en 10.4230/LIPIcs.FSTTCS.2017.5 Creative Commons Attribution 4.0 International license https://creativecommons.org/licenses/by/4.0/ application/pdf DROPS |
| spellingShingle | Vaikuntananthan, Vinod Some Open Problems in Information-Theoretic Cryptography |
| title | Some Open Problems in Information-Theoretic Cryptography |
| title_full | Some Open Problems in Information-Theoretic Cryptography |
| title_fullStr | Some Open Problems in Information-Theoretic Cryptography |
| title_full_unstemmed | Some Open Problems in Information-Theoretic Cryptography |
| title_short | Some Open Problems in Information-Theoretic Cryptography |
| title_sort | some open problems in information theoretic cryptography |
| url | https://hdl.handle.net/1721.1/137835 |
| work_keys_str_mv | AT vaikuntananthanvinod someopenproblemsininformationtheoreticcryptography |