International Association for Cryptologic Research

Publications by Conference

Advances in Cryptology - EUROCRYPT '95, International Conference on the Theory and Application of Cryptographic Techniques, Saint-Malo, France, May 21-25, 1995, Proceeding

Page	Title
1-12	Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction
13-23	Convergence in Differential Distributions
24-38	A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-Up Lemma
39-49	On the Efficiency of Group Signatures Providing Information-Theoretic Anonymity
50-63	Verifiable Signature Sharing
64-78	Server (Prover/Signer)-Aided Verification of Identity Proofs and Signatures
79-94	Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance
95-105	An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p
106-120	A Block Lanczos Algorithm for Finding Dependencies Over GF(2)
121-132	How to Break Another Provably Secure Payment System
133-146	Quantum Oblivious Mutual Identification
147-157	Securing Traceability of Ciphertexts - Towards a Secure Software Key Escrow System (Extended Abstract)
158-167	Secure Multiround Authentication Protocols
168-182	Verifiable Secret Sharing as Secure Computation
183-193	Efficient Secret Sharing Without a Mutually Trusted Authority (Extended Abstract)
194-208	General Short Computational Secret Sharing Schemes
209-219	Fair Blind Signatures
220-230	Ripping Coins For a Fair Exchange
231-247	Restrictive Blinding of Secret-Key Certificates
248-262	Towards Fast Correlation Attacks on Irregularly Clocked Shift Registers
263-273	Large Periods Nearly de Bruijn FCSR Sequences
274-288	On Nonlinear Resilient Functions (Extended Abstract)
289-300	Combinatorial Bounds for Authentication Codes with Arbitration
301-310	New Hash Functions For Message Authentication
311-318	A² Codes from Universal Hash Classes
319-328	A New Identification Scheme Based on the Perceptrons Problem
329-340	Fast RSA-type Schemes Based on Singular Cubic Curves y²+axy=m³(mod n)
341-355	Relationships Among the Computational Powers of Breaking Discrete Log Cryptosystems
356-366	Universal Hash Functions & Hard Core Bits
367-381	Recycling Random Bits in Composed Perfect Zero-Knowledge
382-392	On the Matsumoto and Imai's Human Identification Scheme
393-403	Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth
404-409	Are Crypto-Accelerators Really Inevitable? 20Bit Zero-Knowledge in Less than a Second on Simple 8-bit Microcontrollers
413-416	Anonymous NIZK Proofs of Knowledge with Preprocessing