2018/05/08 by Fangwei Ye, Shiqiu Liu, Ye, Fangwei +5
Computer Science · Mathematics · #Advanced Data Storage Technologies #Cellular Automata and Applications #Code (set theory) #Combinatorics #Computer network #Computer science #Discrete mathematics #Distributed systems and fault tolerance #Eavesdropping #FOS: Computer and information sciences #Focus (optics) #Information Theory (cs.IT) #Mathematical analysis #Mathematics #Physics #Point (geometry) #Set (abstract data type) #Upper and lower bounds #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1805.02989
This paper will be presented in part in ISIT 2018
arxiv created 2018/05/08 · openalex publication_date 2018/05/08 · arxiv updated 2018/05/09 · openalex created_date 2018/05/17 · openalex updated_date 2026/08/05
The problem of exact-repair regenerating codes against eavesdropping attack is studied. The eavesdropping model we consider is that the eavesdropper has the capability to observe the data involved in the repair of a subset of ℓ nodes. An (n,k,d,ℓ) secure exact-repair regenerating code is an (n,k,d) exact-repair regenerating code that is secure under this eavesdropping model. It has been shown that for some parameters (n,k,d,ℓ), the associated optimal storage-bandwidth tradeoff curve, which has one corner point, can be determined. The focus of this paper is on characterizing such parameters. We establish a lower bound ℓ on the number of wiretap nodes, and show that this bound is tight for the case k = d = n-1.