List of Accepted Papers - Sessionwise
Algebra and Number Theory
Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
Pascal Paillier, Damien Vergnaud
Do All Elliptic Curves of the Same Order Have the Same Difficulty of
Discrete Log?
David Jao, Stephen D. Miller, Ramarathnam Venkatesan
Adapting Density Attacks to Low-Weight Knapsacks
Phong Q. Nguyên, Jacques Stern
Efficient and Secure Elliptic Curve Point Multiplication using
Double-Base Chains
Vassil Dimitrov, Laurent Imbert, Pradeep Kumar Mishra
Multiparty Computation
Upper Bounds on the Communication Complexity of Optimally Resilient
Cryptographic Multiparty Computation
Martin Hirt, Jesper Buus Nielsen
Graph-Decomposition-Based Frameworks for Subset-Cover Broadcast En-
cryption and Efficient Instantiations
Nuttapong Attrapadung, Hideki Imai
Revealing Additional Information in Two-Party Computations
Andreas Jakoby, Maciej Liskiewicz
Zero Knowledge and Secret Sharing
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Com-
putation
Vladimir Kolesnikov
Parallel Multi-Party Computation from Linear Multi-Secret Sharing
Schemes
Zhifang Zhang, Mulan Liu, Liangliang Xiao
Updatable Zero-Knowledge Databases
Moses Liskov
Information and Quantum Theory
Simple and Tight Bounds for Information Reconciliation and Privacy
Amplification
Renato Renner, Stefan Wolf
Quantum Anonymous Transmissions
Matthias Christandl, Stephanie Wehner
Privacy and Anonymity
Privacy-Preserving Graph Algorithms in the Semi-Honest Model
Justin Brickell, Vitaly Shmatikov
Spreading Alerts Quietly and the Subgroup Escape Problem
James Aspnes, Zoë Diamadi, Kristian Gjøsteen, René
Peralta, Aleksandr Yampolskiy
A Sender Verifiable Mix-Net and a New Proof of a Shuffle
Douglas Wikström
Universally Anonymizable Public-Key Encryption
Ryotaro Hayashi, Keisuke Tanaka
Cryptanalytic Techniques
Fast Computation of Large Distributions and Its Cryptographic Applications
Alexander Maximov, Thomas Johansson
An Analysis of the XSL Algorithm
Carlos Cid, Gaëtan Leurent
New Applications of Time Memory Data Tradeoffs
Jin Hong, Palash Sarkar
Stream Cipher Cryptanalysis
Linear Cryptanalysis of the TSC Family of Stream Ciphers
Frédéric Muller, Thomas Peyrin
A Practical Attack on the Fixed RC4 in the WEP Mode
Itsik Mantin
A Near-Practical Attack against B mode of HBB
Joydip Mitra
Block Ciphers and Hash Functions
New Improvements of Davies-Murphy Cryptanalysis
Sebastien Kunz-Jacques, Frédéric Muller
A Related-Key Rectangle Attack on the Full KASUMI
Eli Biham, Orr Dunkelman, Nathan Keller
Some Attacks Against a Double Length Hash Proposal
Lars R. Knudsen, Frédéric Muller
A Failure-Friendly Design Principle for Hash Functions
Stefan Lucks
Bilinear Maps
Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its Application
Yumiko Hanaoka, Goichiro Hanaoka, Junji Shikata, Hideki Imai
Efficient and Provably-Secure Identity-Based Signatures and Signcryption
from Bilinear Maps
Paulo S. L. M. Barreto, Benoît Libert, Noel McCullagh, Jean-Jacques
Quisquater
Verifier-Local Revocation Group Signature Schemes with
Backward Un-linkability from Bilinear Maps
Toru Nakanishi, Nobuo Funabiki
Key Agreement
Modular Security Proofs for Key Agreement Protocols
Caroline Kudla, Kenneth G. Paterson
A Simple Threshold Authenticated Key Exchange from Short Secrets
Michel Abdalla, Olivier Chevassut, Pierre-Alain Fouque, David Pointcheval
Examining Indistinguishability-Based Proof Models for Key Establishment
Protocols
Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchcock
Provable Security
Server-Aided Verification: Theory and Practice
Marc Girault, David Lefranc
Errors in Computational Complexity Proofs for Protocols
Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchcock
Signatures
Universal Designated Verifier Signature Proof
Joonsang Baek, Reihaneh Safavi-Naini, Willy Susilo
Efficient Designated Confirmer Signatures Without Random Oracles or
General Zero-Knowledge Proofs
Craig Gentry, David Molnar, Zulfikar Ramzan
Universally Convertible Directed Signatures
Fabien Laguillaumie, Pascal Paillier, Damien Vergnaud