Vanessa Miranda-López, Andrei Tchernykh, M. Babenko, Viktor Andreevich Kuchukov, M. Deryabin, E. Golimblevskaia, Egor Shiryaev, A. Avetisyan, R. Rivera-Rodríguez, G. Radchenko, E. Talbi
{"title":"提高可靠性的多云数据存储加权两级秘密共享方案","authors":"Vanessa Miranda-López, Andrei Tchernykh, M. Babenko, Viktor Andreevich Kuchukov, M. Deryabin, E. Golimblevskaia, Egor Shiryaev, A. Avetisyan, R. Rivera-Rodríguez, G. Radchenko, E. Talbi","doi":"10.1109/HPCS48598.2019.9188057","DOIUrl":null,"url":null,"abstract":"Cloud storages delivered as services are made available to the general public. As cloud storage provider prices become low, they have moved into the mainstream of storage technology. However, there are various factors that cause many potential users do not use it intensively. There exist high risks for confidentiality, integrity, and availability violation associated with the loss of information, denial of access, technical failures, etc. In this article, we propose a two-level secret sharing scheme (TL-SSS) based on a residue number system (RNS) for a configurable, reliable, and secure distributed data storage. RNS moduli of a special type increase the reliability of the data storage system and reduce the computational complexity of the data encoding and decoding from linear-logarithmic to linear. TL-SSS is the weighted data access structure. It creates and distributes data shares according to the characteristics of the cloud storages under various scenarios. We provide a solution that improves system reliability without reduction of the security level. In contrast to classical solutions, it can restore the data with less available shares than the state-of-the-art approaches.","PeriodicalId":371856,"journal":{"name":"2019 International Conference on High Performance Computing & Simulation (HPCS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Weighted Two-Levels Secret Sharing Scheme for Multi-Clouds Data Storage with Increased Reliability\",\"authors\":\"Vanessa Miranda-López, Andrei Tchernykh, M. Babenko, Viktor Andreevich Kuchukov, M. Deryabin, E. Golimblevskaia, Egor Shiryaev, A. Avetisyan, R. Rivera-Rodríguez, G. Radchenko, E. Talbi\",\"doi\":\"10.1109/HPCS48598.2019.9188057\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud storages delivered as services are made available to the general public. As cloud storage provider prices become low, they have moved into the mainstream of storage technology. However, there are various factors that cause many potential users do not use it intensively. There exist high risks for confidentiality, integrity, and availability violation associated with the loss of information, denial of access, technical failures, etc. In this article, we propose a two-level secret sharing scheme (TL-SSS) based on a residue number system (RNS) for a configurable, reliable, and secure distributed data storage. RNS moduli of a special type increase the reliability of the data storage system and reduce the computational complexity of the data encoding and decoding from linear-logarithmic to linear. TL-SSS is the weighted data access structure. It creates and distributes data shares according to the characteristics of the cloud storages under various scenarios. We provide a solution that improves system reliability without reduction of the security level. In contrast to classical solutions, it can restore the data with less available shares than the state-of-the-art approaches.\",\"PeriodicalId\":371856,\"journal\":{\"name\":\"2019 International Conference on High Performance Computing & Simulation (HPCS)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Conference on High Performance Computing & Simulation (HPCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPCS48598.2019.9188057\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on High Performance Computing & Simulation (HPCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPCS48598.2019.9188057","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Weighted Two-Levels Secret Sharing Scheme for Multi-Clouds Data Storage with Increased Reliability
Cloud storages delivered as services are made available to the general public. As cloud storage provider prices become low, they have moved into the mainstream of storage technology. However, there are various factors that cause many potential users do not use it intensively. There exist high risks for confidentiality, integrity, and availability violation associated with the loss of information, denial of access, technical failures, etc. In this article, we propose a two-level secret sharing scheme (TL-SSS) based on a residue number system (RNS) for a configurable, reliable, and secure distributed data storage. RNS moduli of a special type increase the reliability of the data storage system and reduce the computational complexity of the data encoding and decoding from linear-logarithmic to linear. TL-SSS is the weighted data access structure. It creates and distributes data shares according to the characteristics of the cloud storages under various scenarios. We provide a solution that improves system reliability without reduction of the security level. In contrast to classical solutions, it can restore the data with less available shares than the state-of-the-art approaches.