Threshold cryptography based on Asmuth–Bloom secret sharing
Selçuk, A. A.
4148 - 4160
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/13405
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.