An Optimal Share Transfer Problem on Secret Sharing Storage Systems(<Special Section>Concurrent/Hybrid Systems : Theory and Applications)
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 社団法人電子情報通信学会の論文
- 2007-11-01
著者
-
Kumagai Sadatoshi
Graduate School Of Engineering Osaka University
-
Miyamoto Toshiyuki
Graduate School Of Engineering Osaka University
-
Miyamoto Toshiyuki
The Department Of Electrical Engineering Osaka University
関連論文
- An Efficient State Space Search for the Synthesis of Asynchronous Circuits by Subspace Construction
- Equivalent Net Reduction for Firing Sequence
- A Graph Based Approach for an Extended Resource Planning and Line Balancing Problem(Concurrent System Technology)
- A Graph Based Approach for an Extended Resource Planning and Line Balancing Problem
- An Electric Circuit Model of Flow-Shops and Its Sensitivity Analysis
- Routing Autonomous Vehicles in the Improving Initial Task Assignment and Avoiding Deadlock Method
- An Initial Assignment Method for Tasks Assignment and Routing Problem of Autonomous Distributed AGVs(Concurrent/Hybrid Systems : Theory and Applications)
- A Survey of Object-Oriented Petri Nets and Analysis Methods(Concurrent/Hybrid Systems : Theory and Applications)
- Vertical Partitioning Method for Secret Sharing Distributed Database System(Concurrent Systems,Concurrent/Hybrid Systems: Theory and Applications)
- A Cooperative Algorithm for Autonomous Distributed Vehicle Systems with Finite Buffer Capacity(Concurrent/Hybrid Systems : Theory and Applications)
- On Reachability Analysis of Multi Agent Nets(Systems Theory and Control,Nonlinear Theory and its Applications)
- An Optimal Share Transfer Problem on Secret Sharing Storage Systems(Concurrent/Hybrid Systems : Theory and Applications)
- An Algorithm for Petri Nets Reachability by Unfoldings (Special Section on Selected Papers from the 11th Workshop on Circuits and Systems in Karuizawa)
- A Graph Theoretic Approach to Reachability Problem with Petri Net Unfoldings (Special Section on Description Models for Concurrent Systems and Their Applications)
- An Efficient Algorithm for Deriving Logic Functions of Asynchronous Circuits (Special Section of Papers Selected from JTC-CSCC'95)
- Context-Dependent Agents for Real-Time Scheduling in Manufacturing Systems(Special Section on Concurrent System Technology and Its Application to Multiple Agent Systems)
- Reinforcement Learning with conditioned role updating to prevent conflicts during the allocation of tasks (コンカレント工学)
- MceSim : A Multi-Car Elevator Simulator
- On Deriving Logic Functions of Asynchronous Circuits by STG Unfoldings (Special Issue on Asynchronous Circuit and System Design)
- Multi Criteria Real-Time Scheduling for Manufacturing Systems by Context-Dependent Agents
- Multi Criteria Real-Time Scheduling for Manufacturing Systems by Context-Dependent Agents(Concurrent System Technology)
- A Multi-Agent Based Manufacturing Resource Planning and Task Allocation System
- Automatic Repair Mechanism of Secret Sharing Storage System(Database)
- Option-Based Monte Carlo Algorithm with Conditioned Updating to Learn Conflict-Free Task Allocation in Transport Applications
- Performance Evaluation of an Option-Based Learning Algorithm in Multi-Car Elevator Systems
- FOREWORD