Sharing DSS by the Chinese Remainder Theorem

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,...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computational and applied mathematics 2014-03, Vol.259, p.495-502
Main Authors: Kaya, Kamer, Selçuk, Ali Aydın
Format: Article
Language:English
Subjects:
Asmuth–Bloom secret sharing
DSS
Function sharing
Threshold cryptography
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 CRT.
ISSN:0377-0427
1879-1778
DOI:10.1016/j.cam.2013.05.023