Communication theory of secrecy systems

By Claude E. Shannon. 1949

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Privacy Risks of Securing Machine Learning Models against Adversarial Examples (2019, background): “We argue that this assumption is reasonable following Kerckhoffs’s principle [25, 44].”
Spatially Transformed Adversarial Examples (2018, background): “In this work, we will focus on the white-box setting to explore what a powerful adversary can do based on the Kerckhoffs’s principle (Shannon, 1949) to better motivate defense methods.”
Robust Physical-World Attacks on Deep Learning Models (2017, background): “Following Kerckhoffs’ principle [25], it is often desirable to construct defenses that are robust in the presence of whitebox attackers.”
Making AI Forget You: Data Deletion in Machine Learning (2019, background): “Such relaxations are required for encryption algorithms because perfect secrecy can only be achieved via one-time pad [78].”
Data-Hiding Codes (2005, methodology): “Following cryptographic terminology, two basic types of systems can be used: private-key systems, based on Shannon’s theory of security [118]; and public-key systems as introduced by Diffie and Hellmann [119].”
Chaos and cryptography: block encryption ciphers based on chaotic maps (2001, background): “Shannon in his seminal paper [1] wrote: " In a good mixing transformation functions are complicated, involving all variables in a sensitive way.”
Classifications and Applications of Physical Layer Security Techniques for Confidentiality: A Comprehensive Survey (2019, background): “desirable to be implemented without just relying on the traditional cryptographic key-based sharing approaches, which are mostly dependent on Shannon’s security model [1].”
On compressing encrypted data (2004, background): “Shannon [7] that assumed lossless recovery (zero distortion) of the source at the decoder.”
A Survey of Homomorphic Encryption for Nonspecialists (2007, background): “Security : This scheme has been showed to be unconditionally secure by Shannon [26] if and only if the keystream is truly random, has the same length as the plaintext, and is used only once.”
A short wavelength GigaHertz clocked fiber-optic quantum key distribution system (2004, methodology): “A secure method of encryption—the “one-time pad” approach—was proposed in 1917 by Vernam, and was proven absolutely secure by Shannon in 1949 [4].”
On the Incomparability of Entropy and Marginal Guesswork in Brute-Force Attacks (2000, background): “Since plaintext redundancy limits cipher security, entropy is often useful in cryptology [16,17].”
The protection of information in computer systems (1975, background): “Since World War II, only three papers with significant contributions have appeared in the open literature [27], [39], [85]; other papers have only updated, reexamined, or rearranged concepts published many years earlier.”
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey (2010, background): “Shannon postulated the information-theoretic foundations of modern cryptography in his ground-breaking treatise of 1949 [14].”
A novel algorithm for image encryption based on mixture of chaotic maps (2008, background): “In regard to the tight relationship between cryptography and chaos theory and two general principles which leads to the design of good cryptosystems, diffusion and confusion [32], and with respect to partitioning of the state space which turns the deterministic chaotic system into an ergodic informa”
Transmit Antenna Selection for Security Enhancement in MIMO Wiretap Channels (2013, background): “, the network layer), based on the assumption of an error-free link in the physical layer [1].”