Lists that are smaller than their parts: A coding approach to tunable secrecy
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 infor...
Main Authors: | Medard, Muriel, Zeger, Linda M., Barros, Joao, Christiansen, Mark M., Duffy, Ken R., Calmon, Flavio du Pin |
---|---|
Other Authors: | Lincoln Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2014
|
Online Access: | http://hdl.handle.net/1721.1/90405 https://orcid.org/0000-0003-2912-7972 https://orcid.org/0000-0003-4059-407X |
Similar Items
-
Multi-User Guesswork and Brute Force Security
by: Christiansen, Mark M., et al.
Published: (2018) -
Brute force searching, the typical set and Guesswork
by: Christiansen, Mark M., et al.
Published: (2014) -
Guessing a password over a wireless channel (on the effect of noise non-uniformity)
by: Christiansen, Mark M., et al.
Published: (2014) -
Principal Inertia Components and Applications
by: Calmon, Flavio du Pin, et al.
Published: (2021) -
Bounds on inference
by: Medard, Muriel, et al.
Published: (2014)