Paper 2010/096

Secret Sharing Extensions based on the Chinese Remainder Theorem

Kamer Kaya and Ali Aydın Selçuk


In this paper, we investigate how to achieve verifiable secret sharing (VSS) schemes by using the Chinese Remainder Theorem (CRT). We first show that two schemes proposed earlier are not secure from an attack where the dealer is able to distribute inconsistent shares to the users. Then we propose a new VSS scheme based on the CRT and prove its security. Using the proposed VSS scheme, we develop joint random secret sharing~(JRSS) and proactive SSS protocols, which, to the best of our knowledge, are the first secure protocols of their kind based on the CRT.

Note: A previous version containing the CRT based verifiable and joint random secret sharing protocols is published in Springer LNCS. By using the ideas in that article, we extended the manuscript and proposed a CRT based proactive secret sharing scheme. The current manuscript also contains an analysis of the practicability and efficiency of the proposed CRT based secret sharing protocols.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. A previous version is published in INDOCRYPT 2008
Verifiabilityjoint random secret sharingproactive secret sharingChinese Remainder TheoremAsmuth-Bloom
Contact author(s)
kamer @ cerfacs fr
2010-03-01: received
Short URL
Creative Commons Attribution


      author = {Kamer Kaya and Ali Aydın Selçuk},
      title = {Secret Sharing Extensions based on the Chinese Remainder Theorem},
      howpublished = {Cryptology ePrint Archive, Paper 2010/096},
      year = {2010},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.