International Association for Cryptologic Research

Publications by Conference

Advances in Cryptology - EUROCRYPT 2007, 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, Proceedings

Preface and frontmatter

Page	Title
1-22	Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities
23-33	Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don't Exist
34-51	The Collision Intractability of MDC-2 in the Ideal-Cipher Model
52-78	An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
79-96	Revisiting the Efficiency of Malicious Two-Party Computation
97-114	Efficient Two-Party Secure Computation on Committed Inputs
115-128	Universally Composable Multi-party Computation Using Tamper-Proof Hardware
129-147	Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
148-168	Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
169-186	Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
187-209	Zero Knowledge and Soundness Are Symmetric
210-227	Mesh Signatures
228-245	The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks
246-263	Batch Verification of Short Signatures
264-275	Cryptanalysis of SFLASH with Slightly Modified Parameters
276-290	Differential Cryptanalysis of the Stream Ciphers Py, Py6 and Pypy
291-310	Secure Computation from Random Error Correcting Codes
311-328	Round-Efficient Secure Computation in Point-to-Point Networks
329-346	Atomic Secure Multi-party Multiplication with Low Communication
347-360	Cryptanalysis of the Sidelnikov Cryptosystem
361-378	Toward a Rigorous Variation of Coppersmith's Algorithm on Three Variables
379-393	An L (1/3 + epsilon ) Algorithm for the Discrete Logarithm Problem for Low Degree Curves
394-411	General Ad Hoc Encryption from Exponent Inversion IBE
412-429	Non-interactive Proofs for Integer Multiplication
430-447	Ate Pairing on Hyperelliptic Curves
448-465	Ideal Multipartite Secret Sharing Schemes
466-481	Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit
482-497	Divisible E-Cash Systems Can Be Truly Anonymous
498-516	A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
517-533	Range Extension for Weak PRFs; The Good, the Bad, and the Ugly
534-554	Feistel Networks Made Public, and Applications
555-572	Oblivious-Transfer Amplification
573-590	Simulatable Adaptive Oblivious Transfer