A series of workshops devoted to modern cryptography began in Santa Barbara,California in 1981 and was followed in 1982 by a European counterpart in Burg Feuerstein, Germany. The series has been maintained with summer meetings in Santa Barbara and spring meetings somewhere in Europe. At the 1983 meeting in Santa Barbara the International Association for Cryptologic Research was launched and it now sponsors all the meetings of the series. This volume presents the proceedings of Eurocrypt '92, held in Hungary. The papers are organized into the following parts: Secret sharing, Hash functions, Block ciphers, Stream ciphers, Public key I, Factoring, Trapdoor primes and moduli (panel report), Public key II, Pseudo-random permutation generators, Complexity theory and cryptography I, Zero-knowledge, Digital knowledge and electronic cash, Complexity theory andcryptography II, Applications, and selected papers from the rump session. Following the tradition of the series, the authors produced full papers after the meeting, in some cases with revisions.
Author(s): C. Blundo, A. De Santis, D. R. Stinson, U. Vaccaro (auth.), Rainer A. Rueppel (eds.)
Series: Lecture Notes in Computer Science 658
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1993
Language: English
Pages: 491
Tags: Data Encryption; Coding and Information Theory; Database Management; Combinatorics; Operating Systems
Graph Decompositions and Secret Sharing Schemes....Pages 1-24
Classification of Ideal Homomorphic Threshold Schemes over Finite Abelian Groups....Pages 25-34
F.F.T. Hashing is not Collision-free....Pages 35-44
FFT-Hash II, Efficient Cryptographic Hashing....Pages 45-54
Hash Functions Based on Block Ciphers....Pages 55-70
Differential Cryptanalysis Mod 2 32 with Applications to MD5....Pages 71-80
A New Method for Known Plaintext Attack of FEAL Cipher....Pages 81-91
On the construction of highly nonlinear permutations....Pages 92-98
The One-Round Functions of the DES Generate the Alternating Group....Pages 99-112
Correlation Via Linear Sequential Circuit Approximation of Combiners with Memory....Pages 113-123
Convergence of a Bayesian Iterative Error-Correction Procedure on a Noisy Shift Register Sequence....Pages 124-137
Suffix trees and string complexity....Pages 138-152
Attacks on Protocols for Server-Aided RSA Computation....Pages 153-162
Public-Key Cryptosystems with Very Small Key Lengths....Pages 163-173
Resource Requirements for the Application of Addition Chains in Modulo Exponentiation....Pages 174-182
Massively parallel elliptic curve factoring....Pages 183-193
The Eurocrypt’92 Controversial Issue Trapdoor Primes and Moduli....Pages 194-199
Fast Exponentiation with Precomputation....Pages 200-207
Batch Diffie-Hellman Key Agreement Systems and their Application to Portable Communications....Pages 208-220
High-Speed Implementation Methods for RSA Scheme....Pages 221-238
A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generators....Pages 239-255
How to Construct Pseudorandom and Super Pseudorandom Permutations from One Single Pseudorandom Function....Pages 256-266
A Construction for Super Pseudorandom Permutations from A Single Pseudorandom Function....Pages 267-284
How to Break a “Secure” Oblivious Transfer Protocol....Pages 285-296
Uniform Results in Polynomial-Time Security....Pages 297-306
Cryptographic Protocols Provably Secure Against Dynamic Adversaries....Pages 307-323
Secure Bit Commitment Function against Divertibility....Pages 324-340
Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with Preprocessing....Pages 341-355
Tools for Proving Zero Knowledge....Pages 356-365
How to Make Efficient Fail-stop Signatures....Pages 366-377
Which new RSA Signatures can be Computed from RSA Signatures, Obtained in a Specific Interactive Protocol?....Pages 378-389
Transferred Cash Grows in Size....Pages 390-407
Local Randomness in Candidate One-Way Functions....Pages 408-419
How Intractable Is the Discrete Logarithm for a General Finite Group?....Pages 420-428
Factoring with an Oracle....Pages 429-436
Secure Audio Teleconferencing: A Practical Solution....Pages 437-448
Secure Conference Key Distribution Schemes for Conspiracy Attack....Pages 449-453
A Note on Discrete Logarithms with Special Structure....Pages 454-457
A Remark on a Non-interactive Public-Key Distribution System....Pages 458-460
Security Bounds for Parallel Versions of Identification Protocols....Pages 461-466
Information-Theoretic Bounds for Authentication Frauds....Pages 467-471
A Generalized Correlation Attack with a Probabilistic Constrained Edit Distance....Pages 472-476
Systolic-Arrays for Modular Exponentiation Using Montgomery Method....Pages 477-481
On the Development of a Fast Elliptic Curve Cryptosystem....Pages 482-487
A Montgomery-Suitable Fiat-Shamir-Like Authentication Scheme....Pages 488-491
