Presentation 2006-11-21
Computational Evaluation of Heuristic Algorithms for a Share Transfer Problem
Toshiyuki MIYAMOTO, Sadatoshi KUMAGAI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We have been proposing and developing a secure and reliable distributed storage system, which uses the secret sharing scheme. For efficient store operation on the system, we have already introduced an optimal share transfer problem, and the problem is NP-hard in general. This paper shows that the optimal share transfer problem can be resolved in the Steiner tree problem, and compares heuristic algorithms for the Steinter tree problem.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) distributed storage system / secret sharing scheme / Steiner tree / NP-complete / distributed algorithm
Paper # CAS2006-55,CST2006-31
Date of Issue

Conference Information
Committee CAS
Conference Date 2006/11/14(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Circuits and Systems (CAS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Computational Evaluation of Heuristic Algorithms for a Share Transfer Problem
Sub Title (in English)
Keyword(1) distributed storage system
Keyword(2) secret sharing scheme
Keyword(3) Steiner tree
Keyword(4) NP-complete
Keyword(5) distributed algorithm
1st Author's Name Toshiyuki MIYAMOTO
1st Author's Affiliation Devision of Electrical, Electronic and Information Engineering, Osaka University()
2nd Author's Name Sadatoshi KUMAGAI
2nd Author's Affiliation Devision of Electrical, Electronic and Information Engineering, Osaka University
Date 2006-11-21
Paper # CAS2006-55,CST2006-31
Volume (vol) vol.106
Number (no) 366
Page pp.pp.-
#Pages 6
Date of Issue