Multiplicative Partially Homomorphic CRT Secret Sharing

Shlomi Dolev; Yaniv Kleinman

Paper 2022/1496 Original: eprint.iacr.org/2022/1496 ↗

Multiplicative Partially Homomorphic CRT Secret Sharing

Shlomi Dolev

Yaniv Kleinman

Abstract

A new CRT-based positive (non-zero) secret-sharing scheme with perfect information-theoretic (PIT) security and multiplicative homomorphism is presented. The scheme is designed to support the evaluation of multiplications of non-zero secrets of multiplicative groups. Our CRT-based scheme is partially homomorphic, supporting homomorphic multiplications. Nevertheless, our scheme has the potential to be regarded as fully homomorphic for practical scenarios, such as bounded-sized multi-cloud databases.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Preprint.
History: 2022-11-13: last updated; 2022-10-31: published
Short URL: https://ia.cr/2022/1496
License: https://creativecommons.org/publicdomain/zero/1.0/

BibTeX

@misc{cryptoeprint:2022/1496,
      author = {Shlomi Dolev and Yaniv Kleinman},
      title = {Multiplicative Partially Homomorphic CRT Secret Sharing},
      howpublished = {Cryptology {ePrint} Archive, Paper 2022/1496},
      year = {2022},
      url = {https://eprint.iacr.org/2022/1496}
}