Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11851/1177
Title: | Sharing DSS by the Chinese Remainder Theorem | Authors: | Kaya, Kamer Selçuk, Ali Aydın |
Keywords: | Asmuth-Bloom Secret Sharing Threshold Cryptography Function Sharing Dss |
Publisher: | Elsevier | Source: | Kaya, K., & Selçuk, A. A. (2014). Sharing DSS by the Chinese remainder theorem. Journal of Computational and Applied Mathematics, 259, 495-502. | 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 CRT. (C) 2013 Elsevier B.V. All rights reserved. | URI: | https://www.sciencedirect.com/science/article/pii/S0377042713003075?via%3Dihub https://hdl.handle.net/20.500.11851/1177 |
ISSN: | 0377-0427 |
Appears in Collections: | Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
DSS_SAA.pdf | 123.58 kB | Adobe PDF | View/Open |
CORE Recommender
SCOPUSTM
Citations
6
checked on Nov 9, 2024
WEB OF SCIENCETM
Citations
4
checked on Nov 9, 2024
Page view(s)
92
checked on Nov 11, 2024
Download(s)
38
checked on Nov 11, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.