Robust threshold schemes based on the Chinese remainder theorem
View/
Date
2008Journal Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Print ISSN
0302-9743
Volume
5023 LNCS
Pages
94 - 108
Language
English
Type
Conference PaperItem Usage Stats
12
views
views
5
downloads
downloads
Metadata
Show full item recordPlease cite this item using this persistent URL
http://hdl.handle.net/11693/26883Abstract
Recently, Chinese Remainder Theorem (CRT) based function sharing schemes are proposed in the literature. In this paper, we investigate how a CRT-based threshold scheme can be enhanced with the robustness property. To the best of our knowledge, these are the first robust threshold cryptosystems based on a CRT-based secret sharing. © 2008 Springer-Verlag Berlin Heidelberg.
Published as
http://dx.doi.org/10.1007/978-3-540-68164-9_7Keywords
Chinese remainder theoremElGamal
Paillier
Robustness
RSA
Threshold cryptography
Emergency vehicles
Fluorescent screens
Microfluidics
Television picture tubes
(k , n) threshold scheme
Chinese remainder theorem (CRT)
Cryptology
Function sharing schemes
Heidelberg (CO)
international conferences
Property (S)
Secret sharing
Springer (CO)
threshold cryptosystems
Cryptography