Publications of Eurocrypt 2000

Page	Title
1-18	Factorization of a 512-Bit RSA Modulus
19-34	An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves
35-52	Analysis and Optimization of the TWINKLE Factoring Device
53-69	Noisy Polynomial Interpolation and Noisy Chinese Remaindering
70-80	A Chosen Messages Attack on the ISO/IEC 9796-1 Signature Scheme
81-90	Cryptanalysis of Countermeasures Proposed for Repairing ISO 9796-1
91-101	Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme
102-103	On the Security of 3GPP Networks
104-121	One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval
122-138	Single Database Private Information Retrieval Implies Oblivious Transfer
139-155	Authenticated Key Exchange Secure against Dictionary Attacks
156-171	Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman
172-189	Fair Encryption of RSA Keys
190-206	Computing Inverses over a Shared Secret Modulus
207-220	Practical Threshold Signatures
221-242	Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures
243-258	Confirmer Signature Schemes Secure against Adaptive Adversaries
259-274	Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements
275-288	Using Hash Functions as a Hedge against Chosen Ciphertext Attack
289-299	Security Aspects of Practical Quantum Cryptography
300-315	Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation
316-334	General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
335-350	Minimal-Latency Secure Function Evaluation
351-368	Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free
369-381	New Attacks on PKCS#1 v1.5 Encryption
382-391	A NICE Cryptanalysis
392-407	Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations
408-416	Cryptanalysis of Patarin's 2-Round Public Key System with S Boxes (2R)
417	Colossus and the German Lorenz Cipher - Code Breaking in WW II
418-430	Efficient Concurrent Zero-Knowledge in the Auxiliary String Model
431-444	Efficient Proofs that a Committed Number Lies in an Interval
445-452	A Composition Theorem for Universal One-Way Hash Functions
453-469	Exposure-Resilient Functions and All-or-Nothing Transforms
470-484	The Sum of PRPs Is a Secure PRF
485-506	Construction of Nonlinear Boolean Functions with Important Cryptographic Properties
507-522	Propagation Characteristics and Correlation-Immunity of Highly Nonlinear Boolean Functions
523-538	Cox-Rower Architecture for Fast Parallel Montgomery Multiplication
539-556	Efficient Receipt-Free Voting Based on Homomorphic Encryption
557-572	How to Break a Practical MIX and Design a New One
573-588	Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5
589-606	Advanced Slide Attacks