## Advances in Cryptology - EUROCRYPT 2000: International Conference on the Theory and Application of Cryptographic Techniques Bruges, Belgium, May 14-18, 2000 Proceedings (Google eBook)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. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

1 | |

An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves | 19 |

Analysis and Optimization of the TWINKLE Factoring Device | 35 |

Noisy Polynomial Interpolation and Noisy Chinese Remaindering | 53 |

A Chosen Messages Attack on the ISOIEC 97961 Signature Scheme | 70 |

Cryptanalysis of Countermeasures Proposed for Repairing ISO 97961 | 81 |

Security Analysis of the GennaroHaleviRabin Signature Scheme | 91 |

On the Security of 3GPP Networks | 102 |

MinimalLatency Secure Function Evaluation | 335 |

From Weak to Strong Secrecy for Free | 351 |

New Attacks on PKCS1 v15 Encryption | 369 |

A NICE Cryptanalysis | 382 |

Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations | 392 |

Cryptanalysis of Patarins 2Round Public Key System with S Boxes 2R | 408 |

Colossus and the German Lorenz Cipher Code Breaking in WW II | 417 |

Efficient Concurrent ZeroKnowledge in the Auxiliary String Model | 418 |

OneWay Trapdoor Permutations Are Sufficient for Nontrivial SingleServer Private Information Retrieval | 104 |

Single Database Private Information Retrieval Implies Oblivious Transfer | 122 |

Authenticated Key Exchange Secure against Dictionary Attacks | 139 |

Provably Secure PasswordAuthenticated Key Exchange Using DiffieHellman | 156 |

Fair Encryption of RSA Keys | 172 |

Computing Inverses over a Shared Secret Modulus | 190 |

Practical Threshold Signatures | 207 |

Introducing Concurrency Removing Erasures Extended Abstract | 221 |

Confirmer Signature Schemes Secure against Adaptive Adversaries Extended Abstract | 243 |

Security Proofs and Improvements | 259 |

Using Hash Functions as a Hedge against Chosen Ciphertext Attack | 275 |

Security Aspects of Practical Quantum Cryptography | 289 |

Perfectly Concealing Quantum Bit Commitment from any Quantum OneWay Permutation | 300 |

General Secure Multiparty Computation from any Linear SecretSharing Scheme | 316 |

Efficient Proofs that a Committed Number Lies in an Interval | 431 |

A Composition Theorem for Universal OneWay Hash Functions | 445 |

ExposureResilient Functions and AllorNothing Transforms | 453 |

The Sum of PRPs Is a Secure PRF | 470 |

Construction of Nonlinear Boolean Functions with Important Cryptographic Properties | 485 |

Propagation Characteristics and CorrelationImmunity of Highly Nonlinear Boolean Functions | 507 |

CoxRower Architecture for Fast Parallel Montgomery Multiplication | 523 |

Efficient ReceiptFree Voting Based on Homomorphic Encryption | 539 |

How to Break a Practical MIX and Design a New One | 557 |

Improved Fast Correlation Attacks Using ParityCheck Equations of Weight 4 and 5 | 573 |

Advanced Slide Attacks | 589 |

607 | |

### Common terms and phrases

Advances in Cryptology adversary algebraic algorithm Alice Alice and Bob apply assume assumption bent functions bits Boolean function choose chosen ciphertext chosen ciphertext attack cipher commitment scheme communication complexity Computer Science confirmer signature construction Crypto cryptography Cryptology cryptosystem database decryption defined definition denote discrete logarithm distribution efficient encryption scheme equations EUROCRYPT EUROCRYPT 2000 exists factor hash function input integer key exchange lattice Lecture Notes Lemma linear LNCS MIX server modulus multiplication nonlinearity Notes in Computer Oblivious Transfer obtain one-way functions output password permutation plaintext players prime Private Information Retrieval probability problem Proc protocol prove public key quantum query random oracle model receipt-free result round secret key secret sharing Section security parameter sieving signature scheme simulator Springer-Verlag step string techniques Theorem threshold trapdoor variables vector verifier vote voter zero-knowledge zero-knowledge proofs