Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/1133
Title: A CRT-based verifiable secret sharing scheme secure against unbounded adversaries
Authors: Ersoy, Oğuzhan
Pedersen, Thomas Brochmann
Kaya, Kamer
Selçuk, Ali Aydın
Anarim, Emin
125410
Keywords: Verifiable Secret Sharing
Chinese Remainder Theorem
Asmuth-Bloom
Statistically Hiding Commitments
Joint Random Secret Sharing
Issue Date: 25-Nov-2016
Publisher: Wiley-blackwell
Source: Ersoy, O., Pedersen, T. B., Kaya, K., Selçuk, A. A., & Anarim, E. (2016). A CRT?based verifiable secret sharing scheme secure against unbounded adversaries. Security and Communication Networks, 9(17), 4416-4427.
Abstract: For commitments on secrets, statistical hiding is a must when we are dealing with a long-term secret or when the secret domain is small enough for a brute-force attack by a powerful adversary. Unfortunately, all the Chinese Remainder Theorem-based verifiable secret sharing schemes in the literature are either insecure or suffer from the vulnerability of computationally hiding commitments. To the best of our knowledge, there exist five such studies where two of them were already proven to be insecure. In this work, we first show that two of the remaining schemes are also insecure, that is, the schemes reveal information on the secret even when the adversary is passive. In addition, the remaining one is only secure against a computationally bounded adversary which can be a problem for secret sharing schemes requiring long-term secret obscurity or using small secret domain. We propose a modification for the latter scheme and prove that the modified scheme is a secure verifiable secret sharing scheme against an unbounded adversary. Lastly, as an application, we show how to use the new scheme for joint random secret sharing and analyze the practicality and efficiency of the proposed schemes. Copyright (C) 2016 John Wiley & Sons, Ltd.
URI: https://onlinelibrary.wiley.com/doi/full/10.1002/sec.1617
https://hdl.handle.net/20.500.11851/1133
ISSN: 1939-0114
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 SizeFormat 
CRT_SAA.pdf1.33 MBAdobe PDFThumbnail
View/Open
Show full item record

CORE Recommender

SCOPUSTM   
Citations

5
checked on Sep 23, 2022

WEB OF SCIENCETM
Citations

7
checked on Sep 24, 2022

Page view(s)

28
checked on Dec 26, 2022

Download(s)

72
checked on Dec 26, 2022

Google ScholarTM

Check

Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.