Visible to the public Biblio

Filters: Author is Rashmi, K.V.  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
S
Sasidharan, B., Kumar, P.V., Shah, N.B., Rashmi, K.V., Ramachandran, K..  2014.  Optimality of the product-matrix construction for secure MSR regenerating codes. Communications, Control and Signal Processing (ISCCSP), 2014 6th International Symposium on. :10-14.

In this paper, we consider the security of exact-repair regenerating codes operating at the minimum-storage-regenerating (MSR) point. The security requirement (introduced in Shah et. al.) is that no information about the stored data file must be leaked in the presence of an eavesdropper who has access to the contents of ℓ1 nodes as well as all the repair traffic entering a second disjoint set of ℓ2 nodes. We derive an upper bound on the size of a data file that can be securely stored that holds whenever ℓ2 ≤ d - k + 1. This upper bound proves the optimality of the product-matrix-based construction of secure MSR regenerating codes by Shah et. al.

Sasidharan, B., Kumar, P.V., Shah, N.B., Rashmi, K.V., Ramachandran, K..  2014.  Optimality of the product-matrix construction for secure MSR regenerating codes. Communications, Control and Signal Processing (ISCCSP), 2014 6th International Symposium on. :10-14.

In this paper, we consider the security of exact-repair regenerating codes operating at the minimum-storage-regenerating (MSR) point. The security requirement (introduced in Shah et. al.) is that no information about the stored data file must be leaked in the presence of an eavesdropper who has access to the contents of ℓ1 nodes as well as all the repair traffic entering a second disjoint set of ℓ2 nodes. We derive an upper bound on the size of a data file that can be securely stored that holds whenever ℓ2 ≤ d - k + 1. This upper bound proves the optimality of the product-matrix-based construction of secure MSR regenerating codes by Shah et. al.