Paper 2008/483

Sharing DSS by the Chinese Remainder Theorem

Kamer Kaya and Ali Aydın Selçuk


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.

Available format(s)
Publication info
Published elsewhere. Unknown where it was published
Asmuth-Bloom secret sharingthreshold cryptographyfunction sharingDSS.
Contact author(s)
kamer @ cs bilkent edu tr
2010-11-02: revised
2008-11-19: received
See all versions
Short URL
Creative Commons Attribution


      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},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.