A concrete security treatment of symmetric encryption

被引：471

作者：

Bellare, M ^{[1
]}

Desai, A ^{[1
]}

Jokipii, E ^{[1
]}

Rogaway, P ^{[1
]}

机构：

[1] Univ Calif San Diego, Dept Comp Engn & Sci, La Jolla, CA 92093 USA

来源：

38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS | 1997年

关键词：

D O I：

10.1109/SFCS.1997.646128

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study notions and schemes for symmetric (ie. private key) encryption in a concrete security framework. 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.

引用

页码：394 / 403

页数：10