Multiplicative Partially Homomorphic CRT Secret Sharing

ePrint Report: Multiplicative Partially Homomorphic CRT Secret Sharing

Yaniv Kleinman, Shlomi Dolev

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.

crt eprint report secret sharing