This book constitutes the refereed proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 2000, held in Bruges, Belgium, in May 2000. The 39 revised full papers presented were carefully selected from a total of 150 submissions during a highly competitive reviewing process. The book is divided in topical sections of factoring and discrete logarithm, digital signatures, private information retrieval, key management protocols, threshold cryptography, public-key encryption, quantum cryptography, multi-party computation and information theory, zero-knowledge, symmetric cryptography, Boolean functions and hardware, voting schemes, and stream ciphers and block ciphers.
Author(s): Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter Lioen, Peter L. Montgomery (auth.), Bart Preneel (eds.)
Series: Lecture Notes in Computer Science 1807
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2000
Language: English
Pages: 612
Tags: Data Encryption; Algorithm Analysis and Problem Complexity; Operating Systems; Computer Communication Networks; Computational Mathematics and Numerical Analysis
Factorization of a 512-Bit RSA Modulus....Pages 1-18
An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves....Pages 19-34
Analysis and Optimization of the TWINKLE Factoring Device....Pages 35-52
Noisy Polynomial Interpolation and Noisy Chinese Remaindering....Pages 53-69
A Chosen Messages Attack on the ISO/IEC 9796-1 Signature Scheme....Pages 70-80
Cryptanalysis of Countermeasures Proposed for Repairing ISO 9796-1....Pages 81-90
Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme....Pages 91-101
On the Security of 3GPP Networks....Pages 102-103
One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval....Pages 104-121
Single Database Private Information Retrieval Implies Oblivious Transfer....Pages 122-138
Authenticated Key Exchange Secure against Dictionary Attacks....Pages 139-155
Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman....Pages 156-171
Fair Encryption of RSA Keys....Pages 172-189
Computing Inverses over a Shared Secret Modulus....Pages 190-206
Practical Threshold Signatures....Pages 207-220
Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures....Pages 221-242
Confirmer Signature Schemes Secure against Adaptive Adversaries....Pages 243-258
Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements....Pages 259-274
Using Hash Functions as a Hedge against Chosen Ciphertext Attack....Pages 275-288
Security Aspects of Practical Quantum Cryptography....Pages 289-299
Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation....Pages 300-315
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme....Pages 316-334
Minimal-Latency Secure Function Evaluation....Pages 335-350
Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free....Pages 351-368
New Attacks on PKCS#1 v1.5 Encryption....Pages 369-381
A NICE Cryptanalysis....Pages 382-391
Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations....Pages 392-407
Cryptanalysis of Patarin’s 2-Round Public Key System with S Boxes (2R)....Pages 408-416
Colossus and the German Lorenz Cipher — Code Breaking in WW II....Pages 417-417
Efficient Concurrent Zero-Knowledge in the Auxiliary String Model....Pages 418-430
Efficient Proofs that a Committed Number Lies in an Interval....Pages 431-444
A Composition Theorem for Universal One-Way Hash Functions....Pages 445-452
Exposure-Resilient Functions and All-or-Nothing Transforms....Pages 453-469
The Sum of PRPs Is a Secure PRF....Pages 470-484
Construction of Nonlinear Boolean Functions with Important Cryptographic Properties....Pages 485-506
Propagation Characteristics and Correlation-Immunity of Highly Nonlinear Boolean Functions....Pages 507-522
Cox-Rower Architecture for Fast Parallel Montgomery Multiplication....Pages 523-538
Efficient Receipt-Free Voting Based on Homomorphic Encryption....Pages 539-556
How to Break a Practical MIX and Design a New One....Pages 557-572
Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5....Pages 573-588
Advanced Slide Attacks....Pages 589-606
