Crypto'92 took place on August 16-20, 1992. It was the twelfth in the series of annual cryptology conferences held on the beautiful campus of the University of California, Santa Barbara. Once again, it was sponsored by the International Association for Cryptologic Research, in cooperation with the IEEE Computer Society Technical Committee on Security and Privacy. The conference ran smoothly, due to the diligent efforts of the g- eral chair, Spyros Magliveras of the University of Nebraska. One of the measures of the success of this series of conferences is represented by the ever increasing number of papers submitted. This year, there were 135 submissions to the c- ference, which represents a new record. Following the practice of recent program comm- tees, the papers received anonymous review. The program committee accepted 38 papers for presentation. In addition, there were two invited presentations, one by Miles Smid on the Digital Signature Standard, and one by Mike Fellows on presenting the concepts of cryptology to elementary-age students. These proceedings contains these 40 papers plus 3 papers that were presented at the Rump Session. I would like to thank all of the authors of the submitted papers and all of the speakers who presented papers. I would like to express my sincere appreciation to the work of the program committee: Ivan Damgard (Aarhus University, Denmark), Odd Goldreich (Technion, Israel), Burt Kaliski (RSA Data Security, USA), Joe Kilian (NEC, USA).
Author(s): Jurjen N. E. Bos, David Chaum (auth.), Ernest F. Brickell (eds.)
Series: Lecture Notes in Computer Science 740
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1993
Language: English
Pages: 593
Tags: Data Encryption; Coding and Information Theory; Database Management; Combinatorics; Operating Systems
Provably Unforgeable Signatures....Pages 1-14
New Constructions of Fail-Stop Signatures and Lower Bounds....Pages 15-30
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes....Pages 31-53
An Efficient Digital Signature Scheme Based on an Elliptic Curve over the Ring Z n ....Pages 54-65
Designing and Detecting Trapdoors for Discrete Log Cryptosystems....Pages 66-75
Response to Comments on the NIST Proposed Digital Signature Standard....Pages 76-88
Wallet Databases with Observers....Pages 89-105
Making Electronic Refunds Safer....Pages 106-112
Fair Public-Key Cryptosystems....Pages 113-138
Pricing via Processing or Combatting Junk Mail....Pages 139-147
On the Information Rate of Secret Sharing Schemes....Pages 148-167
New General Lower Bounds on the Information Rate of Secret Sharing Schemes....Pages 168-182
Universally Ideal Secret Sharing Schemes....Pages 183-195
Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions....Pages 196-214
Low communication 2-prover zero-knowledge proofs for NP....Pages 215-227
Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent....Pages 228-245
On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols....Pages 246-259
On the Design of SP Networks from an Information Theoretic Point of View....Pages 260-279
Partially-bent functions....Pages 280-291
Practical Approaches to Attaining Security against Adaptively Chosen Ciphertext Attacks....Pages 292-304
On the Security of the Permuted Kernel Identification Scheme....Pages 305-311
Massively Parallel Computation of Discrete Logarithms....Pages 312-323
A Quadratic Sieve on the n -Dimensional Cube....Pages 324-332
Efficient Multiplication on Certain Nonsupersingular Elliptic Curves....Pages 333-344
Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method....Pages 345-357
On Generation of Probable Primes by Incremental Search....Pages 358-370
Kid Krypto....Pages 371-389
On Defining Proofs of Knowledge....Pages 390-420
Public Randomness in Cryptography....Pages 421-432
Necessary and Sufficient Conditions for Collision-Free Hashing....Pages 433-441
Certifying Cryptographic Tools: The Case of Trapdoor Permutations....Pages 442-460
Protocols for Secret Key Agreement by Public Discussion Based on Common Information....Pages 461-470
Perfectly-Secure Key Distribution for Dynamic Conferences....Pages 471-486
Differential Cryptanalysis of the Full 16-round DES....Pages 487-496
Iterative Characteristics of DES and s 2 -DES....Pages 497-511
DES is not a Group....Pages 512-520
A High-speed DES Implementation for Network Applications....Pages 521-539
Threshold Schemes with Disenrollment....Pages 540-548
Non-existence of homomorphic general sharing schemes for some key spaces....Pages 549-557
An l -Span Generalized Secret Sharing Scheme....Pages 558-565
Provable Security Against Differential Cryptanalysis....Pages 566-574
Content-Addressable Search Engines and DES-like Systems....Pages 575-586
FFT-Hash-II is not yet Collision-free....Pages 587-593
