On Secure Exact-Repair Regenerating Codes With a Single Pareto Optimal Point

DOI10.1109/TIT.2019.2942315MaRDI QIDQ5211591zbMATH OpenOpenAlexFDO

Authors Fangwei Ye, Shiqiu Liu, Kenneth W. Shum, Raymond W. Yeung

Publication date 28 January 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1805.02989

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Abstract: 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 $ell$ nodes. An $(n,k,d,ell)$ 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,ell)$, 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 $hatell$ on the number of wiretap nodes, and show that this bound is tight for the case $k=d=n-1$.

This page was built for publication: On Secure Exact-Repair Regenerating Codes With a Single Pareto Optimal Point

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211591)