PROGRAM

Sunday, December 7

17.00-20.00: Registration
18.00-20.00: Welcome Reception, Hilton on the Park Hotel

08.00: Registration
09.00-09.10: Welcome and Opening Remarks
09.10-10.25: Session 1 -- MULTI-PARTY COMPUTATIONS (Chair: Xuejia Lai)

MPC vs. SFE: Unconditional and Computational Security
Martin Hirt, Ueli Maurer, and Vassilis Zikas (ETH Zurich, Switzerland)
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
Zhifang Zhang, Mulan Liu, Yeow Meng Chee, San Ling, Huaxiong Wang (Key Laboratory of Mathematics Mechanization, AMSS, CAS, China and Nanyang Technological University, Singapore)
Graph Design for Secure Multiparty Computation over Non-Abelian Groups
Xiaoming Sun, Andrew Chi-Chih Yao and Christophe Tartary (Tsinghua University,China -all authors, Nanyang Technological University,Singapore-last author)

10.25-11.00: Morning Tea
11.00-12.00: Invited Talk I (Chair: Josef Pieprzyk)

Some Perspectives on Complexity-Based Cryptography
Andrew Chi-Chih Yao (Tsinghua University,China)

12.00-14.00: Lunch
14.00-15.40: Session 2 -- CRYPTOGRAPHIC PROTOCOLS I (Chair: Colin Boyd)

A modular security analysis of the TLS handshake protocol
P. Morrissey, N.P. Smart and B. Warinschi (University of Bristol)
Ambiguous Optimistic Fair Exchange
Qiong Huang, Guomin Yang, Duncan S. Wong (City University of Hong Kong) and Willy Susilo (University of Wollongong, Australia)
Compact Proofs of Retrievability
Hovav Shacham (University of California at San Diego) and Brent Waters (University of Texas at Austin)
Universally Composable Adaptive Oblivious Transfer
Matthew Green and Susan Hohenberger (Johns Hopkins University)

15.40-16.00: Afternoon Tea
16.00-17.15: Session 3 -- CRYPTOGRAPHIC HASH FUNCION I (Chair:Bart Preneel)

Hash Functions from Sigma Protocols and Improvements to VSH
Mihir Bellare and Todor Ristov (UCSD)
Slide Attacks on a Class of Hash Functions
Michael Gorski (Bauhaus-University of Weimar), Stefan Lucks (Bauhaus-University of Weimar) and Thomas Peyrin (Orange Labs and University of Versailles)
Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography
Ueli Maurer and Stefano Tessaro (ETH Zurich, Switzerland)

18.30: Asiacrypt Steering Committee Meeting

08.30: Registration
09.00-10.40: Session 4 -- CRYPTOGRAPHIC PROTOCOLS II (Chair:Huaxiong Wang)

On the Security of HB# Against a Man-in-the-Middle Attack
Khaled Ouafi, Raphael Overbeck and Serge Vaudenay (LASEC, Ecole Polytechnique Federale de Lausanne, Switzerland)
A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting
Jason Keller (Rutgers University) and Joe Kilian (PNYLAB LLC and Rutgers University)
Towards Robust Computation on Encrypted data
Manoj Prabhakaran and Mike Rosulek (University of Illinois Urbana-Champaign, US)
Efficient Protocols for Set Membership and Range Proofs
Jan Camenisch (IBM Zurich Research Laboratory), Rafik Chaabouni (EPFL) Abhi Shelat (University of Virginia)

10.40-11.10: Morning Tea
11.10-12.10: Invited Talk II (Chair:Tsutomu Matsumoto)

12.10-13.30: Lunch
13.30-19.00: Excursion
19.00-22.00: Rump Session (Chair: Ed Dawson)

