A verifiable secret sharing scheme based on the chinese remainder theorem
Date
2008-12
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
0
views
views
44
downloads
downloads
Citation Stats
Series
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.
Source Title
Progress in Cryptology - Indocrypt 2008 : 9th International Conference on Cryptology in India
Publisher
Springer
Course
Other identifiers
Book Title
Keywords
Asmuth-Bloom secret sharing scheme, Chinese 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
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
English