{"title":"一种资源受限环境下的快速秘密共享方案","authors":"Zheng Chen, Xiaojing Wang, Sheng Cao, Dan Tang","doi":"10.1109/SEC.2008.36","DOIUrl":null,"url":null,"abstract":"A method of rapid secret sharing scheme based on STAR codes is proposed. Due to the characteristic of array codes such as STAR codes, the computation in secret sharing scheme need only XOR operation on GF(2), which is distinguished with the modulation and other complex operation on GF(q) in the traditional schemes. Thus, it's more rapid and suitable for large capacity secret sharing, and also appropriate for resource constrained environments, such as embedded systems. The process of distribution and reconstruction of the secret key in our scheme is depicted in details, and an example of (5, 8) threshold secret sharing scheme based on (8, 5, 4) STAR code is demonstrated. Our scheme is proved to be perfect and ideal.","PeriodicalId":231129,"journal":{"name":"2008 Fifth IEEE International Symposium on Embedded Computing","volume":"318 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Rapid Secret Sharing Scheme for Resource Constrained Environments\",\"authors\":\"Zheng Chen, Xiaojing Wang, Sheng Cao, Dan Tang\",\"doi\":\"10.1109/SEC.2008.36\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method of rapid secret sharing scheme based on STAR codes is proposed. Due to the characteristic of array codes such as STAR codes, the computation in secret sharing scheme need only XOR operation on GF(2), which is distinguished with the modulation and other complex operation on GF(q) in the traditional schemes. Thus, it's more rapid and suitable for large capacity secret sharing, and also appropriate for resource constrained environments, such as embedded systems. The process of distribution and reconstruction of the secret key in our scheme is depicted in details, and an example of (5, 8) threshold secret sharing scheme based on (8, 5, 4) STAR code is demonstrated. Our scheme is proved to be perfect and ideal.\",\"PeriodicalId\":231129,\"journal\":{\"name\":\"2008 Fifth IEEE International Symposium on Embedded Computing\",\"volume\":\"318 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Fifth IEEE International Symposium on Embedded Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SEC.2008.36\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Fifth IEEE International Symposium on Embedded Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SEC.2008.36","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Rapid Secret Sharing Scheme for Resource Constrained Environments
A method of rapid secret sharing scheme based on STAR codes is proposed. Due to the characteristic of array codes such as STAR codes, the computation in secret sharing scheme need only XOR operation on GF(2), which is distinguished with the modulation and other complex operation on GF(q) in the traditional schemes. Thus, it's more rapid and suitable for large capacity secret sharing, and also appropriate for resource constrained environments, such as embedded systems. The process of distribution and reconstruction of the secret key in our scheme is depicted in details, and an example of (5, 8) threshold secret sharing scheme based on (8, 5, 4) STAR code is demonstrated. Our scheme is proved to be perfect and ideal.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
