Publications of crypto 2003

Preface and frontmatter

Page	Title
1-26	Factoring Large Number with the TWIRL Device
27-43	New Partial Key Exposure Attacks on RSA
44-60	Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases
61-77	On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model
78-95	Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret
96-109	On Cryptographic Assumptions and Challenges
110-125	Scalable Protocols for Authenticated Group Key Exchange
126-144	Practical Verifiable Encryption and Decryption of Discrete Logarithms
145-161	Extending Oblivious Transfers Efficiently
162-175	Algebraic Attacks on Combiners with Memory
176-194	Fast Algebraic Attacks on Stream Ciphers with Linear Feedback
195-211	Cryptanalysis of SAFER++
212-225	A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem
226-246	The Impact of Decryption Failures on the Security of NTRU Encryption
247-264	Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption
265-281	Universal Composition with Joint State
282-298	Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More
299-315	Derandomization in Cryptography
316-337	On Deniability in the Common Reference String and Random Oracle Model
338-348	Primality Proving via One Round in ECPP and One Iteration in AKS
349-365	Torus-Based Cryptography
366-382	Efficient Universal Padding Techniques for Multiplicative Trapdoor One-Way Permutation
383-399	Multipurpose Identity-Based Signcryption (A Swiss Army Knife for Identity-Based Cryptography)
400-425	SIGMA: The 'SIGn-and-MAc' Approach to Authenticated Diffie-Hellman and Its Use in the IKE-Protocols
426-444	On Memory-Bound Functions for Fighting Spam
445-462	Lower and Upper Bounds on Obtaining History Independence
463-481	Private Circuits: Securing Hardware against Probing Attacks
482-499	A Tweakable Enciphering Mode
500-512	A Message Authentication Code Based on Unimodular Matrix Groups
513-529	Luby-Rackoff: 7 Rounds Are Enough for 2n(1-epsilon)Security
530-547	Weak Key Authenticity and the Computational Completeness of Formal Encryption
548-564	Plaintext Awareness via Key Registration
565-582	Relaxing Chosen-Ciphertext Security
583-599	Password Interception in a SSL/TLS Channel
600-616	Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication
617-630	Making a Faster Cryptanalytic Time-Memory Trade-Off