Paper 2021/1327 Original: eprint.iacr.org/2021/1327 ↗
Secure Multiparty Computation in the Bounded Storage Model
Abstract
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 lim- ited space. Past works have constructed schemes such as key exchange and bit commitment in this model. In this work, we expand the function- alities 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 assump- tions) to prove the security of our construction, following the work by Guan and Zhandry (EUROCRYPT 19).
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2021-10-05: last updated
- 2021-10-05: published
- Short URL
- https://ia.cr/2021/1327
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2021/1327,
author = {Jiahui Liu and Satyanarayana Vusirikala},
title = {Secure Multiparty Computation in the Bounded Storage Model},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/1327},
year = {2021},
url = {https://eprint.iacr.org/2021/1327}
}