Front matter
1-24
Graph Decompositions and Secret Sharing Schemes
C. Blundo, A. De Santis, D. R. Stinson and U. Vaccaro
25-34
Classification of Ideal Homomorphic Threshold Schemes over Finite Abelian Groups
Extended Abstract
Yair Frankel and Yvo Desmedt
35-44
F.F.T. Hashing is not Collision-free
T. Baritaud, H. Gilbert and M. Girault
45-54
FFT-Hash II, Efficient Cryptographic Hashing
C. P. Schnorr
55-70
Hash Functions Based on Block Ciphers
Xucjia Lai and James L. Massey
71-80
Differential Cryptanalysis Mod 232 with Applications to MD5
Thomas A. Berson
81-91
A New Method for Known Plaintext Attack of FEAL Cipher
Mitsuru Matsui and Atsuhiro Yamagishi
92-98
On the construction of highly nonlinear permutations
Kaisa Nyberg
99-112
The One-Round Functions of the DES Generate the Alternating Group
Ralph Wernsdorf
113-123
Correlation Via Linear Sequential Circuit Approximation of Combiners with Memory
Jovan Dj. Golić
124-137
Convergence of a Bayesian Iterative Error-Correction Procedure on a Noisy Shift Register Sequence
Miodrag J. Mihaljević and Jovan Dj. Golić
138-152
Suffix trees and string complexity
Luke O’Connor and Tim Snider
153-162
Attacks on Protocols for Server-Aided RSA Computation
Birgit Pfitzmann and Michael Waidner
163-173
Public-Key Cryptosystems with Very Small Key Lengths
Greg Harper, Alfred Menezes and Scott Vanstone
174-182
Resource Requirements for the Application of Addition Chains in Modulo Exponentiation
Jörg Sauerbrey and Andreas Dietel
183-193
Massively parallel elliptic curve factoring
B. Dixon and A. K. Lenstra
194-199
The Eurocrypt’92 Controversial Issue Trapdoor Primes and Moduli
200-207
Fast Exponentiation with Precomputation
Extended Abstract
Ernest F. Brickell, Daniel M. Gordon, Kevin S. McCurley and David B. Wilson
208-220
Batch Diffie-Hellman Key Agreement Systems and their Application to Portable Communications
Michael J. Beller and Yacov Yacobi
221-238
High-Speed Implementation Methods for RSA Scheme
Keiichi Iwamura, Tsutomu Matsumoto and Hideki Imai
239-255
A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generators
Ueli M. Maurer
256-266
How to Construct Pseudorandom and Super Pseudorandom Permutations from One Single Pseudorandom Function
Jacques Patarin
267-284
A Construction for Super Pseudorandom Permutations from A Single Pseudorandom Function
Babak Sadeghiyan and Josef Pieprzyk
285-296
How to Break a “Secure” Oblivious Transfer Protocol
Donald Beaver
297-306
Uniform Results in Polynomial-Time Security
Paul Barbaroux
307-323
Cryptographic Protocols Provably Secure Against Dynamic Adversaries
Donald Beaver and Stuart Haber
324-340
Secure Bit Commitment Function against Divertibility
Kazuo Ohta, Tatsuaki Okamoto and Atsushi Fujioka
341-355
Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with Preprocessing
Ivan Damgård
356-365
Tools for Proving Zero Knowledge
Ingrid Biehl, Johannes Buchmann, Bernd Meyer, Christian Thiel and Christoph Thiel
366-377
How to Make Efficient Fail-stop Signatures
Eugène van Heyst and Torben Pryds Pedersen
378-389
Which new RSA Signatures can be Computed from RSA Signatures, Obtained in a Specific Interactive Protocol?
Jan-Hendrik Evertse and Eugène van Heyst
390-407
Transferred Cash Grows in Size
David Chaum and Torben Pryds Pedersen
408-419
Local Randomness in Candidate One-Way Functions
H. Niederreiter and C. P. Schnorr
420-428
How Intractable Is the Discrete Logarithm for a General Finite Group?
Tatsuaki Okamoto, Kouichi Sakurai and Hiroki Shizuya
429-436
Factoring with an Oracle
Ueli M. Maurer
437-448
Secure Audio Teleconferencing: A Practical Solution
Rafi Heiman
449-453
Secure Conference Key Distribution Schemes for Conspiracy Attack
Kenji Koyama
454-457
A Note on Discrete Logarithms with Special Structure
Rafi Heiman
458-460
A Remark on a Non-interactive Public-Key Distribution System
Ueli M. Maurer and Yacov Yacobi
461-466
Security Bounds for Parallel Versions of Identification Protocols
Extended Abstract
Lidong Chen and Ivan Damgård
467-471
Information-Theoretic Bounds for Authentication Frauds
Andrea Sgarro
472-476
A Generalized Correlation Attack with a Probabilistic Constrained Edit Distance
Jovan Dj. Golić and Slobodan V. Petrović
477-481
Systolic-Arrays for Modular Exponentiation Using Montgomery Method
Extended Abstract
Keiichi Iwamura, Tsutomu Matsumoto and Hideki Imai
482-487
On the Development of a Fast Elliptic Curve Cryptosystem
G. B. Agnew, R. C. Mullin and S. A. Vanstone
488-491
A Montgomery-Suitable Fiat-Shamir-Like Authentication Scheme
David Naccache
Back matter