Accepted Papers
BLOCK CIPHERS:
- Essential Algebraic Structure Within the AES
S. Murphy and M.J.B. Robshaw
(Information Security Group, Royal Holloway, University of London)
- Blockwise Adaptive Attackers - Revisiting the (in)security of
some provably secure encryption modes: CBC, GEM, IACBC
Antoine Joux, Gwenaëlle Martinet and Frédéric Valette (DCSSI Crypto Lab)
- Tweakable Block Ciphers
Moses Liskov and Ronald L. Rivest
(MIT Laboratory for Computer Science)
MULTI-USER ORIENTED CRYPTOSYSTEMS:
- The LSD Broadcast Encryption Scheme
Dani Halevi and Adi Shamir (The Weizmann Institute of Science)
- Dynamic Accumulators and Application to Efficient Revocation of Anonymous
Credentials
Jan Camenisch (IBM Research) and Anna Lysyanskaya (MIT)
FOUNDATIONS AND METHODOLOGY:
- Provably Secure Steganography
Nick Hopper, John Langford, Luis von Ahn (Carnegie Mellon University)
- Flaws in applying proof methodologies to signature schemes
Jacques Stern, David Pointcheval (ENS)
John Malone-Lee and Nigel Smart (University of Bristol)
- Separating random oracle proofs from complexity theoretic proofs:
The non-committing encryption case
Jesper Buus Nielsen (BRICS)
SECURITY OF PRACTICAL PROTOCOLS:
- On the Security of RSA Encryption in TLS
Jakob Jonsson and Burton S. Kaliski Jr. (RSA Laboratories)
- Security Analysis of IKE's Signature-Based Key-Exchange Protocol
Ran Canetti (IBM Research) and Hugo Krawczyk (Technion)
- Security of GQ and Schnorr Identification Schemes under Active and
Concurrent Attacks
Mihir Bellare and Adriana Palacio
(University of California San Diego)
SECURE MULTIPARTY COMPUTATIONS:
- On 2-Round Secure Multiparty Computations
Rosario Gennaro (IBM Research), Yuval Ishai (DIMACS),
Eyal Kushilevitz (Technion) and Tal Rabin (IBM Research).
- Private Computation -- k-connected versus 1-connected Networks
Markus Bl"{a}ser, Andreas Jakoby, Maciej Li'{s}kiewicz, and Bodo Siebert
(Institut f"ur Theoretische Informatik, Universit"at zu L"ubeck)
PUBLIC KEY ENCRYPTION:
- Analysis and Improvements of NTRU Encryption Paddings
Phong Q. Nguyen and David Pointcheval (CNRS/ Ecole normale superieure)
- Universal Padding Schemes for RSA
Jean-Sébastien Coron, Marc Joye, David Naccache, and Pascal Paillier
(Gemplus Card International)
- Cryptanalysis of Unbalanced RSA with Small CRT-Exponent
Alexander May (Paderborn University)
INFORMATION THEORY AND SECRET SHARING:
- Hyper-Encryption against Space-Bounded Adversary from On-Line Strong
Extractors
Chi-Jen Lu (Academia Sinica)
- Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups
Ronald Cramer and Serge Fehr (University of Aarhus, Denmark)
CIPHER DESIGN AND ANALYSIS:
- A Generalized Birthday Problem
David Wagner (University of California at Berkeley)
- (Not So) Random Shuffles of RC4
Ilya Mironov (Stanford University)
- Shannon analysis of the block-cipher -based hash-function constructions
from PGV
John Black (University of Nevada, Reno), Phillip Rogaway (UC Davis),
and Thomas Shrimpton (UC Davis)
ELLIPTIC CURVES CRYPTOGRAPHY:
- Supersingular abelian varieties in cryptology
K. Rubin (Stanford University) and A. Silverberg (Ohio State University)
- Efficient Algorithms for Pairing-Based Cryptosystems
Paulo S. L. M. Barreto (Escola Politecnica, Universidade de Sao Paulo),
Hae Y. Kim (Escola Politecnica, Universidade de Sao Paulo),
Ben Lynn, (Stanford University)
and Michael Scott (Dublin City University)
- Computing zeta functions of hyperelliptic curves over finite fields of
characteristic 2
Frederik Vercauteren (University Bristol)
DISTRIBUTED CRYPTOSYSTEMS:
- Efficient Computation Modulo a Shared Secret with Application to the
Generation of Shared Safe-Prime Products
Joy Algesheimer, Jan Camenisch and Victor Shoup (IBM Research)
- A Threshold Pseudorandom Function Construction and Its Applications
Jesper Buus Nielsen (BRICS)
- Threshold Password-Authenticated Key Exchange
Philip MacKenzie (Lucent Technologies),
Thomas Shrimpton (UC Davis), and Markus Jakobsson (RSA Laboratories)
PSEUDORANDOMNESS AND APPLICATIONS:
- Hidden Number Problem with the Trace and Bit Security of XTR and LUC
Wen-Ching W. Li (Penn State University), Mats N"{a}slund (Ericsson
Research), and Igor E. Shparlinski (Macquarie University)
- Expanding Pseudorandom Functions; or: From Known-Plaintext Security
to Chosen-Plaintext Security
Ivan Damgård and Jesper Buus Nielsen (BRICS)
VARIATIONS ON SIGNATURE AND AUTHENTICATION:
- Threshold Ring Signatures for Ad-hoc Groups
Emmanuel Bresson (ENS) and Jacques Stern (ENS) and Michael Szydlo (RSA)
- Deniable Ring Authentication
Moni Naor (Weizmann Institute of Science)
- Intrusion-Resilient Signatures
Gene Itkis and Leonid Reyzin (Boston University)
STREAM CIPHERS AND BOOLEAN FUNCTIONS:
- Cryptanalysis of stream ciphers with linear masking
Don Coppersmith and Shai Halevi and Charanjit Jutla (IBM)
- The Filter-Combiner Model for Memoryless Synchronous Stream Ciphers
Palash Sarkar (Indian Statistical Institute)
- A larger Class of Cryptographic Boolean Functions via a Study of the
Maiorana-McFarland Constructions
Claude Carlet (INRIA)
COMMITMENT SCHEMES:
- Linear VSS and Distributed Commitment Schemes Based on Secret Sharing and
Pairwise Checks
Serge Fehr (BRICS) and Ueli Maurer (ETH Switzerland)
- Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes
with Constant Expansion Factor
Ivan Damgård and Jesper Buus Nielsen (BRICS)
SIGNATURES SCHEMES:
- Unique signatures and verifiable random functions from the dh-ddh separation
Anna Lysyanskaya (MIT Laboratory for Computer Science)
- Security Proof for Partial-Domain Hash Signature Schemes
Jean-Sébastien Coron (Gemplus Card International)
----------------------------------------------------------------------
In addition, the program will present two plenary talks:
- The IACR Distinguished Lecture
by David Chaum
-Invited Talk: "New Directions in Quantum Cryptographic Protocols"
by Andrew Yao (Princeton)
---------------------------------------------------------------------