Back to Search
Start Over
Lists that are smaller than their parts: A coding approach to tunable secrecy
- Source :
- arXiv, Allerton Conference
- Publication Year :
- 2012
- Publisher :
- Institute of Electrical and Electronics Engineers (IEEE), 2012.
-
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, \epsilon-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-asymptotic settings. We derive fundamental bounds for \epsilon-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.<br />Comment: Allerton 2012, 8 pages
- Subjects :
- Block code
FOS: Computer and information sciences
Source code
Theoretical computer science
Computer Science - Cryptography and Security
business.industry
media_common.quotation_subject
Information Theory (cs.IT)
Computer Science - Information Theory
Variable-length code
List decoding
Cryptography
Coding theory
Entropy (information theory)
Entropy encoding
business
Cryptography and Security (cs.CR)
media_common
Mathematics
Hamilton Institute
Subjects
Details
- Language :
- English
- Database :
- OpenAIRE
- Journal :
- arXiv, Allerton Conference
- Accession number :
- edsair.doi.dedup.....af55dd528b0d0f05856d17e271af9da6