Advances in Cryptology — EUROCRYPT ’99: International Conference on the Theory and Application of Cryptographic Techniques Prague, Czech Republic, May 2–6, 1999 Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT '99, held in Prague, Czech Republic in May 1999.
The 32 revised full papers presented were carefully selected during highly competitive reviewing process. The book is divided in topical sections on cryptanalysis, hash functions, foundations, public key cryptosystems, watermarking and fingerprinting, elliptic curves, new schemes, block ciphers, distributed cryptography, tools from related areas, and broadcast and multicast.

Author(s): Dan Boneh, Glenn Durfee (auth.), Jacques Stern (eds.)
Series: Lecture Notes in Computer Science 1592
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1999

Language: English
Pages: 480
Tags: Data Encryption; Discrete Mathematics in Computer Science; Algorithm Analysis and Problem Complexity; Computer Communication Networks; Computational Mathematics and Numerical Analysis

Cryptanalysis of RSA with Private Key d Less than N 0.292 ....Pages 1-11
Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials....Pages 12-23
Software Performance of Universal Hash Functions....Pages 24-41
Lower Bounds for Oblivious Transfer Reductions....Pages 42-55
On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions....Pages 56-73
Conditional Oblivious Transfer and Timed-Release Encryption....Pages 74-89
An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)....Pages 90-106
Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes....Pages 107-122
Secure Hash-and-Sign Signatures Without the Random Oracle....Pages 123-139
A Note on the Limits of Collusion-Resistant Watermarks....Pages 140-149
Coin-Based Anonymous Fingerprinting....Pages 150-164
On the Performance of Hyperelliptic Cryptosystems....Pages 165-175
Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic....Pages 176-189
Comparing the MOV and FR Reductions in Elliptic Curve Cryptography....Pages 190-205
Unbalanced Oil and Vinegar Signature Schemes....Pages 206-222
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes....Pages 223-238
New Public Key Cryptosystems Based on the Dependent-RSA Problems....Pages 239-254
Resistance Against General Iterated Attacks....Pages 255-271
XOR and Non-XOR Differential Probabilities....Pages 272-285
S-boxes with Controllable Nonlinearity....Pages 286-294
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems....Pages 295-310
Efficient Multiparty Computations Secure Against an Adaptive Adversary....Pages 311-326
Distributed Pseudo-random Functions and KDCs....Pages 327-346
Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes....Pages 347-362
Cryptanalysis of an Identification Scheme Based on the Permuted Perceptron Problem....Pages 363-374
An Analysis of Exponentiation Based on Formal Languages....Pages 375-388
Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key (Extended Abstract)....Pages 389-401
Computationally Private Information Retrieval with Polylogarithmic Communication....Pages 402-414
On the Concurrent Composition of Zero-Knowledge Proofs....Pages 415-431
Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications....Pages 432-445
Secure Communication in Broadcast Channels: The Answer to Franklin and Wright’s Question....Pages 446-458
Efficient Communication-Storage Tradeoffs for Multicast Encryption....Pages 459-474