Abstract is missing.
- Two Attacks on Reduced IDEAJohan Borst, Lars R. Knudsen, Vincent Rijmen. 1-13 [doi]
- A New Public-Key CryptosystemDavid Naccache, Jacques Stern. 27-36 [doi]
- On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract)Dan Boneh, Richard A. DeMillo, Richard J. Lipton. 37-51 [doi]
- Lattice Attacks on NTRUDon Coppersmith, Adi Shamir. 52-61 [doi]
- Kleptography: Using Cryptography Against CryptographyAdam Young, Moti Yung. 62-74 [doi]
- Fast and Secure Immunization Against Adaptive Man-in-the-Middle ImpersonationRonald Cramer, Ivan Damgård. 75-87 [doi]
- Anonymous FingerprintingBirgit Pfitzmann, Michael Waidner. 88-102 [doi]
- A Secure and Optimally Efficient Multi-Authority Election SchemeRonald Cramer, Rosario Gennaro, Berry Schoenmakers. 103-118 [doi]
- Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow ProposalsEric R. Verheul, Henk C. A. van Tilborg. 119-133 [doi]
- The GCHQ Protocol and Its ProblemsRoss J. Anderson, Michael Roe. 134-148 [doi]
- Bucket Hashing with a Small Key SizeThomas Johansson. 149-162 [doi]
- A New Paradigm for Collision-Free Hashing: Incrementality at Reduced CostMihir Bellare, Daniele Micciancio. 163-192 [doi]
- Smooth Entropy and Rényi EntropyChristian Cachin. 193-208 [doi]
- Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public DiscussionUeli M. Maurer. 209-225 [doi]
- Linear Statistical Weakness of Alleged RC4 Keystream GeneratorJovan Dj. Golic. 226-238 [doi]
- Cryptanalysis of Alleged A5 Stream CipherJovan Dj. Golic. 239-255 [doi]
- Lower Bounds for Discrete Logarithms and Related ProblemsVictor Shoup. 256-266 [doi]
- Stronger Security Proofs for RSA and Rabin BitsRoger Fischlin, Claus-Peter Schnorr. 267-279 [doi]
- Round-Optimal Zero-Knowledge Arguments Based on any One-Way FunctionMihir Bellare, Markus Jakobsson, Moti Yung. 280-305 [doi]
- Incremental Cryptography and Memory CheckersMarc Fischlin. 293-408 [doi]
- Efficient Cryptographic Protocols Based on Noisy ChannelsClaude Crépeau. 306-317 [doi]
- Rapid Demonstration of Linear Relations Connected by Boolean OperatorsStefan Brands. 318-333 [doi]
- Oblivious Transfers and Privacy AmplificationGilles Brassard, Claude Crépeau. 334-347 [doi]
- SHA: A Design for Parallel Architectures?Antoon Bosselaers, René Govaerts, Joos Vandewalle. 348-362 [doi]
- Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2:::n:::):::m:::)Christof Paar, Pedro Soria-Rodriguez. 363-378 [doi]
- Finding Good Random Elliptic Curves for Cryptosystems Defined over F::2:::::n:::Reynald Lercier. 379-392 [doi]
- Almost k-wise Independent Sample Spaces and Their Cryptologic ApplicationsKaoru Kurosawa, Thomas Johansson, Douglas R. Stinson. 409-421 [doi]
- More Correlation-Immune and Resilient Functions over Galois Fields and Galois RingsClaude Carlet. 422-433 [doi]
- Design of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic CriteriaKaoru Kurosawa, Takashi Satoh. 434-449 [doi]
- Distributed Magic Ink SignaturesMarkus Jakobsson, Moti Yung. 450-464 [doi]
- Efficient and Generalized Group SignaturesJan Camenisch. 465-479 [doi]
- Collision-Free Accumulators and Fail-Stop Signature Schemes Without TreesNiko Bari, Birgit Pfitzmann. 480-494 [doi]
- Selective Forgery of RSA Signatures Using RedundancyMarc Girault, Jean-François Misarsky. 495-507 [doi]