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}
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.