Abstract is missing.
- Related-Key Cryptanalysis of the Full AES-192 and AES-256Alex Biryukov, Dmitry Khovratovich. 1-18 [doi]
- The Key-Dependent Attack on Block CiphersXiaorui Sun, Xuejia Lai. 19-36 [doi]
- Cascade Encryption RevisitedPeter Gazi, Ueli M. Maurer. 37-51 [doi]
- Quantum-Secure Coin-Flipping and ApplicationsIvan Damgård, Carolin Lunemann. 52-69 [doi]
- On the Power of Two-Party Quantum CryptographyLouis Salvail, Christian Schaffner, Miroslava Sotáková. 70-87 [doi]
- Security Bounds for the Design of Code-Based CryptosystemsMatthieu Finiasz, Nicolas Sendrier. 88-105 [doi]
- Rebound Attack on the Full Lane Compression FunctionKrystian Matusiewicz, MarÃa Naya-Plasencia, Ivica Nikolic, Yu Sasaki, Martin Schläffer. 106-125 [doi]
- Rebound Distinguishers: Results on the Full Whirlpool Compression FunctionMario Lamberger, Florian Mendel, Christian Rechberger, Vincent Rijmen, Martin Schläffer. 126-143 [doi]
- MD5 Is Weaker Than Weak: Attacks on Concatenated CombinersFlorian Mendel, Christian Rechberger, Martin Schläffer. 144-161 [doi]
- The Intel AES Instructions Set and the SHA-3 CandidatesRyad Benadjila, Olivier Billet, Shay Gueron, Matthew J. B. Robshaw. 162-178 [doi]
- Group Encryption: Non-interactive Realization in the Standard ModelJulien Cathalo, Benoît Libert, Moti Yung. 179-196 [doi]
- On Black-Box Constructions of Predicate Encryption from Trapdoor PermutationsJonathan Katz, Arkady Yerukhimovich. 197-213 [doi]
- Hierarchical Predicate Encryption for Inner-ProductsTatsuaki Okamoto, Katsuyuki Takashima. 214-231 [doi]
- Hedged Public-Key Encryption: How to Protect against Bad RandomnessMihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham, Scott Yilek. 232-249 [doi]
- Secure Two-Party Computation Is PracticalBenny Pinkas, Thomas Schneider, Nigel P. Smart, Stephen C. Williams. 250-267 [doi]
- Secure Multi-party Computation Minimizing Online RoundsSeung Geol Choi, Ariel Elbaz, Tal Malkin, Moti Yung. 268-286 [doi]
- Improved Non-committing Encryption with Applications to Adaptively Secure ProtocolsSeung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee. 287-302 [doi]
- Non-malleable Statistically Hiding Commitment from Any One-Way FunctionZongyang Zhang, Zhenfu Cao, Ning Ding, Rong Ma. 303-318 [doi]
- Proofs of Storage from Homomorphic Identification ProtocolsGiuseppe Ateniese, Seny Kamara, Jonathan Katz. 319-333 [doi]
- Simple Adaptive Oblivious Transfer without Random OracleKaoru Kurosawa, Ryo Nojima. 334-346 [doi]
- Improved Generic Algorithms for 3-CollisionsAntoine Joux, Stefan Lucks. 347-363 [doi]
- A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach PracticalAnja Lehmann, Stefano Tessaro. 364-381 [doi]
- How to Confirm Cryptosystems Security: The Original Merkle-Damgård Is Still Alive!Yusuke Naito, Kazuki Yoneyama, Lei Wang, Kazuo Ohta. 382-398 [doi]
- On the Analysis of Cryptographic Assumptions in the Generic Ring ModelTibor Jager, Jörg Schwenk. 399-416 [doi]
- Zero Knowledge in the Random Oracle Model, RevisitedHoeteck Wee. 417-434 [doi]
- A Framework for Universally Composable Non-committing Blind SignaturesMasayuki Abe, Miyako Ohkubo. 435-450 [doi]
- Cryptanalysis of the Square CryptosystemsOlivier Billet, Gilles Macario-Rat. 451-468 [doi]
- Factoring ::::pq:::::::2::: with Quadratic Forms: Nice CryptanalysesGuilhem Castagnos, Antoine Joux, Fabien Laguillaumie, Phong Q. Nguyen. 469-486 [doi]
- Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?Mathias Herrmann, Alexander May. 487-504 [doi]
- Security Notions and Generic Constructions for Client PuzzlesLiqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan Warinschi. 505-523 [doi]
- Foundations of Non-malleable Hash and One-Way FunctionsAlexandra Boldyreva, David Cash, Marc Fischlin, Bogdan Warinschi. 524-541 [doi]
- Improved Cryptanalysis of SkeinJean-Philippe Aumasson, Çagdas Çalik, Willi Meier, Onur Özen, Raphael C.-W. Phan, Kerem Varici. 542-559 [doi]
- Linearization Framework for Collision Attacks: Application to CubeHash and MD6Eric Brier, Shahram Khazaei, Willi Meier, Thomas Peyrin. 560-577 [doi]
- Preimages for Step-Reduced SHA-2Kazumaro Aoki, Jian Guo, Krystian Matusiewicz, Yu Sasaki, Lei Wang. 578-597 [doi]
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based SignaturesVadim Lyubashevsky. 598-616 [doi]
- Efficient Public Key Encryption Based on Ideal LatticesDamien Stehlé, Ron Steinfeld, Keisuke Tanaka, Keita Xagawa. 617-635 [doi]
- Smooth Projective Hashing and Password-Based Authenticated Key Exchange from LatticesJonathan Katz, Vinod Vaikuntanathan. 636-652 [doi]
- PSS Is Secure against Random Fault AttacksJean-Sébastien Coron, Avradip Mandal. 653-666 [doi]
- Cache-Timing Template AttacksBilly Bob Brumley, Risto M. Hakala. 667-684 [doi]
- Memory Leakage-Resilient Encryption Based on Physically Unclonable FunctionsFrederik Armknecht, Roel Maes, Ahmad-Reza Sadeghi, Berk Sunar, Pim Tuyls. 685-702 [doi]
- Signature Schemes with Bounded Leakage ResilienceJonathan Katz, Vinod Vaikuntanathan. 703-720 [doi]