Live briefing
Everything about Semantic security
Cryptography method
In cryptography, a semantically secure cryptosystem is one where only negligible information about the plaintext can be feasibly extracted from the ciphertext. Specifically, any probabilistic, polynomial-time algorithm (PPTA) that is given the ciphertext of a certain message, and the message's length, cannot determine any partial information on the message with probability non-negligibly higher than all other PPTAs that only have access to the message length. This concept is the computational complexity analogue to Shannon's concept of perfect secrecy. Perfect secrecy means that the ciphertext reveals no information at all about the plaintext, whereas semantic security implies that any information revealed cannot be feasibly extracted. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Semantic securityA 5-minute orientation
- Skim a recent paper: A Survey on Semantic Communication Networks: Architecture, Security, and PrivacyInfluential work since 2022
- Pick up a classic book: DMZThe most-reprinted book on the subject
- Read the landmark paper: Rethinking Wireless Communication Security in Semantic Internet of ThingsCited 113 times
- Go sideways: Ciphertext indistinguishabilityA closely related topic
- Go sideways: Chosen-plaintext attackA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Rethinking Wireless Communication Security in Semantic Internet of Things
Semantic Association Identification and Knowledge Discovery for National Security Applications
Semantic security for the McEliece cryptosystem without random oracles
Semantic-Security Capacity for Wiretap Channels of Type II
Semantic Entropy Can Simultaneously Benefit Transmission Efficiency and Channel Security of Wireless Semantic Communications
Semantic security against web application attacks
Wireless Image Transmission With Semantic and Security Awareness
Security in the Semantic Web using OWL
🆕 Influential since 2022
A Survey on Semantic Communication Networks: Architecture, Security, and Privacy
SecureOnt: A Security Ontology for Establishing Data Provenance in Semantic Web
Secure Semantic Communications: From Perspective of Physical Layer Security
Resource Management, Security, and Privacy Issues in Semantic Communications: A Survey
CASMS: Combining clustering with attention semantic model for identifying security bug reports
📚 Books worth reading
DMZChae-han Kim · 1998
Applied Cloud Deep Semantic RecognitionMehdi Roopaei, Peyman Najafirad (Paul Rad) · 2018
Building Trustworthy Semantic WebsBhavani Thuraisingham · 2007
Introduction to contextual processingGregory Vert · 2010
Web Information Systems and MiningWu Lee Wang, Jingsheng Lei · 2009
Handbook on soft computing for video surveillanceSankar K. Pal, Alfredo Petrosino · 2012
Schlüsselwörter der WendezeitDieter Herberg · 1997
Building trustworthy semantic websBhavani M Thuraisingham · 2008
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Ciphertext indistinguishability Ciphertext indistinguishability is a property of many encryption schemes. Intuitively, if a cryptosystem possesses the property of indistinguishability…
- Chosen-plaintext attack A chosen-plaintext attack (CPA) is an attack model for cryptanalysis which presumes that the attacker can obtain the ciphertexts for arbitrary plaintexts…
- Goldwasser–Micali cryptosystem The Goldwasser–Micali (GM) cryptosystem is an asymmetric key encryption algorithm developed by Shafi Goldwasser and Silvio Micali in 1982. GM has the distinctio…
- Probabilistic encryption Probabilistic encryption is the use of randomness in an encryption algorithm, so that when encrypting the same message several times it will, in general…
- Deterministic encryption A deterministic encryption scheme (as opposed to a probabilistic encryption scheme) is a cryptosystem which always produces the same ciphertext for a given…
- Plaintext-aware encryption Plaintext-awareness is a notion of security for public-key encryption. A cryptosystem is plaintext-aware if it is difficult for any efficient algorithm…
- Chosen-ciphertext attack A chosen-ciphertext attack (CCA) is an attack model for cryptanalysis in which the cryptanalyst can gather information by obtaining the decryptions of…
- Rabin cryptosystem The Rabin cryptosystem is a family of public-key encryption schemes based on a trapdoor function whose security, like that of RSA, is related to the difficulty…