An optimal share transfer problem on secret sharing storage systems

Authors:
Toshiyuki Miyamoto;Sadatoshi Kumagai
Affiliations:
Osaka University, Osaka, Japan;Osaka University, Osaka, Japan
Venue:
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Year:
2007

Citing 6
Cited 0

A faster approximation algorithm for the Steiner problem in graphs

Acta Informatica
The Steiner problem in distributed computing systems

Information Sciences: an International Journal
An “all pairs shortest paths” distributed algorithm using 2n2 messages

Journal of Algorithms
How to share a secret

Communications of the ACM
Autonomous distributed secret sharing storage system

Systems and Computers in Japan
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)

Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have been developing a secure and reliable distributed storage system, which uses a secret sharing scheme. In order to efficiently store data in the system, this paper introduces an optimal share transfer problem, and proves it to be, generally, NP-hard. It is also shown that the problem can be resolved into a Steiner tree problem. Finally, through computational experiments we perform the comparison of heuristic algorithms for the Steiner tree problem.