| 397 | -- | 422 | Orr Dunkelman, Nathan Keller, Adi Shamir. Improved Single-Key Attacks on 8-Round AES-192 and AES-256 |
| 423 | -- | 508 | Dennis Hofheinz, Victor Shoup. GNUC: A New Universal Composability Framework |
| 509 | -- | 532 | Eric Miles, Emanuele Viola. On the Complexity of Constructing Pseudorandom Functions (Especially when They Don't Exist) |
| 533 | -- | 550 | Lior Malka. How to Achieve Perfect Simulation and a Complete Problem for Non-interactive Perfect Zero-Knowledge |
| 551 | -- | 600 | Amos Beimel, Eran Omri, Ilan Orlov. Protocols for Multiparty Coin Toss with a Dishonest Majority |
| 601 | -- | 622 | Boaz Tsaban. Polynomial-Time Solutions of Computational Problems in Noncommutative-Algebraic Cryptography |
| 623 | -- | 640 | Ron Berman, Amos Fiat, Marcin Gomulkiewicz, Marek Klonowski, Miroslaw Kutylowski, Tomer Levinboim, Amnon Ta-Shma. Provable Unlinkability Against Traffic Analysis with Low Message Overhead |
| 641 | -- | 670 | Sven Schäge. Tight Security for Signature Schemes Without Random Oracles |
| 671 | -- | 717 | Benjamin Fuller, Adam O'Neill, Leonid Reyzin. A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy |
| 718 | -- | 744 | Hadi Soleimany, Céline Blondeau, Xiaoli Yu, Wenling Wu, Kaisa Nyberg, Huiling Zhang, Lei Zhang 0012, Yanfeng Wang. Reflection Cryptanalysis of PRINCE-Like Ciphers |