- [Home]
- [Research achievement]
- [Research achievement detail]
| Title | A Consideration on Modeling and Optimality of Regenerating Codes Considering Security of Shares (in Japanese) |
|---|---|
| Authors | Takahiro Yoshida 、Hajime Jinushi 、Toshiyasu Matsushima |
| Released Year | 2013 |
| Format | Conference |
| Category | Information security |
| Jounal Name | |
| Jounal Page | vol.113, no.153, IT2013-16, pp.27-32 |
| Published Year | 2013 |
| Published Month | 7 |
| Abstract （English） |
We consider regenerating codes. Regenerating codes are a class of codes for distributed storage systems that enable a data collector to recover the original data by connecting to any $k$ of $n$ storage nodes, and also can repair a failed node by downloading data from any d (>=k) nodes. In regenerating codes, there exists a tradeoff between the storage size of each node and repair-bandwidth. In this study, we define two classes of regenerating codes considering security of each node's share, and show that the regenerating codes, which was proposed by Rashmi, Shah and Kumar, achieve the minimum storage size and repair-bandwidth for our class of regenerating codes. |
| Note （English） |
1 |
| Manuscript | |
| Presentation |
