International Association for Cryptologic Research

Publications by Conference

Advances in Cryptology - EUROCRYPT '92, Workshop on the Theory and Application of of Cryptographic Techniques, Balatonfüred, Hungary, May 24-28, 1992, Proceedings

Page	Title
1-24	Graph Decompositions and Secret Sharing Schemes
25-34	Classification of Ideal Homomorphic Threshold Schemes over Finite Abelian Groups (Extended Abstract)
35-44	FFT Hashing is not Collision-free
45-54	FFT-Hash II, Efficient Cryptographic Hashing
55-70	Hash Function Based on Block Ciphers
71-80	Differential Cryptanalysis Mod $2^32$ with Applications to MD5
81-91	A New Method for Known Plaintext Attack of FEAL Cipher
92-98	On the Construction of Highly Nonlinear Permutations
99-112	The One-Round Functions of the DES Generate the Alternating Group
113-123	Correlation via Linear Sequential Circuit Approximation of Combiners with memory
124-137	Convergence of a Bayesian Iterative Error-Correction Procedure on a Noisy Shift register Sequence
138-152	Suffix Tree and String Complexity
153-162	Attacks on Protocols for Server-Aided RSA Computation
163-173	Public-Key Cryptosystems with Very Small Key Length
174-182	Resource Requirements for the Application of Addition Chains in Modulo Exponentiation
183-193	Massively Parallel Elliptic Curve Factorin
194-199	The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli (Panel)
200-207	Fast Exponentiation with Precomputation (Extended Abstract)
208-220	Batch Diffie-Hellman Key Agreement Systems and their Application to Portable Communications
221-238	High-Speed Implementation Methods for RSA Scheme
239-255	A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generator
256-266	How to Construct Pseudorandom and Super Pseudorandom Permutations from one Single Pseudorandom Function
267-284	A Construction for Super Pseudorandom Permutations from A Single Pseudorandom Function
285-296	How to Break a "Secure" Oblivious Transfer Protocol
297-306	Uniform Results in Polynomial-Time Security
307-323	Cryptographic Protocols Provably Secure Against Dynamic Adversaries
324-340	Secure Bit Commitment Function against Divertibility
341-355	Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with Proprocessing
356-365	Tools for Proving Zero Knowledge
366-377	How to Make Efficient Fail-stop Signatures
378-389	Which new RSA Signatures can be Computed from RSA Signatures, Obtained in a Specific Interactive Protocol?
390-407	Transferred Cash Grows in Size
408-419	Local Randomness in Candidate One-Way Functions
420-428	How Intractable Is the Discrete Logarithm for a General Finite Group?
429-436	Factoring with an Oracle
437-448	Secure Audio Teleconferencing: A Practical Solution
449-453	Secure Conference Key Distribution Schemes for Conspiracy Attack
454-457	A Note on Discrete Logorithms with Special Structure
458-460	A Remark on a Non-interactive Public-Key Distribution System
461-466	Security Bounds for Parallel Versions of Identification Protocols (Extended Abstract)
467-471	Information-Theoretic Bounds for Authentication Frauds
472-476	A Generalized Correlation Attack with a Probabilistic Constrained Edit Distance
477-481	Systolic-Arrays for Modular Exponentiation Using Montgomery Method (Extended Abstract)
482-487	On the Development of a Fast Elliptic Curve Cryptosystem
488-491	A Montgomery-Suitable Fiat-Shamir-like Authenication Scheme