Abstract is missing.
- MDx-MAC and Building Fast MACs from Hash FunctionsBart Preneel, Paul C. van Oorschot. 1-14 [doi]
- XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom FunctionsMihir Bellare, Roch Guérin, Phillip Rogaway. 15-28 [doi]
- Bucket Hashing and its Application to Fast Message AuthenticationPhillip Rogaway. 29-42 [doi]
- Fast Key Exchange with Elliptic Curve SystemsRichard Schroeppel, Hilarie K. Orman, Sean W. O Malley, Oliver Spatscheck. 43-56 [doi]
- Fast Server-Aided RSA Signatures Secure Against Active AttacksPhilippe Béguin, Jean-Jacques Quisquater. 57-69 [doi]
- Security and Performance of Server-Aided RSA Computation ProtocolsChae Hoon Lim, Pil Joong Lee. 70-83 [doi]
- Efficient Commitment Schemes with Bounded Sender and Unbounded ReceiverShai Halevi. 84-96 [doi]
- Precomputing Oblivious TransferDonald Beaver. 97-109 [doi]
- Committed Oblivious Transfer and Private Multi-Party ComputationClaude Crépeau, Jeroen van de Graaf, Alain Tapp. 110-123 [doi]
- On the Security of the Quantum Oblivious Transfer and Key Distribution ProtocolsDominic Mayers. 124-135 [doi]
- How to Break Shamir s Asymmetric BasisThorsten Theobald. 136-147 [doi]
- On the Security of the Gollmann CascadesSangjoon Park, Sangjin Lee, Seung-Cheol Goh. 148-156 [doi]
- Improving the Search Algorithm for the Best Linear ExpressionKazuo Ohta, Shiho Moriai, Kazumaro Aoki. 157-170 [doi]
- On Differential and Linear Crytoanalysis of the RC5 Encryption AlgorithmBurton S. Kaliski Jr., Yiqun Lisa Yin. 171-184 [doi]
- A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Escrow SystemsSilvio Micali, Ray Sidney. 185-196 [doi]
- A Key Escrow System with Warrant BoundsArjen K. Lenstra, Peter Winkler, Yacov Yacobi. 197-207 [doi]
- Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract)Joe Kilian, Frank Thomson Leighton. 208-221 [doi]
- Escrow Encryption Systems Visited: Attacks, Analysis and DesignsYair Frankel, Moti Yung. 222-235 [doi]
- Robustness Principles for Public Key ProtocolsRoss J. Anderson, Roger M. Needham. 236-247 [doi]
- Cryptoanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt 88Jacques Patarin. 248-261 [doi]
- Cryptoanalysis Based on 2-Adic Rational ApproximationAndrew Klapper, Mark Goresky. 262-273 [doi]
- A Key-schedule Weakness in SAFER K-64Lars R. Knudsen. 274-286 [doi]
- Cryptoanalysis of the Immunized LL Public Key SystemsYair Frankel, Moti Yung. 287-296 [doi]
- Escure Signature Schemes based on Interactive ProtocolsRonald Cramer, Ivan Damgård. 297-310 [doi]
- Improved Efficient Arguments (Preliminary Version)Joe Kilian. 311-324 [doi]
- Honest Verifier vs Dishonest Verifier in Public Cain Zero-Knowledge ProofsIvan Damgård, Oded Goldreich, Tatsuaki Okamoto, Avi Wigderson. 325-338 [doi]
- Proactive Secret Sharing Or: How to Cope With Perpetual LeakageAmir Herzberg, Stanislaw Jarecki, Hugo Krawczyk, Moti Yung. 339-352 [doi]
- Secret Sharing with Public Reconstruction (Extended Abstract)Amos Beimel, Benny Chor. 353-366 [doi]
- General Perfect Secret Sharing SchemesG. R. Blakley, Gregory Kabatianskii. 367-371 [doi]
- NFS with Four Large Primes: An Explosive ExperimentBruce Dodson, Arjen K. Lenstra. 372-385 [doi]
- Some Remarks on Lucas-Based CryptosystemsDaniel Bleichenbacher, Wieb Bosma, Arjen K. Lenstra. 386-396 [doi]
- Threshold DSS Signatures without a Trusted PartySusan K. Langford. 397-409 [doi]
- t-Cheater Identifiable (k, n) Threshold Secret Sharing SchemesKaoru Kurosawa, Satoshi Obana, Wakaha Ogata. 410-423 [doi]
- Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)Dan Boneh, Richard J. Lipton. 424-437 [doi]
- An Efficient Divisible Electronic Cash SchemeTatsuaki Okamoto. 438-451 [doi]
- Collusion-Secure Fingerprinting for Digital Data (Extended Abstract)Dan Boneh, James Shaw. 452-465 [doi]