Threshold cryptography based on Asmuth–Bloom secret sharing

Date
2007-10-01
Authors
Kaya, K.
Selçuk, A. A.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Information Sciences
Print ISSN
0020-0255
Electronic ISSN
Publisher
Elsevier Inc.
Volume
177
Issue
19
Pages
4148 - 4160
Language
English
Journal Title
Journal ISSN
Volume Title
Series
Abstract

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 best of our knowledge, these are the first provably secure threshold cryptosystems realized using the Asmuth-Bloom secret sharing. Proposed schemes are comparable in performance to earlier proposals in threshold cryptography. (c) 2007 Elsevier Inc. All rights reserved.

Course
Other identifiers
Book Title
Citation
Published Version (Please cite this version)