LIST OF ACCEPTED PAPERS

PROTOCOLS

A modular security analysis of the TLS handshake protocol
P. Morrissey, N.P. Smart and B. Warinschi (Computer Science Dept, University of Bristol)
Ambiguous Optimistic Fair Exchange
Qiong Huang, Guomin Yang, Duncan S. Wong (City University of Hong Kong, Hong Kong, China) 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)
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)
Universally Composable Adaptive Oblivious Transfer
Matthew Green and Susan Hohenberger (Johns Hopkins University)
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) - conditionally accept (shepherded)
Efficient Protocols for Set Membership and Range Proofs
Jan Camenisch (IBM Zurich Research Laboratory), Rafik Chaabouni (EPFL) Abhi Shelat (University of Virginia)

Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
Goichiro Hanaoka (AIST) and Kaoru Kurosawa (Ibaraki University)
An Intersection Form for Twisted Edwards Curves
Huseyin Hisil, Kenneth Koon-Ho Wong, Gary Carter, and Ed Dawson (QUT) - conditionally accept (shepherded)
On the Validity of the Phi-Hiding Assumption in Cryptographic Protocols
Christian Schridde (University of Marburg, Germany) and Bernd Freisleben (University of Marburg, Germany) - conditionally accept (shepherded)
CCA-Security with Optimal Ciphertext Overhead
Masayuki Abe (NTT, Japan), Eike Kiltz (CWI, The Netherlands) Tatsuaki Okamoto (NTT, Japan)
Generalized Identity-Based and Broadcast Encryption Systems Motivated by Secure Email
Dan Boneh and Mike Hamburg (Stanford University)
Speeding up Pollard Rho Method on Prime Fields
Jung Hee Cheon (Seoul National University), Jin Hong (Seoul National University), 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 and Markus Durmuth and Dominique Unruh (Saarland University)

Sigma Hash Functions
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 in Iterated MACs
Ueli Maurer and Stefano Tessaro (Department of Computer Science, ETH Zurich, Switzerland)
Preimage Attacks on 3, 4, and 5-pass HAVAL
Yu Sasaki and Kazumaro Aoki (NTT Corporation, Japan)
How to Fill Up Merkle-Damg{\aa}rd Hash Functions
Kan Yasuda (NTT Corporation)
Limits of Constructive Security Proofs
Michael Backes and Dominique Unruh (Saarland University)

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

MPC vs. SFE: Unconditional and Computational Security
Martin Hirt, Ueli Maurer, and Vassilis Zikas (Department of Computer Science, ETH Zurich)
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 Institute for Theoretical Computer Sciences, Tsinghua University, Beijing, P. R. China (all authors) - School of Physical and Mathematical Sciences, Division of Mathematical Sciences, Nanyang Technological University, Singapore (last author)

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)

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 Univeristy, Israel)