Visible to the public On measures of information theoretic security

TitleOn measures of information theoretic security
Publication TypeConference Paper
Year of Publication2014
AuthorsLiu, S., Hong, Y., Viterbo, E.
Conference Name2014 IEEE Information Theory Workshop (ITW 2014)
KeywordsAustralia, computational security, cryptography, Entropy, Human Behavior, ideal secrecy, information theoretic cryptosystem, information theoretic security, Information theory, Metrics, policy-based governance, probability, pubcrawl, Resiliency, Scalability, Shannon perfect secrecy, Vectors
AbstractWhile information-theoretic security is stronger than computational security, it has long been considered impractical. In this work, we provide new insights into the design of practical information-theoretic cryptosystems. Firstly, from a theoretical point of view, we give a brief introduction into the existing information theoretic security criteria, such as the notions of Shannon's perfect/ideal secrecy in cryptography, and the concept of strong secrecy in coding theory. Secondly, from a practical point of view, we propose the concept of ideal secrecy outage and define a outage probability. Finally, we show how such probability can be made arbitrarily small in a practical cryptosystem.
Citation Keyliu_measures_2014