Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#326891] of Robert Calderbank

Papers Published

  1. 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. 2016-February (February, 2016), pp. 549-553, ISBN 9781467385763 [doi]
    (last updated on 2018/11/16)

    © 2015 IEEE. We study the problem of making a distributed storage system information-theoretically 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 pareto-optimality associated with this simultaneity and show that there exists at least one linear coding scheme that is pareto-optimal.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320