Paper 2022/1496
Multiplicative Partially Homomorphic CRT Secret Sharing
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.
- Keywords
- Secret Sharing Perfect Information Theoretic Homomorphism Chinese Remainder Theorem.
- Contact author(s)
-
dolev @ cs bgu ac il
yanivkl @ post bgu ac il - History
- 2022-11-13: revised
- 2022-10-31: received
- See all versions
- Short URL
- https://ia.cr/2022/1496
- License
-
CC0
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}
}