Multiplicative Partially Homomorphic CRT Secret Sharing: (Preliminary Version)

Shlomi Dolev; Yaniv Kleinman

doi:10.1109/NCA57778.2022.10013513

Multiplicative Partially Homomorphic CRT Secret Sharing: (Preliminary Version)

Shlomi Dolev, Yaniv Kleinman

Department of Computer Science

Research output: Contribution to conference › Paper › peer-review

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.

Original language	English
Pages	201-207
Number of pages	7
DOIs	https://doi.org/10.1109/NCA57778.2022.10013513
State	Published - Dec 2022
Event	21st IEEE International Symposium on Network Computing and Applications, NCA 2022 - Virtual, Online, United States Duration: 14 Dec 2022 → 16 Dec 2022

Conference

Conference	21st IEEE International Symposium on Network Computing and Applications, NCA 2022
Country/Territory	United States
City	Virtual, Online
Period	14/12/22 → 16/12/22

Keywords

Chinese Remainder Theorem
Homomorphism
Perfect Information Theoretic
Secret Sharing

ASJC Scopus subject areas

Computer Networks and Communications
Information Systems
Information Systems and Management
Safety, Risk, Reliability and Quality

Access to Document

10.1109/NCA57778.2022.10013513

Cite this

@conference{0bbcd54d38f1465a918b03f85265a693,

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 = "Funding Information: VI. ACKNOWLEDGMENT We thank Dani Berend for assisting throughout the process. Partially supported by Rita Altura trust chair in computer science. 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 = dec,

doi = "10.1109/NCA57778.2022.10013513",

language = "English",

pages = "201--207",

}

TY - CONF

T1 - Multiplicative Partially Homomorphic CRT Secret Sharing

T2 - 21st IEEE International Symposium on Network Computing and Applications, NCA 2022

AU - Dolev, Shlomi

AU - Kleinman, Yaniv

N1 - Funding Information: VI. ACKNOWLEDGMENT We thank Dani Berend for assisting throughout the process. Partially supported by Rita Altura trust chair in computer science. Publisher Copyright: © 2022 IEEE.

PY - 2022/12

Y1 - 2022/12

N2 - 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.

AB - 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.

KW - Chinese Remainder Theorem

KW - Homomorphism

KW - Perfect Information Theoretic

KW - Secret Sharing

UR - http://www.scopus.com/inward/record.url?scp=85147327134&partnerID=8YFLogxK

U2 - 10.1109/NCA57778.2022.10013513

DO - 10.1109/NCA57778.2022.10013513

M3 - Paper

SP - 201

EP - 207

Y2 - 14 December 2022 through 16 December 2022

ER -

Multiplicative Partially Homomorphic CRT Secret Sharing: (Preliminary Version)

Abstract

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this