Route Computation Method for Secure Delivery of Secret Shared Content

Nagao OGINO  Takuya OMI  Hajime NAKAMURA  

Publication
IEICE TRANSACTIONS on Communications   Vol.E95-B   No.11   pp.3456-3463
Publication Date: 2012/11/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E95.B.3456
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network
Keyword: 
route computation method,  secure content delivery,  secret sharing scheme,  shortest route algorithm,  link distance adjustment,  

Full Text: PDF>>
Buy this Article




Summary: 
Secret sharing schemes have been proposed to protect content by dividing it into many pieces securely and distributing them over different locations. Secret sharing schemes can also be used for the secure delivery of content. The original content cannot be reconstructed by the attacker if the attacker cannot eavesdrop on all the pieces delivered from multiple content servers. This paper aims to obtain secure delivery routes for the pieces, which minimizes the probability that all the pieces can be stolen on the links composing the delivery routes. Although such a route optimization problem can be formulated using an ILP (Integer Linear Programming) model, optimum route computation based on the ILP model requires large amounts of computational resources. Thus, this paper proposes a lightweight route computation method for obtaining suboptimum delivery routes that achieve a sufficiently small probability of all the pieces being stolen. The proposed method computes the delivery routes successively by using the conventional shortest route algorithm repeatedly. The distance of the links accommodating the routes that have already been calculated is adjusted iteratively and utilized for calculation of the new shortest route. The results of a performance evaluation clarify that sufficiently optimum routes can be computed instantly even in practical large-scale networks by the proposed method, which adjusts the link distance strictly based on the risk level at the considered link.