{"title":"秘密共享(m, n)-阈值方案的语言扩展","authors":"M. Ogiela, U. Ogiela","doi":"10.1109/SECTECH.2008.15","DOIUrl":null,"url":null,"abstract":"The subject of this work is the presentation of a new approach to the expansion of classical cryptographic algorithms used for secret sharing and sharing data, with an additional, linguistic stage for the generation of the secret element. Such a part shall be generated in the form of a linguistic description of the shared data, built by defined sequence grammar. The definition of grammar in this scheme will provide additional information required to reconstruct the secret previously split with any algorithm implementing (m, n)-threshold scheme.","PeriodicalId":377461,"journal":{"name":"2008 International Conference on Security Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"41","resultStr":"{\"title\":\"Linguistic Extension for Secret Sharing (m, n)-Threshold Schemes\",\"authors\":\"M. Ogiela, U. Ogiela\",\"doi\":\"10.1109/SECTECH.2008.15\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The subject of this work is the presentation of a new approach to the expansion of classical cryptographic algorithms used for secret sharing and sharing data, with an additional, linguistic stage for the generation of the secret element. Such a part shall be generated in the form of a linguistic description of the shared data, built by defined sequence grammar. The definition of grammar in this scheme will provide additional information required to reconstruct the secret previously split with any algorithm implementing (m, n)-threshold scheme.\",\"PeriodicalId\":377461,\"journal\":{\"name\":\"2008 International Conference on Security Technology\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"41\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on Security Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SECTECH.2008.15\",\"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 International Conference on Security Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECTECH.2008.15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Linguistic Extension for Secret Sharing (m, n)-Threshold Schemes
The subject of this work is the presentation of a new approach to the expansion of classical cryptographic algorithms used for secret sharing and sharing data, with an additional, linguistic stage for the generation of the secret element. Such a part shall be generated in the form of a linguistic description of the shared data, built by defined sequence grammar. The definition of grammar in this scheme will provide additional information required to reconstruct the secret previously split with any algorithm implementing (m, n)-threshold scheme.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
