基于超增长序列的等级有序访问结构多秘密共享新方案

A. Basit, Patibandla Chanakya, V. Venkaiah, S. A. Moiz
{"title":"基于超增长序列的等级有序访问结构多秘密共享新方案","authors":"A. Basit, Patibandla Chanakya, V. Venkaiah, S. A. Moiz","doi":"10.1504/IJCNDS.2020.10020864","DOIUrl":null,"url":null,"abstract":"A new multi-secret sharing scheme (MSSS) that uses a superincreasing sequence and realizes level-ordered access structure (LOAS) is proposed. The novelty of the scheme is that not only a single share for all the secrets is sufficient but also the secrets can be changed without renewing the shares of the participants. The proposed scheme has low communication cost and less overhead for the participant.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"New multi-secret sharing scheme based on superincreasing sequence for level-ordered access structure\",\"authors\":\"A. Basit, Patibandla Chanakya, V. Venkaiah, S. A. Moiz\",\"doi\":\"10.1504/IJCNDS.2020.10020864\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new multi-secret sharing scheme (MSSS) that uses a superincreasing sequence and realizes level-ordered access structure (LOAS) is proposed. The novelty of the scheme is that not only a single share for all the secrets is sufficient but also the secrets can be changed without renewing the shares of the participants. The proposed scheme has low communication cost and less overhead for the participant.\",\"PeriodicalId\":209177,\"journal\":{\"name\":\"Int. J. Commun. Networks Distributed Syst.\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-04-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Commun. Networks Distributed Syst.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJCNDS.2020.10020864\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Commun. Networks Distributed Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJCNDS.2020.10020864","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

提出了一种新的多秘密共享方案(MSSS),该方案采用超增长序列,实现了级别有序访问结构(LOAS)。该方案的新颖之处在于,不仅所有秘密的单一份额就足够了,而且秘密可以在不更新参与者的份额的情况下更改。该方案具有通信成本低、参与方开销小的特点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
New multi-secret sharing scheme based on superincreasing sequence for level-ordered access structure
A new multi-secret sharing scheme (MSSS) that uses a superincreasing sequence and realizes level-ordered access structure (LOAS) is proposed. The novelty of the scheme is that not only a single share for all the secrets is sufficient but also the secrets can be changed without renewing the shares of the participants. The proposed scheme has low communication cost and less overhead for the participant.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信