Program

All sessions and welcome reception are held at Hitotsubashi Memorial Hall, 2nd floor of National Center of Sciences Building. The building opens 8:30 in the morning everyday. Please have your registration confirmation letter or conference badge with you, which is needed to enter the building.

PDF Version is also available.


Sunday, December 6

17:30-20:30 Registration
18:30-20:30 Welcome Reception

Monday, December 7

08:40 Registration
09:10-09:20 Welcome and Opening Remarks
09:20-10:35 Session 1 - Block Ciphers (Chair: Orr Dunkelman)
•  Related-key Cryptanalysis of the Full AES-192 and AES-256 (slides) (video)
    Alex Biryukov and Dmitry Khovratovich
•  The Key-Dependent Attack on Block Ciphers (slides) (video)
    Xiaorui Sun and Xuejia Lai
•  Cascade Encryption Revisited (slides) (video)
    Peter Gaži and Ueli Maurer
10:35-10:55 Morning Break
10:55-12:10 Session 2 - Quantum and Post-Quantum (Chair: Serge Fehr)
•  Quantum-Secure Coin-Flipping and Applications (slides) (video)
    Ivan Damgård and Carolin Lunemann
•  On the Power of Two-Party Quantum Cryptography (slides) (video)
    Louis Salvail, Christian Schaffner and Miroslava Sotakova
•  Security Bounds for the Design of Code-based Cryptosystems (slides) (video)
    Matthieu Finiasz and Nicolas Sendrier
12:10-13:40 Lunch, Gakushi Kaikan
13:30-15:10 Session 3 - Hash Functions I (Chair: Josef Pieprzyk)
•  Rebound Attack on the Full LANE Compression Function (slides) (video)
    Krystian Matusiewicz, María Naya-Plasencia, Ivica Nikolić, Yu Sasaki and Martin Schläffer
•  Rebound Distinguishers: Results on the Full Whirlpool Compression Function (slides) (video)
    Mario Lamberger, Florian Mendel, Christian Rechberger, Vincent Rijmen and Martin Schläffer
•  MD5 is Weaker than Weak: Attacks on Concatenated Combiners (slides) (video)
    Florian Mendel, Christian Rechberger and Martin Schläffer
•  The Intel AES Instructions Set and the SHA-3 Candidates (slides) (video)
    Ryad Benadjila, Olivier Billet, Shay Gueron and Matt Robshaw
15:20-15:40 Afternoon Break
15:40-17:20 Session 4 - Encryption Schemes (Chair: Rei Safavi-Naini)
•  Group Encryption: Non-Interactive Realization in the Standard Model (slides) (video)
    Julien Cathalo, Benoît Libert and Moti Yung
•  On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations (slides) (video)
    Jonathan Katz and Arkady Yerukhimovich
•  Hierarchical Predicate Encryption for Inner-Products (slides) (video)
    Tatsuaki Okamoto and Katsuyuki Takashima
•  Hedged Public-Key Encryption: How to Protect Against Bad Randomness (slides) (video)
    Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham and Scott Yilek
18:30-20:00 Rump Session (Chair: Shiho Moriai)
See Rump Session page for the program.

Tuesday, December 8

08:40 Registration
09:10-10:25 Session 5 - Multi Party Computation (Chair: Masayuki Abe)
•  Secure Two-Party Computation is Practical (slides) (video)
    Benny Pinkas, Thomas Schneider, Nigel P. Smart and Stephen C. Williams
•  Secure Multi-party Computation Minimizing Online Rounds (slides) (video)
    Seung Geol Choi, Ariel Elbaz, Tal Malkin and Moti Yung
•  Improved Non-Committing Encryption with Applications to Adaptively Secure Protocols (slides) (video)
    Seung Geol Choi, Dana Dachman-Soled, Tal Malkin and Hoeteck Wee
10:25-10:45 Morning Break
10:45-12:00 Session 6 - Cryptographic Protocols (Chair: Atsushi Fujioka)
•  Non-Malleable Statistically Hiding Commitment from Any One-Way Function (slides) (video)
    Zongyang Zhang, Zhenfu Cao, Ning Ding and Rong Ma
•  Proofs of Storage from Homomorphic Identification Protocols (slides) (video)
    Giuseppe Ateniese, Seny Kamara and Jonathan Katz
•  Simple Adaptive Oblivious Transfer Without Random Oracle (slides) (video)
    Kaoru Kurosawa and Ryo Nojima
12:00-13:30 Lunch, Gakushi Kaikan

Wednesday, December 9

08:40 Registration
09:10-10:25 Session 7 - Hash Functions II (Chair: Tetsu Iwata)
•  Improved generic algorithms for 3-collisions (slides) (video)
    Antoine Joux and Stefan Lucks
•  A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical (slides) (video)
    Anja Lehmann and Stefano Tessaro
•  How to Confirm Cryptosystems Security: The Original Merkle-Damgård is Still Alive! (slides) (video)
    Yusuke Naito, Kazuki Yoneyama, Lei Wang and Kazuo Ohta
