Abstract is missing.
- Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1Daniel Bleichenbacher. 1-12 [doi]
- A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext AttackRonald Cramer, Victor Shoup. 13-25 [doi]
- Relations Among Notions of Security for Public-Key Encryption SchemesMihir Bellare, Anand Desai, David Pointcheval, Phillip Rogaway. 26-45 [doi]
- Cryptography and the InternetSteven M. Bellovin. 46-55 [doi]
- Differential Collisions in SHA-0Florent Chabaud, Antoine Joux. 56-71 [doi]
- From Differential Cryptoanalysis to Ciphertext-Only AttacksAlex Biryukov, Eyal Kushilevitz. 72-88 [doi]
- A Simplified Approach to Threshold and Proactive RSATal Rabin. 89-104 [doi]
- New Efficient and Secure Protocols for Verifiable Signature Sharing and Other ApplicationsDario Catalano, Rosario Gennaro. 105-120 [doi]
- Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract)Matthias Fitzi, Martin Hirt, Ueli M. Maurer. 121-136 [doi]
- Fast Digital Identity Revocation (Extended Abstract)William Aiello, Sachin Lodha, Rafail Ostrovsky. 137-152 [doi]
- Self-Delegation with Controlled Propagation - or - What If You Lose Your LaptopOded Goldreich, Birgit Pfitzmann, Ronald L. Rivest. 153-168 [doi]
- Identity EscrowJoe Kilian, Erez Petrank. 169-185 [doi]
- Generalized Birthday Arracks on Unbalanced Feistel NetworksCharanjit S. Jutla. 186-199 [doi]
- Quadratic Relation of S-box and Its Application to the Linear Attack of Full Round DESTakeshi Shimoyama, Toshinobu Kaneko. 200-211 [doi]
- Cryptanalysis of Block Ciphers with Probabilistic Non-linear Relations of Low DegreeThomas Jakobson. 212-222 [doi]
- Cryptanalysis of the Ajtai-Dwork CryptosystemPhong Q. Nguyen, Jacques Stern. 223-242 [doi]
- Cryptanalysis of the Chor-Rivest CryptosystemSerge Vaudenay. 243-256 [doi]
- Cryptanalysis of the Oil & Vinegar Signature SchemeAviad Kipnis, Adi Shamir. 257-266 [doi]
- From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract)Moni Naor, Omer Reingold. 267-282 [doi]
- Many-to-One Trapdoor Functions and Their Ralation to Public-Key CryptosystemsMihir Bellare, Shai Halevi, Amit Sahai, Salil P. Vadhan. 283-298 [doi]
- Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract)Yonatan Aumann, Michael O. Rabin. 299-303 [doi]
- An Efficient Discrete Log Pseudo Random GeneratorSarvar Patel, Ganapathy S. Sundaram. 304-317 [doi]
- Fast RSA-Type Cryptosystem Modulo p:::k:::qTsuyoshi Takagi. 318-326 [doi]
- An Elliptic Curve Implementation of the Finite Field Digital Signature AlgorithmNeal Koblitz. 327-337 [doi]
- Quantum Bit Commitment from a Physical AssumptionLouis Salvail. 338-353 [doi]
- On Concrete Security Treatment of Signatures Derived from IdentificationKazuo Ohta, Tatsuaki Okamoto. 354-369 [doi]
- Building PRFs from PRPsChris Hall, David Wagner, John Kelsey, Bruce Schneier. 370-389 [doi]
- Security Amplification by Composition: The Case of Doubly-Iterated, Ideal CiphersWilliam Aiello, Mihir Bellare, Giovanni Di Crescenzo, Ramarathnam Venkatesan. 390-407 [doi]
- On the Existence of 3-Round Zero-Knowledge ProtocolsSatoshi Hada, Toshiaki Tanaka. 408-423 [doi]
- Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?Ronald Cramer, Ivan Damgård. 424-441 [doi]
- Concurrent Zero-Knowledge: Reducing the Need for Timing ConstraintsCynthia Dwork, Amit Sahai. 442-457 [doi]
- The Solution of McCurley s Discrete Log ChallengeDamian Weber, Thomas F. Denny. 458-471 [doi]
- Optimal Extension Fields for Fast Arithmetic in Public-Key AlgorithmsDaniel V. Bailey, Christof Paar. 472-485 [doi]
- Time-Stamping with Binary Linking SchemesAhto Buldas, Peeter Laud, Helger Lipmaa, Jan Willemson. 486-501 [doi]
- Threshold Traitor TracingMoni Naor, Benny Pinkas. 502-517 [doi]