Cryptology ePrint Archive: Report 2008/483
Sharing DSS by the Chinese Remainder Theorem
Kamer Kaya and Ali Aydın Selšuk
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.
Category / Keywords: Asmuth-Bloom secret sharing, threshold cryptography, function sharing, DSS.
Date: received 16 Nov 2008, last revised 2 Nov 2010
Contact author: kamer at cs bilkent edu tr
Available format(s): PDF | BibTeX Citation
Version: 20101102:173216 (All versions of this report)
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]