Advances in Cryptology - EUROCRYPT 2000: International Conference on the Theory and Application of Cryptographic Techniques Bruges, Belgium, May 14-18, 2000 Proceedings

Overview

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 prools, threshold cryptography, public-key ...

See more details below
Paperback (2000)
$128.13
BN.com price
(Save 7%)$139.00 List Price
Other sellers (Paperback)
  • All (12) from $2.24   
  • New (4) from $95.55   
  • Used (8) from $2.24   
Sending request ...

Overview

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 prools, 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.

Read More Show Less

Product Details

  • ISBN-13: 9783540675174
  • Publisher: Springer-Verlag New York, LLC
  • Publication date: 6/8/2000
  • Series: Lecture Notes in Computer Science Series , #1807
  • Edition description: 2000
  • Edition number: 1
  • Pages: 621
  • Product dimensions: 9.21 (w) x 6.14 (h) x 1.31 (d)

Table of Contents

Factorization of a 512-Bit RSA Modulus 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 ISO/IEC 9796-1 Signature Scheme 70
Cryptanalysis of Countermeasures Proposed for Repairing ISO 9796-1 81
Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme 91
On the Security of 3GPP Networks 102
One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval 104
Single Database Private Information Retrieval Implies Oblivious Transfer 122
Authenticated Key Exchange Secure against Dictionary Attacks 139
Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman 156
Fair Encryption of RSA Keys 172
Computing Inverses over a Shared Secret Modulus 190
Practical Threshold Signatures 207
Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures 221
Confirmer Signature Schemes Secure against Adaptive Adversaries 243
Public-Key Encryption in a Multi-user Setting: 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 One-Way Permutation 300
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme 316
Minimal-Latency Secure Function Evaluation 335
Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free 351
New Attacks on PKCS#1 v1.5 Encryption 369
A NICE Cryptanalysis 382
Efficient Algorithms for Solving Overdefined systems of Multivariate Polynomial Equations 392
Cryptanalysis of Patarin's 2-Round Public Key system with S Boxes (2R) 408
Colossus and the German Lorenz Cipher - Code Breaking in WW II 417
Efficient Concurrent Zero-Knowledge in the Auxiliary String Model 418
Efficient Proofs that a Committed Number Lies in an Interval 431
A Composition Theorem for Universal One-Way Hash Functions 445
Exposure-Resilient Functions and All-Or-Nothing Transforms 453
The Sum of PRPs Is a Secure PRF 470
Construction of Nonlinear Boolean Functions with Important Cryptographic Properties 485
Propagation Characteristics and Correlation-Immunity of Highly Nonlinear Boolean Functions 507
Cox-Rower Architecture for Fast Parallel Montgomery Multiplication 523
Efficient Receipt-Free Voting Based on Homomorphic Encryption 539
How to Break a Practical MIX and Design a New One 557
Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5 573
Advanced Slide Attacks 589
Author Index 607
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)