Authors: Mihir Bellare, Anand Desai, Eron Jokipii and Phillip Rogaway
Reference: Proceedings of 38th Annual Symposium on Foundations of Computer Science, IEEE, 1997.
Abstract: We give four different notions of security against chosen plaintext attack and analyze the concrete complexity of reductions among them, providing both upper and lower bounds, and obtaining tight relations. In this way we classify notions (even though polynomially reducible to each other) as stronger or weaker in terms of concrete security. Next we provide concrete security analyses of methods to encrypt using a block cipher, including the most popular encryption method, CBC. We establish tight bounds (meaning matching upper bounds and attacks) on the success of adversaries as a function of their resources.
Full version available in PDF or PostScript.
Rogaway's home page.