Download PDFOpen PDF in browser

Multiplicative (Non-Zero) Homomorphic CRT Secret Sharing

EasyChair Preprint no. 8446

18 pagesDate: July 10, 2022


This work suggests a new CRT-based secret sharing scheme with perfect information-theoretic security and multiplicative homomorphism.
The scheme is designed to support non-zero secrets of multiplicative groups.
We will review some related works in the CRT-based secret sharing schemes and see why our scheme is innovative. Our scheme will be detailed and analyzed in this work in order to set solid foundations for future work expanding this scheme.

Keyphrases: Chinese Remainder Theorem, homomorphism, secret sharing

BibTeX entry
BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:
  author = {Shlomi Dolev and Yaniv Kleinman},
  title = {Multiplicative (Non-Zero) Homomorphic CRT Secret Sharing},
  howpublished = {EasyChair Preprint no. 8446},

  year = {EasyChair, 2022}}
Download PDFOpen PDF in browser