MURAL - Maynooth University Research Archive Library

    Lists that are smaller than their parts: A coding approach to tunable secrecy

    Calmon, Flavio du Pin and Medard, Muriel and Zeger, Linda M. and Barros, Joao and Christiansen, Mark M. and Duffy, Ken R. (2012) Lists that are smaller than their parts: A coding approach to tunable secrecy. In: IEEE 50th Annual Allerton Conference on Communication, Control, and Computing, 1-5 October 2012, Allerton Retreat Center Monticello, Illinois.

    Download (130kB) | Preview

    Share your research

    Twitter Facebook LinkedIn GooglePlus Email more...

    Add this article to your Mendeley library


    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 nonasymptotic 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.

    Item Type: Conference or Workshop Item (Paper)
    Keywords: Information Theory; tunable secrecy; security; list decoding;
    Academic Unit: Faculty of Science and Engineering > Research Institutes > Hamilton Institute
    Item ID: 5985
    Depositing User: Dr Ken Duffy
    Date Deposited: 24 Mar 2015 16:58
    Refereed: Yes
    Funders: Higher Education Authority (HEA)

    Repository Staff Only(login required)

    View Item Item control page


    Downloads per month over past year