A verifiable secret sharing scheme based on the chinese remainder theorem
View/
Date Issued
2008Journal Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Language
English
Type
Conference Paper
Please cite this item using this persistent URL
http://hdl.handle.net/11693/26802Abstract
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. © 2008 Springer Berlin Heidelberg.
Published as
http://dx.doi.org/10.1007/978-3-540-89754-5_32Collections
- Conference Paper [2294]
Related items
Showing items related by title, author, creator and subject.
-
Practical threshold signatures with linear secret sharing schemes
(2009)Function sharing deals with the problem of distribution of the computation of a function (such as decryption or signature) among several parties. The necessary values for the computation are distributed to the participating ... -
Function and secret sharing extensions for Blakley and Asmuth-Bloom secret sharing schemes
(Bilkent University, 2009)Threshold cryptography deals with situations where the authority to initiate or perform cryptographic operations is distributed amongst a group of individuals. Usually in these situations a secret sharing scheme is used ... -
Threshold cryptography based on Asmuth-Bloom secret sharing
(2007)In this paper, we investigate how threshold cryptography can be conducted with the Asmuth-Bloom secret sharing scheme and present three novel function sharing schemes for RSA, ElGamal and Paillier cryptosystems. To the ...
