Abstract
At the end of Chapter 1, in connection with the One-Time Pad, we discussed the notion of perfect secrecy. The effect of perfect secrecy is that the adversary, even if he has unlimited resources, can not gain any information about the plaintext from the ciphertext, except its length (if this is not a known parameter). The fact that any cryptosystem leaks the information about the length of the plaintext will be proved below (Theorem 10.1). Another notion, related to perfect secrecy, is that of so-called semantic security. Roughly speaking, semantic security is a polynomially bounded variant of perfect security, i.e., one assumes that the adversary has only polynomially bounded resources.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Neuenschwander, D. (2004). 10 Semantic Security. In: Probabilistic and Statistical Methods in Cryptology. Lecture Notes in Computer Science, vol 3028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25942-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-25942-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22001-5
Online ISBN: 978-3-540-25942-8
eBook Packages: Springer Book Archive