Flaws in Strong t-Consistency

Louis Cianciullo, H. Ghodosi, Kovel Thuremilla, A. C. Prihandoko
{"title":"Flaws in Strong t-Consistency","authors":"Louis Cianciullo, H. Ghodosi, Kovel Thuremilla, A. C. Prihandoko","doi":"10.1109/ICOMITEE.2019.8921313","DOIUrl":null,"url":null,"abstract":"Secret sharing is a cryptographic primitive used to securely distribute a secret value S among n participants such that only predetermined subsets of these participants (called access sets) can later reconstruct S. Such a scheme is said to be secure in the information theoretic setting if an adversary with unlimited computational power cannot reduce uncertainty regarding S.Harn and Lin proposed a strong (n, t, n) secret sharing scheme which they claim is information theoretic secure. In this paper we show that this is not the case and that the notion of strong t-consistency used by Harn and Lin as well as Liu et al. actually results in an imperfect scheme that is not secure in the information theoretic setting.","PeriodicalId":137739,"journal":{"name":"2019 International Conference on Computer Science, Information Technology, and Electrical Engineering (ICOMITEE)","volume":"95 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Computer Science, Information Technology, and Electrical Engineering (ICOMITEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOMITEE.2019.8921313","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Secret sharing is a cryptographic primitive used to securely distribute a secret value S among n participants such that only predetermined subsets of these participants (called access sets) can later reconstruct S. Such a scheme is said to be secure in the information theoretic setting if an adversary with unlimited computational power cannot reduce uncertainty regarding S.Harn and Lin proposed a strong (n, t, n) secret sharing scheme which they claim is information theoretic secure. In this paper we show that this is not the case and that the notion of strong t-consistency used by Harn and Lin as well as Liu et al. actually results in an imperfect scheme that is not secure in the information theoretic setting.
强t一致性中的缺陷
秘密共享是一种用于在n个参与者之间安全地分发秘密值S的密码原语,使得只有这些参与者的预定子集(称为访问集)以后才能重构S。如果具有无限计算能力的对手不能减少关于S的不确定性,则这种方案在信息理论设置中是安全的。在本文中,我们表明情况并非如此,并且由Harn和Lin以及Liu等人使用的强t-一致性概念实际上导致了不完美的方案,在信息理论设置中不安全。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信