Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11851/1133
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ersoy, Oğuzhan | - |
dc.contributor.author | Pedersen, Thomas Brochmann | - |
dc.contributor.author | Kaya, Kamer | - |
dc.contributor.author | Selçuk, Ali Aydın | - |
dc.contributor.author | Anarim, Emin | - |
dc.date.accessioned | 2019-06-26T07:40:32Z | |
dc.date.available | 2019-06-26T07:40:32Z | |
dc.date.issued | 2016-11-25 | |
dc.identifier.citation | 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. | en_US |
dc.identifier.issn | 1939-0114 | |
dc.identifier.uri | https://onlinelibrary.wiley.com/doi/full/10.1002/sec.1617 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.11851/1133 | - |
dc.description.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. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Wiley-blackwell | en_US |
dc.relation.ispartof | Security And Communication Networks | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Verifiable Secret Sharing | en_US |
dc.subject | Chinese Remainder Theorem | en_US |
dc.subject | Asmuth-Bloom | en_US |
dc.subject | Statistically Hiding Commitments | en_US |
dc.subject | Joint Random Secret Sharing | en_US |
dc.title | A Crt-Based Verifiable Secret Sharing Scheme Secure Against Unbounded Adversaries | en_US |
dc.type | Article | en_US |
dc.department | Faculties, Faculty of Engineering, Department of Computer Engineering | en_US |
dc.department | Fakülteler, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü | tr_TR |
dc.identifier.volume | 9 | |
dc.identifier.issue | 17 | |
dc.identifier.startpage | 4416 | |
dc.identifier.endpage | 4427 | |
dc.identifier.wos | WOS:000389253400036 | en_US |
dc.identifier.scopus | 2-s2.0-84994817786 | en_US |
dc.institutionauthor | Selçuk, Ali Aydın | - |
dc.identifier.doi | 10.1002/sec.1617 | - |
dc.authorscopusid | 7004457288 | - |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopusquality | Q3 | - |
item.openairetype | Article | - |
item.languageiso639-1 | en | - |
item.grantfulltext | open | - |
item.fulltext | With Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | 02.3. Department of Computer Engineering | - |
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 | |
---|---|---|---|---|
CRT_SAA.pdf | 1.33 MB | Adobe PDF | View/Open |
CORE Recommender
SCOPUSTM
Citations
5
checked on Dec 21, 2024
WEB OF SCIENCETM
Citations
9
checked on Dec 21, 2024
Page view(s)
108
checked on Dec 23, 2024
Download(s)
210
checked on Dec 23, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.