08.30: Registration
09.00-10.40: Session 5 -- PUBLIC-KEY CRYPTOGRAPHY I (Chair:Josh Benaloh)

Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
Goichiro Hanaoka (AIST) and Kaoru Kurosawa (Ibaraki University)
Twisted Edwards Curves Revisited
Huseyin Hisil, Kenneth Koon-Ho Wong, Gary Carter and Ed Dawson (QUT,Australia)
On the Validity of the Phi-Hiding Assumption in Cryptographic Protocols
Christian Schridde (University of Marburg, Germany) and Bernd Freisleben (University of Marburg, Germany)
Chosen Ciphertext Security with Optimal Ciphertext Overhead
Masayuki Abe (NTT, Japan), Eike Kiltz (CWI, The Netherlands) Tatsuaki Okamoto (NTT, Japan)

10.40-11.00: Morning Tea
11.00-12.15: Session 6 -- CRYPTOGRAPHIC HASH FUNCION II (Chair:Rei Safavi-Naini)

Preimage Attacks on 3, 4, and 5-pass HAVAL
Yu Sasaki and Kazumaro Aoki (NTT Corporation, Japan)
How to Fill Up Merkle-Damgard Hash Functions
Kan Yasuda (NTT Corporation)
Limits of Constructive Security Proofs
Michael Backes and Dominique Unruh (Saarland University)

12.15-14.00: Lunch
14.00-15.15: Session 7 -- LATTICE-BASED CRYPTOGRAPHY (Chair:Ron Steinfeld)

Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
Akinori Kawachi, Keisuke Tanaka and Keita Xagawa (Tokyo Institute of Technology)
Rigorous and Efficient Short Lattice Vectors Enumeration
Xavier Pujol (ENS Lyon) and Damien Stehle(CNRS/Universities of Lyon, Macquarie and Sydney/ENS Lyon/INRIA)
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
Mathias Herrmann and Alexander May (Horst Gortz Institute for IT-Security, Ruhr-Universitat Bochum)

15.15-15.45: Afternoon Tea
15.45-16.35: Session 8 -- PRIVATE-KEY CRYPTOGRAPHY (Chair:Mitsuru Matsui)

An infinite class of balanced functions with optimum algebraic immunity, good immunity to fast algebraic attacks and good nonlinearity
Claude Carlet and Keqin Feng (University of Paris 8, France and Tsinghua University, Beijing, China)
An Improved Impossible Differential Attack on MISTY1
Orr Dunkelman (ENS, France) and Nathan Keller (Hebrew University, Israel)

16.45-17:30: IACR Membership Meeting
19.00-22:30: Conference Dinner at Melbourne Aquarium, King & Flinders Streets, Melbourne

08.30: Registration
09.00-10.40: Session 9 -- PUBLIC-KEY CRYPTOGRAPHY II (Chair:Kaoru Kurosawa)

Generalized Identify Based and Broadcast Encryption Schemes
Dan Boneh and Mike Hamburg (Stanford University)
Speeding up the Pollard Rho Method on Prime Fields
Jung Hee Cheon, Jin Hong and Minkyu Kim (Seoul National University)
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Andy Rupp (Ruhr-University Bochum), Gregor Leander (Ruhr-University Bochum and Technical University of Denmark), Endre Bangerter (Bern University of Applied Sciences), Ahmad-Reza Sadeghi (Ruhr-University Bochum), and Alexander W. Dent (Royal Holloway, University of London)
OAEP is Secure under Key-Dependent Messages
Michael Backes, Markus Durmuth and Dominique Unruh (Saarland University)

10.40-11.10: Morning Tea
11.10-12.25: Session 10 -- ANALYSIS OF STREAM CIPHERS (Chair:Claude Carlet)

Cryptanalysis of Sosemanuk and SNOW 2.0 Using Linear Masks
Jung-Keun Lee, Dong Hoon Lee, Sangwoo Park (ETRI Network & Communication Security Division, Korea)
A New Attack on the LEX Stream Cipher
Orr Dunkelman (ENS, France) and Nathan Keller (Hebrew University, Israel)
Breaking the F-FCSR-H Stream Cipher in Real Time
Martin Hell and Thomas Johansson (Lund University, Sweden)

12.25-12.30: Closing Remarks
12.30-14.00: Lunch