可修复阈值方案的组合构造

IF 0.5 4区 数学 Q3 MATHEMATICS
Jinghui Zhao, Xiuling Shan, Zihong Tian, Guohui Hao
{"title":"可修复阈值方案的组合构造","authors":"Jinghui Zhao,&nbsp;Xiuling Shan,&nbsp;Zihong Tian,&nbsp;Guohui Hao","doi":"10.1007/s00013-024-02034-5","DOIUrl":null,"url":null,"abstract":"<div><p>A repairable threshold scheme is a threshold scheme in which a player can securely reconstruct a lost share with the help from a subset of players. In 2018, Stinson and Wei proposed distribution designs to construct repairable threshold schemes. In this paper, we use packing quadruples as distribution designs to distribute subshares of a ramp scheme. The resulting repairable threshold scheme has lower computational complexity and repairing degree.</p></div>","PeriodicalId":8346,"journal":{"name":"Archiv der Mathematik","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Combinatorial constructions of repairable threshold schemes\",\"authors\":\"Jinghui Zhao,&nbsp;Xiuling Shan,&nbsp;Zihong Tian,&nbsp;Guohui Hao\",\"doi\":\"10.1007/s00013-024-02034-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>A repairable threshold scheme is a threshold scheme in which a player can securely reconstruct a lost share with the help from a subset of players. In 2018, Stinson and Wei proposed distribution designs to construct repairable threshold schemes. In this paper, we use packing quadruples as distribution designs to distribute subshares of a ramp scheme. The resulting repairable threshold scheme has lower computational complexity and repairing degree.</p></div>\",\"PeriodicalId\":8346,\"journal\":{\"name\":\"Archiv der Mathematik\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2024-08-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Archiv der Mathematik\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00013-024-02034-5\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Archiv der Mathematik","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00013-024-02034-5","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

可修复阈值方案是一种阈值方案,其中玩家可以在子集玩家的帮助下安全地重建丢失的份额。2018 年,Stinson 和 Wei 提出了构建可修复阈值方案的分布设计。在本文中,我们使用打包四元组作为分配设计来分配斜坡方案的子份额。由此得到的可修复阈值方案具有更低的计算复杂度和修复度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Combinatorial constructions of repairable threshold schemes

A repairable threshold scheme is a threshold scheme in which a player can securely reconstruct a lost share with the help from a subset of players. In 2018, Stinson and Wei proposed distribution designs to construct repairable threshold schemes. In this paper, we use packing quadruples as distribution designs to distribute subshares of a ramp scheme. The resulting repairable threshold scheme has lower computational complexity and repairing degree.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Archiv der Mathematik
Archiv der Mathematik 数学-数学
CiteScore
1.10
自引率
0.00%
发文量
117
审稿时长
4-8 weeks
期刊介绍: Archiv der Mathematik (AdM) publishes short high quality research papers in every area of mathematics which are not overly technical in nature and addressed to a broad readership.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信