@inproceedings{3d78367b767d4c65b18390260c25b66e,
title = "Multiplicative Partially Homomorphic CRT Secret Sharing: (Preliminary Version)",
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, it has the potential to be regarded as fully homomorphic for practical scenarios, such as bounded-sized multi-cloud databases.",
keywords = "Chinese Remainder Theorem, Homomorphism, Perfect Information Theoretic, Secret Sharing",
author = "Shlomi Dolev and Yaniv Kleinman",
note = "Publisher Copyright: {\textcopyright} 2022 IEEE.; 21st IEEE International Symposium on Network Computing and Applications, NCA 2022 ; Conference date: 14-12-2022 Through 16-12-2022",
year = "2022",
month = jan,
day = "1",
doi = "10.1109/NCA57778.2022.10013513",
language = "English",
series = "NCA 2022 - 2022 IEEE 21st International Symposium on Network Computing and Applications",
publisher = "Institute of Electrical and Electronics Engineers",
pages = "201--207",
editor = "Michele Colajanni and Luca Ferretti and Miguel Pardal and Avresky, \{Dimiter R.\}",
booktitle = "NCA 2022 - 2022 IEEE 21st International Symposium on Network Computing and Applications",
address = "United States",
}