Math @ Duke

Publications [#326891] of Robert Calderbank
Papers Published
 Goparaju, S; Rouayheb, SE; Calderbank, R, Can linear minimum storage regenerating codes be universally secure?,
Conference Record Asilomar Conference on Signals, Systems and Computers, vol. 2016February
(February, 2016),
pp. 549553, ISBN 9781467385763 [doi]
(last updated on 2018/08/18)
Abstract: © 2015 IEEE. We study the problem of making a distributed storage system informationtheoretically secure against a passive eavesdropper, and aim to characterize coding schemes that are universally secure for up to a given number of eavesdropped nodes. Specifically, we consider minimum storage regenerating (MSR) codes and ask the following question: For an MSR code where a failed node is repaired using all the remaining nodes, is it possible to simultaneously be optimally secure using a single linear coding scheme? We define a paretooptimality associated with this simultaneity and show that there exists at least one linear coding scheme that is paretooptimal.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

