A verifiable secret sharing scheme based on the chinese remainder theorem
Author
Kaya, Kamer
Selçuk, Ali Aydın
Date
2008-12Source Title
Progress in Cryptology - Indocrypt 2008 : 9th International Conference on Cryptology in India
Publisher
Springer
Pages
414 - 425
Language
English
Type
Conference PaperItem Usage Stats
141
views
views
134
downloads
downloads
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. © 2008 Springer Berlin Heidelberg.
Keywords
Asmuth-Bloom secret sharing schemeChinese Remainder Theorem
Joint random secret sharing
Verifiability
Blooms (metal)
Fluorescent screens
Spectrum analyzers
Television picture tubes
Asmuth-Bloom secret sharing scheme
Chinese Remainder Theorem
Remainder theorem
Visual secret sharing (VSS) scheme
Cryptography
Permalink
http://hdl.handle.net/11693/26802Published Version (Please cite this version)
http://dx.doi.org/10.1007/978-3-540-89754-5_32Collections
Related items
Showing items related by title, author, creator and subject.
-
Practical threshold signatures with linear secret sharing schemes
Bozkurt, İlker Nadi; Kaya, Kamer; Selçuk, Ali Aydın (Springer, 2009-06)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
Bozkurt, İlker Nadi (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
Kaya, K.; Selçuk, A. A. (Elsevier Inc., 2007-10-01)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 cryptosysterns. To the ...