A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem.

Bibliographic Details
Title: A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem.
Authors: Kaya, Kamer, Selçuk, Ali Aydın
Source: Progress in Cryptology - INDOCRYPT 2008; 2008, p414-425, 12p
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 by 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 a joint random secret sharing (JRSS) protocol, which, to the best of our knowledge, is the first JRSS protocol based on the CRT. [ABSTRACT FROM AUTHOR]
Copyright of Progress in Cryptology - INDOCRYPT 2008 is the property of Springer Nature / Books and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
DOI: 10.1007/978-3-540-89754-5_32
Database: Complementary Index