ASIACRYPT 2009: Tokyo, Japan

Block Ciphers

• Alex Biryukov, Dmitry Khovratovich:
  Related-Key Cryptanalysis of the Full AES-192 and AES-256. 1-18
  
• Xiaorui Sun, Xuejia Lai:
  The Key-Dependent Attack on Block Ciphers. 19-36
  
• Peter Gazi, Ueli M. Maurer:
  Cascade Encryption Revisited. 37-51
  

Quantum and Post-Quantum

• Ivan Damgård, Carolin Lunemann:
  Quantum-Secure Coin-Flipping and Applications. 52-69
  
• Louis Salvail, Christian Schaffner, Miroslava Sotáková:
  On the Power of Two-Party Quantum Cryptography. 70-87
  
• Matthieu Finiasz, Nicolas Sendrier:
  Security Bounds for the Design of Code-Based Cryptosystems. 88-105
  

Hash Functions I

• Krystian Matusiewicz, María Naya-Plasencia, Ivica Nikolic, Yu Sasaki, Martin Schläffer:
  Rebound Attack on the Full Lane Compression Function. 106-125
  
• Mario Lamberger, Florian Mendel, Christian Rechberger, Vincent Rijmen, Martin Schläffer:
  Rebound Distinguishers: Results on the Full Whirlpool Compression Function. 126-143
  
• Florian Mendel, Christian Rechberger, Martin Schläffer:
  MD5 Is Weaker Than Weak: Attacks on Concatenated Combiners. 144-161
  
• Ryad Benadjila, Olivier Billet, Shay Gueron, Matthew J. B. Robshaw:
  The Intel AES Instructions Set and the SHA-3 Candidates. 162-178
  

Encryption Schemes

• Julien Cathalo, Benoît Libert, Moti Yung:
  Group Encryption: Non-interactive Realization in the Standard Model. 179-196
  
• Jonathan Katz, Arkady Yerukhimovich:
  On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations. 197-213
  
• Tatsuaki Okamoto, Katsuyuki Takashima:
  Hierarchical Predicate Encryption for Inner-Products. 214-231
  
• Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham, Scott Yilek:
  Hedged Public-Key Encryption: How to Protect against Bad Randomness. 232-249
  

Multi Party Computation

• Benny Pinkas, Thomas Schneider, Nigel P. Smart, Stephen C. Williams:
  Secure Two-Party Computation Is Practical. 250-267
  
• Seung Geol Choi, Ariel Elbaz, Tal Malkin, Moti Yung:
  Secure Multi-party Computation Minimizing Online Rounds. 268-286
  
• Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee:
  Improved Non-committing Encryption with Applications to Adaptively Secure Protocols. 287-302
  

Cryptographic Protocols

• Zongyang Zhang, Zhenfu Cao, Ning Ding, Rong Ma:
  Non-malleable Statistically Hiding Commitment from Any One-Way Function. 303-318
  
• Giuseppe Ateniese, Seny Kamara, Jonathan Katz:
  Proofs of Storage from Homomorphic Identification Protocols. 319-333
  
• Kaoru Kurosawa, Ryo Nojima:
  Simple Adaptive Oblivious Transfer without Random Oracle. 334-346
  

Hash Functions II

• Antoine Joux, Stefan Lucks:
  Improved Generic Algorithms for 3-Collisions. 347-363
  
• Anja Lehmann, Stefano Tessaro:
  A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical. 364-381
  
• Yusuke Naito, Kazuki Yoneyama, Lei Wang, Kazuo Ohta:
  How to Confirm Cryptosystems Security: The Original Merkle-Damgård Is Still Alive! 382-398
  

Models and Frameworks I

• Tibor Jager, Jörg Schwenk:
  On the Analysis of Cryptographic Assumptions in the Generic Ring Model. 399-416
  
• Hoeteck Wee:
  Zero Knowledge in the Random Oracle Model, Revisited. 417-434
  
• Masayuki Abe, Miyako Ohkubo:
  A Framework for Universally Composable Non-committing Blind Signatures. 435-450
  

Cryptanalysis: Sqaure and Quadratic

• Olivier Billet, Gilles Macario-Rat:
  Cryptanalysis of the Square Cryptosystems. 451-468
  
• Guilhem Castagnos, Antoine Joux, Fabien Laguillaumie, Phong Q. Nguyen:
  Factoring pq² with Quadratic Forms: Nice Cryptanalyses. 469-486
  
• Mathias Herrmann, Alexander May:
  Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much? 487-504
  

Models and Frameworks II

• Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan Warinschi:
  Security Notions and Generic Constructions for Client Puzzles. 505-523
  
• Alexandra Boldyreva, David Cash, Marc Fischlin, Bogdan Warinschi:
  Foundations of Non-malleable Hash and One-Way Functions. 524-541
  

Hash Functions III

• Jean-Philippe Aumasson, Çagdas Çalik, Willi Meier, Onur Özen, Raphael C.-W. Phan, Kerem Varici:
  Improved Cryptanalysis of Skein. 542-559
  
• Eric Brier, Shahram Khazaei, Willi Meier, Thomas Peyrin:
  Linearization Framework for Collision Attacks: Application to CubeHash and MD6. 560-577
  
• Kazumaro Aoki, Jian Guo, Krystian Matusiewicz, Yu Sasaki, Lei Wang:
  Preimages for Step-Reduced SHA-2. 578-597
  

Lattice-Based

• Vadim Lyubashevsky:
  Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures. 598-616
  
• Damien Stehlé, Ron Steinfeld, Keisuke Tanaka, Keita Xagawa:
  Efficient Public Key Encryption Based on Ideal Lattices. 617-635
  
• Jonathan Katz, Vinod Vaikuntanathan:
  Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices. 636-652
  

Side Channels

• Jean-Sébastien Coron, Avradip Mandal:
  PSS Is Secure against Random Fault Attacks. 653-666
  
• Billy Bob Brumley, Risto M. Hakala:
  Cache-Timing Template Attacks. 667-684
  
• Frederik Armknecht, Roel Maes, Ahmad-Reza Sadeghi, Berk Sunar, Pim Tuyls:
  Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions. 685-702
  
• Jonathan Katz, Vinod Vaikuntanathan:
  Signature Schemes with Bounded Leakage Resilience. 703-720
  

Last update Sat May 25 01:59:32 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page