The CRYPTO ’94 conference is sponsored by the International Association for Cryptologic Research (IACR), in co-operation with the IEEE Computer Society Technical Committee on Security and Privacy. It has taken place at the Univ- sity of California, Santa Barbara, from August 21-25,1994. This is the fourteenth annual CRYPTO conference, all of which have been held at UCSB. This is the first time that proceedings are available at the conference. The General Chair, Jimmy R. Upton has been responsible for local organization, registration, etc. There were 114 submitted papers which were considered by the Program Committee. Of these, 1 was withdrawn and 38 were selected for the proce- ings. There are also 3 invited talks. Two of these are on aspects of cryptog- phy in the commercial world. The one on hardware aspects will be presented by David Maher (AT&T), the one on software aspects by Joseph Pato (Hewlett- Packard). There will also be a panel discussion on “Securing an Electronic World: Are We Ready?” The panel members will be: Ross Anderson, Bob Blakley, Matt Blaze, George Davida, Yvo Desmedt (moderator), Whitfield Diffie, Joan Feig- baum, Blake Greenlee, Martin Hellman, David Maher, Miles Smid. The topic of the panel will be introduced by the invited talk of Whitfield Diffie on ”Securing the Information Highway. ” These proceedings contain revised versions of the 38 contributed talks. Each i paper was sent to at least 3 members of the program committee for comments.
Author(s): Mitsuru Matsui (auth.), Yvo G. Desmedt (eds.)
Series: Lecture Notes in Computer Science 839
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1994
Language: English
Pages: 438
Tags: Data Encryption; Coding and Information Theory; Operating Systems; Combinatorics; Computer Communication Networks
The First Experimental Cryptanalysis of the Data Encryption Standard....Pages 1-11
Linear Cryptanalysis of the Fast Data Encipherment Algorithm....Pages 12-16
Differential-Linear Cryptanalysis....Pages 17-25
Linear Cryptanalysis Using Multiple Approximations....Pages 26-39
Hashing with SL 2 ....Pages 40-49
Design of Elliptic Curves with Controllable Lower Boundary of Extension Degree for Reduction Attacks....Pages 50-55
Cryptographic Protocols Based on Discrete Logarithms in Real-quadratic Orders....Pages 56-60
Designated Confirmer Signatures and Public-Key Encryption are Equivalent....Pages 61-74
Directed Acyclic Graphs, One-way Functions and Digital Signatures....Pages 75-82
An Identity-Based Signature Scheme with Bounded Life-Span....Pages 83-94
More Flexible Exponentiation with Precomputation....Pages 95-107
A Parallel Permutation Multiplier for a PGM Crypto-chip....Pages 108-113
Cryptographic Randomness from Air Turbulence in Disk Drives....Pages 114-120
Cryptanalysis of the Gemmell and Naor Multiround Authentication Protocol....Pages 121-128
LFSR-based Hashing and Authentication....Pages 129-139
New Bound on Authentication Code with Arbitration....Pages 140-149
Multi-Secret Sharing Schemes....Pages 150-163
Designing Identification Schemes with Keys of Short Size....Pages 164-173
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols....Pages 174-187
Language Dependent Secure Bit Commitment....Pages 188-201
On the length of cryptographic hash-values used in identification schemes....Pages 202-215
Incremental Cryptography: The Case of Hashing and Signing....Pages 216-233
An Efficient Existentially Unforgeable Signature Scheme and its Applications....Pages 234-246
Bounds for Resilient Functions and Orthogonal Arrays....Pages 247-256
Tracing Traitors....Pages 257-270
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms....Pages 271-281
Fast Generation of Provable Primes Using Search in Arithmetic Progressions....Pages 282-293
Attack on the Cryptographic Scheme NIKS-TAS....Pages 294-307
On the Risk of Opening Distributed Keys....Pages 308-317
Cryptanalysis of Cryptosystems based on Remote Chaos Replication....Pages 318-331
A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences....Pages 332-340
The Security of Cipher Block Chaining....Pages 341-358
A Chosen Plaintext Attack of the 16-round Khufu Cryptosystem....Pages 359-368
Ciphertext Only Attack for One-way function of the MAP using One Ciphertext....Pages 369-382
Pitfalls in Designing Substitution Boxes....Pages 383-396
A Randomness-Rounds Tradeoff in Private Computation....Pages 397-410
Secure Voting Using Partially Compatible Homomorphisms....Pages 411-424
Maintaining Security in the Presence of Transient Faults....Pages 425-438
