The Crypto ’95 conference was sponsored by the International Association for Cryptologic Research (IACR), in cooperation with the IEEE Computer - ciety Technical Committee on Security and Privacy, and the Computer Science Department of the University of California, Santa Barbara. It took place at the University of California, Santa Barbara, from August 27-31, 1995. This was the fifteenth annual Crypto conference; all have been held at UCSB. For the second time, proceedings were available at the conference. The General Chair, Stafford Tavares, was responsible for local organization and registration. The Program Committee considered 151 papers and selected 36 for pres- tation. There were also two invited talks. Robert Morris, Sr. gave a talk on “Ways of Losing Information,” which included some non-cryptographic means of leaking secrets that are often overlooked by cryptographers. The second talk, “Cryptography - Myths and Realities,” was given by Adi Shamir, this year’s IACR Distinguished Lecturer. Shamir is the second person to receive this honor, the first having been Gus Simmons at Crypto ’94. These proceedings contain revised versions of the 36 contributed talks. Each paper was sent to at least three members of the program committee for c- ments. Revisions were not checked on their scientific aspects. Some authors will write final versions of their papers for publication in refereed journals. Of course, the authors bear full responsibility for the contents of their papers.
Author(s): Bart Preneel, Paul C. van Oorschot (auth.), Don Coppersmith (eds.)
Series: Lecture Notes in Computer Science 963
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1995
Language: English
Pages: 466
Tags: Data Encryption; Coding and Information Theory; Combinatorics; Operating Systems; Algorithm Analysis and Problem Complexity; Computer Communication Networks
MDx-MAC and Building Fast MACs from Hash Functions....Pages 1-14
XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions....Pages 15-28
Bucket Hashing and its Application to Fast Message Authentication....Pages 29-42
Fast Key Exchange with Elliptic Curve Systems....Pages 43-56
Fast Server-Aided RSA Signatures Secure Against Active Attacks....Pages 57-69
Security and Performance of Server-Aided RSA Computation Protocols....Pages 70-83
Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver....Pages 84-96
Precomputing Oblivious Transfer....Pages 97-109
Committed Oblivious Transfer and Private Multi-Party Computation....Pages 110-123
On the Security of the Quantum Oblivious Transfer and Key Distribution Protocols....Pages 124-135
How to Break Shamir’s Asymmetric Basis....Pages 136-147
On the Security of the Gollmann Cascades....Pages 148-156
Improving the Search Algorithm for the Best Linear Expression....Pages 157-170
On Differential and Linear Cryptanalysis of the RC5 Encryption Algorithm....Pages 171-184
A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Key Escrow Systems....Pages 185-196
A Key Escrow System with Warrant Bounds....Pages 197-207
Fair Cryptosystems, Revisited....Pages 208-221
Escrow Encryption Systems Visited: Attacks, Analysis and Designs....Pages 222-235
Robustness Principles for Public Key Protocols....Pages 236-247
Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’88....Pages 248-261
Cryptanalysis Based on 2-Adic Rational Approximation....Pages 262-273
A Key-schedule Weakness in SAFER K-64....Pages 274-286
Cryptanalysis of the Immunized LL Public Key Systems....Pages 287-296
Secure Signature Schemes based on Interactive Protocols....Pages 297-310
Improved Efficient Arguments....Pages 311-324
Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs....Pages 325-338
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage....Pages 339-352
Secret Sharing with Public Reconstruction....Pages 353-366
On General Perfect Secret Sharing Schemes....Pages 367-371
NFS with Four Large Primes: An Explosive Experiment....Pages 372-385
Some Remarks on Lucas-Based Cryptosystems....Pages 386-396
Threshold DSS Signatures without a Trusted Party....Pages 397-409
t -Cheater Identifiable ( k, n ) Threshold Secret Sharing Schemes....Pages 410-423
Quantum Cryptanalysis of Hidden Linear Functions....Pages 424-437
An Efficient Divisible Electronic Cash Scheme....Pages 438-451
Collusion-Secure Fingerprinting for Digital Data....Pages 452-465
