|
|
|
|
| LEADER |
01058 am a22001573u 4500 |
| 001 |
137835.2 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Vaikuntananthan, Vinod
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
|e contributor
|
| 245 |
0 |
0 |
|a Some Open Problems in Information-Theoretic Cryptography
|
| 260 |
|
|
|c 2021-11-23T16:19:24Z.
|
| 856 |
|
|
|z Get fulltext
|u https://hdl.handle.net/1721.1/137835.2
|
| 520 |
|
|
|a © 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.
|
| 546 |
|
|
|a en
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t 10.4230/LIPIcs.FSTTCS.2017.5
|
