15. CRYPTO 1995: Santa Barbara, California, USA

MAC and Hash

• Bart Preneel, Paul C. van Oorschot:
  MDx-MAC and Building Fast MACs from Hash Functions. 1-14
  
• Mihir Bellare, Roch Guérin, Phillip Rogaway:
  XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions. 15-28
  
• Phillip Rogaway:
  Bucket Hashing and its Application to Fast Message Authentication. 29-42
  

Number Theory I

• Richard Schroeppel, Hilarie K. Orman, Sean W. O'Malley, Oliver Spatscheck:
  Fast Key Exchange with Elliptic Curve Systems. 43-56
  
• Philippe Béguin, Jean-Jacques Quisquater:
  Fast Server-Aided RSA Signatures Secure Against Active Attacks. 57-69
  
• Chae Hoon Lim, Pil Joong Lee:
  Security and Performance of Server-Aided RSA Computation Protocols. 70-83
  

Oblivious Transfer

• Shai Halevi:
  Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver. 84-96
  
• Donald Beaver:
  Precomputing Oblivious Transfer. 97-109
  
• Claude Crépeau, Jeroen van de Graaf, Alain Tapp:
  Committed Oblivious Transfer and Private Multi-Party Computation. 110-123
  
• Dominic Mayers:
  On the Security of the Quantum Oblivious Transfer and Key Distribution Protocols. 124-135
  

Cryptoanalysis I

• Thorsten Theobald:
  How to Break Shamir's Asymmetric Basis. 136-147
  
• Sangjoon Park, Sangjin Lee, Seung-Cheol Goh:
  On the Security of the Gollmann Cascades. 148-156
  
• Kazuo Ohta, Shiho Moriai, Kazumaro Aoki:
  Improving the Search Algorithm for the Best Linear Expression. 157-170
  
• Burton S. Kaliski Jr., Yiqun Lisa Yin:
  On Differential and Linear Crytoanalysis of the RC5 Encryption Algorithm. 171-184
  

Key Escrow

• Silvio Micali, Ray Sidney:
  A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Escrow Systems. 185-196
  
• Arjen K. Lenstra, Peter Winkler, Yacov Yacobi:
  A Key Escrow System with Warrant Bounds. 197-207
  
• Joe Kilian, Frank Thomson Leighton:
  Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract). 208-221
  
• Yair Frankel, Moti Yung:
  Escrow Encryption Systems Visited: Attacks, Analysis and Designs. 222-235
  

Protocols

• Ross J. Anderson, Roger M. Needham:
  Robustness Principles for Public Key Protocols. 236-247
  

Cryptoanalysis II

• Jacques Patarin:
  Cryptoanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88. 248-261
  
• Andrew Klapper, Mark Goresky:
  Cryptoanalysis Based on 2-Adic Rational Approximation. 262-273
  
• Lars R. Knudsen:
  A Key-schedule Weakness in SAFER K-64. 274-286
  
• Yair Frankel, Moti Yung:
  Cryptoanalysis of the Immunized LL Public Key Systems. 287-296
  

Zero Knowledge, Interactive Protocols

• Ronald Cramer, Ivan Damgård:
  Escure Signature Schemes based on Interactive Protocols. 297-310
  
• Joe Kilian:
  Improved Efficient Arguments (Preliminary Version). 311-324
  
• Ivan Damgård, Oded Goldreich, Tatsuaki Okamoto, Avi Wigderson:
  Honest Verifier vs Dishonest Verifier in Public Cain Zero-Knowledge Proofs. 325-338
  

Secret Sharing I

• Amir Herzberg, Stanislaw Jarecki, Hugo Krawczyk, Moti Yung:
  Proactive Secret Sharing Or: How to Cope With Perpetual Leakage. 339-352
  
• Amos Beimel, Benny Chor:
  Secret Sharing with Public Reconstruction (Extended Abstract). 353-366
  
• G. R. Blakley, Gregory Kabatianskii:
  General Perfect Secret Sharing Schemes. 367-371
  

Number Theory II

• Bruce Dodson, Arjen K. Lenstra:
  NFS with Four Large Primes: An Explosive Experiment. 372-385
  
• Daniel Bleichenbacher, Wieb Bosma, Arjen K. Lenstra:
  Some Remarks on Lucas-Based Cryptosystems. 386-396
  

Secret Sharing II

• Susan K. Langford:
  Threshold DSS Signatures without a Trusted Party. 397-409
  
• Kaoru Kurosawa, Satoshi Obana, Wakaha Ogata:
  t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes. 410-423
  

Everything Else

• Dan Boneh, Richard J. Lipton:
  Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract). 424-437
  
• Tatsuaki Okamoto:
  An Efficient Divisible Electronic Cash Scheme. 438-451
  
• Dan Boneh, James Shaw:
  Collusion-Secure Fingerprinting for Digital Data (Extended Abstract). 452-465