Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1109/SFCS.1997.646128 | FOCS |
Keywords | Field | DocType |
matching upper bound,different notion,tight bound,concrete security,block cipher,tight relation,concrete security treatment,concrete security analysis,concrete complexity,symmetric encryption,popular encryption method,concrete security framework,computational complexity,private key,complexity,upper and lower bounds,polynomials,public key cryptography,upper bound,security,cryptography,computer science,concrete | Watermarking attack,Computer security,Computer science,Concrete security,Theoretical computer science,Encryption,Probabilistic encryption,40-bit encryption,56-bit encryption,Plaintext,Ciphertext-only attack | Conference |
ISSN | ISBN | Citations |
0272-5428 | 0-8186-8197-7 | 326 |
PageRank | References | Authors |
41.06 | 5 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mihir Bellare | 1 | 16437 | 1481.16 |
| A DESAI | 2 | 1193 | 140.69 |
| Eron Jokipii | 3 | 326 | 41.06 |
| Phillip Rogaway | 4 | 10591 | 920.07 |