Some Open Problems in Information-Theoretic Cryptography
Some Open Problems in Information-Theoretic Cryptography
复制标题
信息论密码学中的一些悬而未决的问题
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
V. Vaikuntanathan
中科院分区：
文献类型：
--
作者：
V. Vaikuntanathan
信息论密码学充满了具有通信复杂性的开放问题。我们将描述在隐私信息检索、安全多方计算、秘密共享、私有同步消息（PSM）和条件秘密披露（CDS）研究中出现的几个此类问题。在所有这些情况下，最著名的上限和下限之间存在巨大（指数）差距。我们还将描述这些旧问题和新问题之间的联系。
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.