Lists that are smaller than their parts: A coding approach to tunable secrecy
Name
Medard_Lists that.pdf
Size
145.78 KB
Format
Adobe PDF
Checksum (MD5)
bc477d4a8e74ec7e764641b39304da65
Author(s)
Medard, Muriel
Zeger, Linda M.
Barros, Joao
Christiansen, Mark M.
Duffy, Ken R.
Calmon, Flavio du Pin
Date Issued
October 2012
Journal
Proceedings of the 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Du Pin Calmon, Flavio, Muriel Medard, Linda M. Zeger, Joao Barros, Mark M. Christiansen, and Ken R. Duffy. “Lists That Are Smaller Than Their Parts: A Coding Approach to Tunable Secrecy.” 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton) (October 2012).
Version
Author's final manuscript
Abstract
We present a new information-theoretic definition and associated results, based on list decoding in a source coding setting. We begin by presenting list-source codes, which naturally map a key length (entropy) to list size. We then show that such codes can be analyzed in the context of a novel information-theoretic metric, ϵ-symbol secrecy, that encompasses both the one-time pad and traditional rate-based asymptotic metrics, but, like most cryptographic constructs, can be applied in non-aymptotic settings. We derive fundamental bounds for ϵ-symbol secrecy and demonstrate how these bounds can be achieved with MDS codes when the source is uniformly distributed. We discuss applications and implementation issues of our codes.
MIT Department
Lincoln Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/Allerton.2012.6483380
