Secure Multiparty Computation in the Bounded Storage Model
Secure Multiparty Computation in the Bounded Storage Model
复制标题
有界存储模型中的安全多方计算
DOI：
10.1007/978-3-030-92641-0_14
复制
发表时间：
2021
期刊：
影响因子：
--
通讯作者：
Satyanarayana Vusirikala
中科院分区：
文献类型：
--
作者：
Jiahui Liu;Satyanarayana Vusirikala
.大多数密码学都基于诸如因子分解和离散对数之类的假设，这些假设假设对手具有有限的计算能力。随着量子计算的最新发展以及对永久安全性的关注，人们有兴趣在有界存储模型中提出信息论结构。在这个模型中，对手在计算上是无限的，但空间有限。过去的工作已经构建了方案，如密钥交换和比特承诺在这个模型中。在这项工作中，我们通过在有界存储模型中构建半诚实MPC协议来进一步扩展功能。我们使用奇偶校验学习问题的难度（最近由Ran Raz（FOCS 16）在没有任何密码学假设的情况下证明）来证明我们的构造的安全性，这是继Guan和Zhandry（EUROPHOTOPT 19）之后的工作。
. Most cryptography is based on assumptions such as factoring and discrete log, which assume an adversary has bounded computational power. With the recent development in quantum computing as well as concern with everlasting security, there is an interest in coming up with information-theoretic constructions in the bounded storage model. In this model, an adversary is computationally unbounded but has limited space. Past works have constructed schemes such as key exchange and bit commitment in this model. In this work, we expand the functionalities further by building a semi-honest MPC protocol in the bounded storage model. We use the hardness of the parity learning problem (recently shown by Ran Raz (FOCS 16) without any cryptographic assumptions) to prove the security of our construction, following the work by Guan and Zhandry (EUROCRYPT 19).