Summary
Information-theoretic security guarantees security even if the adversary has unlimited computing power, by contrast with cryptography where the adversary is assumed to have bounded computational power. Hence, information-theoretic security does not depend for its effectiveness on typically unproven assumptions about computational hardness. Information-theoretically secure cryptosystems have been used, for instance, for the most sensitive governmental communications, such as diplomatic cables and high-level military communications.
Keywords
Researchers involved
- Olivier Rioul, LTCI-Telecom Paris, olivier.rioul@telecom-paris.fr
- Mireille Sarkiss, Telecom Sud Paris, mireille.sarkiss@telecom-sudparis.eu
- Aslan Tchamkerten, LTCI-Telecom Paris, aslan.tchamkerten@telecom-paris.fr
- Michele Wigger, LTCI-Telecom Paris, michele.wigger@telecom-paris.fr
References
- E. De Chérisey, S. Guilley, O. Rioul, D. Jayasinghe, “Information Theoretic Distinguishers for Timing Attacks with Partial Profiles: Solving the Empty Bin Issue”, Journal of Information Security, 2020.
- S. Kamel, M. Sarkiss, M. Wigger, GRB. Othman. “Secrecy capacity-memory tradeoff of erasure broadcast channels”, IEEE Transactions on Information Theory, 2019.