Name
Abstract | ||
|---|---|---|
We investigate new strong security notions for on-line symmetric encryption schemes, which are the schemes whose encryption and decryption algorithms operate "on-the-fly" and in one pass, namely can compute and return an output block given only the key, the current input block and the previous input and output blocks. We define the strongest achievable notion of privacy which takes into account both chosen-ciphertext attacks and the recently introduced blockwise-adaptive [15, 12] attacks. We show that all the schemes shown to be secure against blockwise-adaptive chosen-plaintext attacks are subject to blockwise-adaptive chosen-ciphertext attacks. We present an on-line encryption scheme which is provably secure under our notion. It uses any strong online cipher, the primitive introduced in [1]. We finally discuss the notion of authenticated on-line schemes and provide a secure construction. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-24660-2_1 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
symmetric encryption,provable security,chosen ciphertext attack | Symmetric-key algorithm,Cipher,Block cipher,Computer science,Cryptography,Computer security,Attribute-based encryption,Encryption,Theoretical computer science,Probabilistic encryption,40-bit encryption | Conference |
Volume | ISSN | Citations |
2964 | 0302-9743 | 16 |
PageRank | References | Authors |
0.74 | 12 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexandra Boldyreva | 1 | 2297 | 114.80 |
| Nut Taesombut | 2 | 43 | 3.60 |