Cryptology ePrint Archive: Report 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).

Category / Keywords: foundations / bounded storage model; secure multiparty computation; oblivious transfer

Original Publication (with minor differences): 18th IMA International Conference on Cryptography and Coding

Date: received 1 Oct 2021

Contact author: jiahui at utexas edu

Available format(s): PDF | BibTeX Citation

Version: 20211005:153908 (All versions of this report)

Short URL: ia.cr/2021/1327


[ Cryptology ePrint archive ]