Paper 2021/1327

Secure Multiparty Computation in the Bounded Storage Model

Jiahui Liu and Satyanarayana Vusirikala

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
Published elsewhere. Minor revision.18th IMA International Conference on Cryptography and Coding
Keywords
bounded storage modelsecure multiparty computationoblivious transfer
Contact author(s)
jiahui @ utexas edu
History
2021-10-05: received
Short URL
https://ia.cr/2021/1327
License
Creative Commons Attribution
CC BY

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},
      note = {\url{https://eprint.iacr.org/2021/1327}},
      url = {https://eprint.iacr.org/2021/1327}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.