The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Étant donné que les données du propriétaire peuvent être divulguées à partir du stockage centralisé du serveur, les schémas de stockage distribué avec le stockage du serveur ont été étudiés. Pour garantir les données du propriétaire dans ces systèmes, ils utilisent le code Reed Solomon. Cependant, ces systèmes imposent une charge de capacité de données puisque les données de parité augmentent en fonction de la quantité de données déconnectées qui peuvent être restaurées. De plus, le temps de calcul pour la restauration sera plus long puisque de nombreuses données de parité sont nécessaires pour restaurer les données déconnectées. Afin de réduire la charge de capacité de données et le temps de calcul, nous avons proposé le stockage distribué sur serveur utilisant le partage secret avec AES-256 pour une restauration légère de la sécurité. Bien que nous utilisions le partage secret, les données du propriétaire seront conservées en toute sécurité dans le stockage distribué puisque toutes les données divisées sont divisées en deux morceaux avec l'AES-256 et stockées dans le stockage homologue et dans le stockage du serveur. Même si le stockage du serveur conserve les données divisées, le serveur et les stockages homologues peuvent connaître la paire de données divisées via le partage secret, les données du propriétaire sont protégées dans le schéma proposé contre l'attaque interne du partage secret. De plus, les données du propriétaire peuvent être restaurées par quelques données de parité. Les évaluations montrent que le schéma proposé est amélioré en termes de légèreté, de stabilité et de sécurité.
Sanghun CHOI
Keio University
Shuichiro HARUTA
Keio University
Yichen AN
Keio University
Iwao SASASE
Keio University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Sanghun CHOI, Shuichiro HARUTA, Yichen AN, Iwao SASASE, "A Server-Based Distributed Storage Using Secret Sharing with AES-256 for Lightweight Safety Restoration" in IEICE TRANSACTIONS on Information,
vol. E103-D, no. 7, pp. 1647-1659, July 2020, doi: 10.1587/transinf.2019EDP7243.
Abstract: Since the owner's data might be leaked from the centralized server storage, the distributed storage schemes with the server storage have been investigated. To ensure the owner's data in those schemes, they use Reed Solomon code. However, those schemes occur the burden of data capacity since the parity data are increased by how much the disconnected data can be restored. Moreover, the calculation time for the restoration will be higher since many parity data are needed to restore the disconnected data. In order to reduce the burden of data capacity and the calculation time, we proposed the server-based distributed storage using Secret Sharing with AES-256 for lightweight safety restoration. Although we use Secret Sharing, the owner's data will be safely kept in the distributed storage since all of the divided data are divided into two pieces with the AES-256 and stored in the peer storage and the server storage. Even though the server storage keeps the divided data, the server and the peer storages might know the pair of divided data via Secret Sharing, the owner's data are secure in the proposed scheme from the inner attack of Secret Sharing. Furthermore, the owner's data can be restored by a few parity data. The evaluations show that our proposed scheme is improved for lightweight, stability, and safety.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2019EDP7243/_p
Copier
@ARTICLE{e103-d_7_1647,
author={Sanghun CHOI, Shuichiro HARUTA, Yichen AN, Iwao SASASE, },
journal={IEICE TRANSACTIONS on Information},
title={A Server-Based Distributed Storage Using Secret Sharing with AES-256 for Lightweight Safety Restoration},
year={2020},
volume={E103-D},
number={7},
pages={1647-1659},
abstract={Since the owner's data might be leaked from the centralized server storage, the distributed storage schemes with the server storage have been investigated. To ensure the owner's data in those schemes, they use Reed Solomon code. However, those schemes occur the burden of data capacity since the parity data are increased by how much the disconnected data can be restored. Moreover, the calculation time for the restoration will be higher since many parity data are needed to restore the disconnected data. In order to reduce the burden of data capacity and the calculation time, we proposed the server-based distributed storage using Secret Sharing with AES-256 for lightweight safety restoration. Although we use Secret Sharing, the owner's data will be safely kept in the distributed storage since all of the divided data are divided into two pieces with the AES-256 and stored in the peer storage and the server storage. Even though the server storage keeps the divided data, the server and the peer storages might know the pair of divided data via Secret Sharing, the owner's data are secure in the proposed scheme from the inner attack of Secret Sharing. Furthermore, the owner's data can be restored by a few parity data. The evaluations show that our proposed scheme is improved for lightweight, stability, and safety.},
keywords={},
doi={10.1587/transinf.2019EDP7243},
ISSN={1745-1361},
month={July},}
Copier
TY - JOUR
TI - A Server-Based Distributed Storage Using Secret Sharing with AES-256 for Lightweight Safety Restoration
T2 - IEICE TRANSACTIONS on Information
SP - 1647
EP - 1659
AU - Sanghun CHOI
AU - Shuichiro HARUTA
AU - Yichen AN
AU - Iwao SASASE
PY - 2020
DO - 10.1587/transinf.2019EDP7243
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E103-D
IS - 7
JA - IEICE TRANSACTIONS on Information
Y1 - July 2020
AB - Since the owner's data might be leaked from the centralized server storage, the distributed storage schemes with the server storage have been investigated. To ensure the owner's data in those schemes, they use Reed Solomon code. However, those schemes occur the burden of data capacity since the parity data are increased by how much the disconnected data can be restored. Moreover, the calculation time for the restoration will be higher since many parity data are needed to restore the disconnected data. In order to reduce the burden of data capacity and the calculation time, we proposed the server-based distributed storage using Secret Sharing with AES-256 for lightweight safety restoration. Although we use Secret Sharing, the owner's data will be safely kept in the distributed storage since all of the divided data are divided into two pieces with the AES-256 and stored in the peer storage and the server storage. Even though the server storage keeps the divided data, the server and the peer storages might know the pair of divided data via Secret Sharing, the owner's data are secure in the proposed scheme from the inner attack of Secret Sharing. Furthermore, the owner's data can be restored by a few parity data. The evaluations show that our proposed scheme is improved for lightweight, stability, and safety.
ER -