10:25-10:45 Morning Break
10:45-12:00 Session 8 - Models and Frameworks I (Chair: Ivan Visconti)
•  On the Analysis of Cryptographic Assumptions in the Generic Ring Model (slides) (video)
    Tibor Jager and Jörg Schwenk
•  Zero Knowledge in the Random Oracle Model, Revisited (slides) (video)
    Hoeteck Wee
•  A Framework for Universally Composable Non-Committing Blind Signatures (slides) (video)
    Masayuki Abe and Miyako Ohkubo
12:00-13:30 Lunch, Gakushi Kaikan
13:30-14:45 Session 9 - Cryptanalysis: Square and Quadratic (Chair: Jun Furukawa)
•  Cryptanalysis of the Square Cryptosystems (slides) (video)
    Olivier Billet and Gilles Macario-Rat (Yannick Seurin gives the talk)
•  Factoring $pq^2$ with Quadratic Forms: Nice Cryptanalyses (slides) (video)
    Guilhem Castagnos, Antoine Joux, Fabien Laguillaumie and Phong Q. Nguyen
•  Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much? (slides) (video)
    Mathias Herrmann and Alexander May
14:45-15:05 Afternoon Break
15:05-15:55 Session 10 - Models and Frameworks II (Chair: Serge Vaudenay)
•  Security Notions and Generic Constructions for Client Puzzles (slides) (video)
    Liqun Chen, Paul Morrissey, Nigel P. Smart and Bogdan Warinschi
•  Foundations of Non-Malleable Hash and One-Way Functions (slides) (video)
    Alexandra Boldyreva, David Cash, Marc Fischlin and Bogdan Warinschi
16:00-17:00 IACR Distinguished Lecture (Chair: Bart Preneel)
•  A New Approach on Bilinear Pairings and Its Applications (slides) (video)
    Tatsuaki Okamoto
17:00-18:00 IACR Business Meeting
19:00-21:00 Banquet, Meiji Kinenkan
(Shuttle buses to/from the banquet venue available)

Thursday, December 10

08:40 Registration
09:10-10:25 Session 11 - Hash Functions III (Chair: Xuejia Lai)
•  Improved Cryptanalysis of Skein (slides) (video)
    Jean-Philippe Aumasson, Çağdaş Çalik, Willi Meier, Onur Özen, Raphael C.-W. Phan and Kerem Varıcı
•  Linearization Framework for Collision Attacks: Application to CubeHash and MD6 (slides) (video)
    Eric Brier, Shahram Khazaei, Willi Meier and Thomas Peyrin
•  Preimages for Step-Reduced SHA-2 (slides) (video)
    Kazumaro Aoki, Jian Guo, Krystian Matusiewicz, Yu Sasaki and Lei Wang
10:25-10:45 Morning Break
10:45-12:00 Session 12 - Lattice-Based (Chair: Phong Nguyen)
•  Fiat-Shamir With Aborts: Applications to Lattice and Factoring-Based Signatures (slides) (video)
    Vadim Lyubashevsky
•  Efficient Public Key Encryption Based on Ideal Lattices (slides) (video)
    Damien Stehlé, Ron Steinfeld, Keisuke Tanaka and Keita Xagawa
•  Smooth Projective Hashing and Password-Based Authenticated Key Exchange Based on Lattices (slides) (video)
    Jonathan Katz and Vinod Vaikuntanathan
12:00-13:30 Lunch, Gakushi Kaikan
13:30-15:10 Session 13 - Side Channels (Chair: Goichiro Hanaoka)
•  PSS is Secure against Random Fault Attacks (slides) (video)
    Jean-Sébastien Coron and Avradip Mandal
•  Cache-Timing Template Attacks (slides) (video)
    Billy Brumley and Risto Hakala
•  Memory Leakage-Resilient Encryption based on Physically Unclonable Functions (slides) (video)
    Frederik Armknecht, Roel Maes, Ahmad-Reza Sadeghi, Berk Sunar and Pim Tuyls
•  Signature Schemes with Bounded Leakage Resilience (slides) (video)
    Jonathan Katz and Vinod Vaikuntanathan
15:10-15:20 Sayonara

ASIACRYPT 2009 Accepted Papers (09/09/09)

The final version that will appear at the conference and proceedings is subject to change.

PDF version is also available.


110. Improved Cryptanalysis of Skein

Jean-Philippe Aumasson, Çağdaş Çalik, Willi Meier, Onur Özen, Raphael C.-W. Phan and Kerem Varıcı

116. Secure Two-Party Computation is Practical

Benny Pinkas, Thomas Schneider, Nigel P. Smart and Stephen C. Williams

128. Security Notions and Generic Constructions for Client Puzzles

Liqun Chen, Paul Morrissey, Nigel P. Smart and Bogdan Warinschi

130. On the Analysis of Cryptographic Assumptions in the Generic Ring Model

