Cryptology ePrint Archive: Report 2010/096
Secret Sharing Extensions based on the Chinese Remainder Theorem
Kamer Kaya and Ali Aydın Selšuk
Abstract: 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.
Category / Keywords: cryptographic protocols / Verifiability, joint random secret sharing, proactive secret sharing, Chinese Remainder Theorem, Asmuth-Bloom
Publication Info: A previous version is published in INDOCRYPT 2008
Date: received 22 Feb 2010, last revised 26 Feb 2010
Contact author: kamer at cerfacs fr
Available format(s): PDF | BibTeX Citation
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.
Version: 20100301:225203 (All versions of this report)
Short URL: ia.cr/2010/096
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]