Paper 2008/483 Original: eprint.iacr.org/2008/483 ↗
Sharing DSS by the Chinese Remainder Theorem
Abstract
In this paper, we propose a new threshold scheme for the Digital Signature Standard (DSS) using Asmuth-Bloom secret sharing based on the Chinese Remainder Theorem (CRT). To achieve the desired result, we first show how to realize certain other threshold primitives using Asmuth-Bloom secret sharing, such as joint random secret sharing, joint exponential random secret sharing, and joint exponential inverse random secret sharing. We prove the security of our scheme against a static adversary. To the best of our knowledge, this is the first provably secure threshold DSS scheme based on the CRT.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2010-11-02: last updated
- 2008-11-19: published
- Short URL
- https://ia.cr/2008/483
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2008/483,
author = {Kamer Kaya and Ali Aydın Selçuk},
title = {Sharing DSS by the Chinese Remainder Theorem},
howpublished = {Cryptology {ePrint} Archive, Paper 2008/483},
year = {2008},
url = {https://eprint.iacr.org/2008/483}
}