Accepted papers for Crypto '95

The following is a list of papers that have been accepted for presentation at Crypto '95. A full program will appear later.
Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt '88
Jacques Patarin

Some Remarks on Lucas-based Cryptosystems
Daniel Bleichenbacher, Wieb Bosma, Arjen K. Lenstra

Quantum Cryptoanalysis of Hidden Linear Functions
Dan Boneh, Richard J. Lipton

Collusion-Secure Fingerprinting for Digital Data
Dan Boneh, James Shaw

Honest Verifier vs. Dishonest Verifier in Public Coin Zero-Knowledge Proofs
Ivan Damgard, Oded Goldreich, Tatsuaki Okamoto, Avi Wigderson

How to Break Shamir's Asymmetric Basis
Thorsten Theobald

NFS with Four Large Primes: An Explosive Experiment
Bruce Dodson, Arjen K. Lenstra

Cryptanalysis Based on 2-Adic Rational Approximation
Andrew Klapper, Mark Goresky

Secure Signature Schemes based on Interactive Protocols
Ronald Cramer, Ivan Damgard

t-Cheater Identifiable (k,n) Threshold Secret Sharing Schemes
Kaoru Kurosawa, Satoshi Obana, Wakaha Ogata

A Weakness in SAFER K-64
Lars R. Knudsen

Robustness Principles for Public Key Protocols
Ross Anderson, Roger Needham

A Resilient Clipper-like Key Escrow System
Silvio Micali, Ray Sidney

Security and Performance of Server-Aided RSA Computation Protocols
Chae Hoon Lim, Pil Joong Lee

Fast Server-Aided RSA Signatures Secure Against Active Attacks
Philippe Beguin, Jean-Jacques Quisquater

Fast Key Exchange with Elliptic Curve Systems
Richard Schroeppel, Hilarie Orman, Sean O'Malley

Committed Oblivious Transfer and Secure Multiparty Computation
Claude Crepeau, Jeroen van de Graaf, Alain Tapp

On the Security of the Quantum Oblivious Transfer and Key Distribution Protocols
Dominic Mayers

Building Fast MACs from Hash Functions
Bart Preneel, Paul C. van Oorschot

A Key Escrow System with Warrant Bounds
Arjen K. Lenstra, Peter Winkler, Yacov Yacobi

Improving the Search Algorithm for the Best Linear Expression
Kazuo Ohta, Shiho Moriai, Kazumaro Aoki

XOR MACs: New Methods for Message Authentication using Block Ciphers
Mihir Bellare, Roch Guerin, Phillip Rogaway

Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver
Shai Halevi

Efficient Arguments Above P
Joe Kilian

Fair Cryptosystems Revisited
Joe Kilian, Tom Leighton

Precomputing Oblivious Transfer
Donald Beaver

An Efficient Divisible Electronic Cash Scheme
Tatsuaki Okamoto

On Differential and Linear Cryptanalysis of the RC5 Encryption Algorithm
Burton S. Kaliski Jr., Yiqun Lisa Yin

On General Perfect Secret Sharing Schemes
G. R. Blakley, G. A. Kabatianski

Bucket Hashing and its Application to Fast Message Authentication
Phillip Rogaway

Proactive Secret Sharing or How to Cope With Perpetual Leakage
Amir Herzberg, Stanislaw Jarecki, Hugo Krawczyk, Moti Yung

Secret Sharing with Public Reconstruction
Amos Beimel, Benny Chor

Escrow Encryption Systems Visited: Attacks, Analysis and Design.
Yair Frankel, Moti Yung

Cryptanalysis of the Immunized LL Public Key Systems
Yair Frankel, Moti Yung

On the Security of the Gollmann Cascades
Sang-Joon Park, Sang-Jin Lee, Seung-Cheol Goh

Threshold DSS Signatures Without a Trusted Party
Susan K. Langford

INVITED TALK: to be arranged

Crypto '95 page.

IACR home page.