Tibor Jager and Jörg Schwenk

134 .Fiat-Shamir With Aborts: Applications to Lattice and Factoring-Based Signatures

Vadim Lyubashevsky

145. Rebound Distinguishers: Results on the Full Whirlpool Compression Function

Mario Lamberger, Florian Mendel, Christian Rechberger, Vincent Rijmen and Martin Schläffer

152. PSS is Secure against Random Fault Attacks

Jean-Sébastien Coron and Avradip Mandal

157. Zero Knowledge in the Random Oracle Model, Revisited

Hoeteck Wee

168. Linearization Framework for Collision Attacks: Application to CubeHash and MD6

Eric Brier, Shahram Khazaei, Willi Meier and Thomas Peyrin

173. Improved generic algorithms for 3-collisions

Antoine Joux and Stefan Lucks

189. Non-Malleable Statistically Hiding Commitment from Any One-Way Function

Zongyang Zhang, Zhenfu Cao, Ning Ding and Rong Ma

202+302. Preimages for Step-Reduced SHA-2

Kazumaro Aoki, Jian Guo, Krystian Matusiewicz, Yu Sasaki and Lei Wang

207. Cache-Timing Template Attacks

Billy Brumley and Risto Hakala

221. Related-key Cryptanalysis of the Full AES-192 and AES-256

Alex Biryukov and Dmitry Khovratovich

225. A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical

Anja Lehmann and Stefano Tessaro

228. Security Bounds for the Design of Code-based Cryptosystems

Matthieu Finiasz and Nicolas Sendrier

231. On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations

Jonathan Katz and Arkady Yerukhimovich

235. Memory Leakage-Resilient Encryption based on Physically Unclonable Functions

Frederik Armknecht, Roel Maes, Ahmad-Reza Sadeghi, Berk Sunar and Pim Tuyls

246. Quantum-Secure Coin-Flipping and Applications

Ivan Damgård and Carolin Lunemann

250. Signature Schemes with Bounded Leakage Resilience

Jonathan Katz and Vinod Vaikuntanathan

255. Simple Adaptive Oblivious Transfer Without Random Oracle

Kaoru Kurosawa and Ryo Nojima

256. Improved Non-Committing Encryption with Applications to Adaptively Secure Protocols

Seung Geol Choi, Dana Dachman-Soled, Tal Malkin and Hoeteck Wee

262. Secure Multi-party Computation Minimizing Online Rounds

Seung Geol Choi, Ariel Elbaz, Tal Malkin and Moti Yung

268. Group Encryption: Non-Interactive Realization in the Standard Model

Julien Cathalo, Benoît Libert and Moti Yung

272. Foundations of Non-Malleable Hash and One-Way Functions

Alexandra Boldyreva, David Cash, Marc Fischlin and Bogdan Warinschi

274. Proofs of Storage from Homomorphic Identification Protocols

Giuseppe Ateniese, Seny Kamara and Jonathan Katz

276. Hierarchical Predicate Encryption for Inner-Products

Tatsuaki Okamoto and Katsuyuki Takashima

289. A Framework for Universally Composable Non-Committing Blind Signatures

Masayuki Abe and Miyako Ohkubo

296. How to Confirm Cryptosystems Security: The Original Merkle-Damgård is Still Alive!

Yusuke Naito, Kazuki Yoneyama, Lei Wang and Kazuo Ohta

303. Efficient Public Key Encryption Based on Ideal Lattices

Damien Stehlé, Ron Steinfeld, Keisuke Tanaka and Keita Xagawa

322. Cryptanalysis of the Square Cryptosystems

Olivier Billet and Gilles Macario-Rat

325. Cascade Encryption Revisited

Peter Gaži and Ueli Maurer

326. Factoring $pq^2$ with Quadratic Forms: Nice Cryptanalyses

Guilhem Castagnos, Antoine Joux, Fabien Laguillaumie and Phong Q. Nguyen

331. The Key-Dependent Attack on Block Ciphers

Xiaorui Sun and Xuejia Lai

332. On the Power of Two-Party Quantum Cryptography

Louis Salvail, Christian Schaffner and Miroslava Sotakova

343. The Intel AES Instructions Set and the SHA-3 Candidates

Ryad Benadjila, Olivier Billet, Shay Gueron and Matt Robshaw

358. MD5 is Weaker than Weak: Attacks on Concatenated Combiners

Florian Mendel, Christian Rechberger and Martin Schläffer

368. Rebound Attack on the Full LANE Compression Function

Krystian Matusiewicz, María Naya-Plasencia, Ivica Nikolić, Yu Sasaki and Martin Schläffer

370. Hedged Public-Key Encryption: How to Protect Against Bad Randomness

Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham and Scott Yilek

385. Smooth Projective Hashing and Password-Based Authenticated Key Exchange Based on Lattices

Jonathan Katz and Vinod Vaikuntanathan

404. Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?

Mathias Herrmann and Alexander May