International Association for Cryptologic Research

Publications by Conference

Advances in Cryptology - CRYPTO '95, 15th Annual International Cryptology Conference, Santa Barbara, California, USA, August 27-31, 1995, Proceedings

Page	Title
1-14	MDx-MAC and Building Fast MACs from Hash Functions
15-28	XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions
29-42	Bucket Hashing and its Application to Fast Message Authentication
43-56	Fast Key Exchange with Elliptic Curve Systems
57-69	Fast Server-Aided RSA Signatures Secure Against Active Attacks
70-83	Security and Performance of Server-Aided RSA Computation Protocols
84-96	Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver
97-109	Precomputing Oblivious Transfer
110-123	Committed Oblivious Transfer and Private Multi-Party Computation
124-135	On the Security of the Quantum Oblivious Transfer and Key Distribution Protocols
136-147	How to Break Shamir's Asymmetric Basis
148-156	On the Security of the Gollmann Cascades
157-170	Improving the Search Algorithm for the Best Linear Expression
171-184	On Differential and Linear Crytoanalysis of the RC5 Encryption Algorithm
185-196	A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Escrow Systems
197-207	A Key Escrow System with Warrant Bounds
208-221	Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract)
222-235	Escrow Encryption Systems Visited: Attacks, Analysis and Designs
236-247	Robustness Principles for Public Key Protocols
248-261	Cryptoanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88
262-273	Cryptoanalysis Based on 2-Adic Rational Approximation
274-286	A Key-schedule Weakness in SAFER K-64
287-296	Cryptoanalysis of the Immunized LL Public Key Systems
297-310	Escure Signature Schemes based on Interactive Protocols
311-324	Improved Efficient Arguments (Preliminary Version)
325-338	Honest Verifier vs Dishonest Verifier in Public Cain Zero-Knowledge Proofs
339-352	Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
353-366	Secret Sharing with Public Reconstruction (Extended Abstract)
367-371	General Perfect Secret Sharing Schemes
372-385	NFS with Four Large Primes: An Explosive Experiment
386-396	Some Remarks on Lucas-Based Cryptosystems
397-409	Threshold DSS Signatures without a Trusted Party
410-423	t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes
424-437	Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)
438-451	An Efficient Divisible Electronic Cash Scheme
452-465	Collusion-Secure Fingerprinting for Digital Data (Extended Abstract)