Multiplicative Partially Homomorphic CRT Secret Sharing: (Preliminary Version)

Shlomi Dolev, Yaniv Kleinman

Research output: Contribution to conferencePaperpeer-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 languageAmerican English
Pages201-207
Number of pages7
DOIs
StatePublished - Dec 2022
Event21st IEEE International Symposium on Network Computing and Applications, NCA 2022 - Virtual, Online, United States
Duration: 14 Dec 202216 Dec 2022

Conference

Conference21st IEEE International Symposium on Network Computing and Applications, NCA 2022
Country/TerritoryUnited States
CityVirtual, Online
Period14/12/2216/12/22

Keywords

  • Chinese Remainder Theorem
  • Homomorphism
  • Perfect Information Theoretic
  • Secret Sharing

All Science Journal Classification (ASJC) codes

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

Fingerprint

Dive into the research topics of 'Multiplicative Partially Homomorphic CRT Secret Sharing: (Preliminary Version)'. Together they form a unique fingerprint.

Cite this