Cryptology ePrint Archive: Report 2021/274

Large Message Homomorphic Secret Sharing from DCR and Applications

Lawrence Roy and Jaspal Singh

Abstract: We present the first homomorphic secret sharing (HSS) construction that simultaneously (1) has negligible correctness error, (2) supports integers from an exponentially large range, and (3) relies on an assumption not known to imply FHE --- specifically, the Decisional Composite Residuosity (DCR) assumption. This resolves an open question posed by Boyle, Gilboa, and Ishai (Crypto 2016). Homomorphic secret sharing is analogous to fully-homomorphic encryption, except the ciphertexts are shared across two non-colluding evaluators. Previous constructions of HSS either had non-negligible correctness error and polynomial-size plaintext space or were based on the stronger LWE assumption. We also present two applications of our technique: a multi-server ORAM with constant bandwidth overhead, and a rate-1 trapdoor hash function with negligible error rate.

Category / Keywords: cryptographic protocols / homomorphic secret sharing, secure computation, trapdoor hash functions, oblivious RAM

Date: received 3 Mar 2021

Contact author: royl at oregonstate edu, singjasp@oregonstate edu

Available format(s): PDF | BibTeX Citation

Version: 20210304:133023 (All versions of this report)

Short URL: ia.cr/2021/274


[ Cryptology ePrint archive ]