Abstract is missing.
- The Complexity of Computing Hard Core PredicatesMikael Goldmann, Mats Näslund. 1-15 [doi]
- Statistical Zero Knowledge Protocols to Prove Modular Polynomial RelationsEiichiro Fujisaki, Tatsuaki Okamoto. 16-30 [doi]
- Keeping the SZK-Verifier Honest UnconditionallyGiovanni Di Crescenzo, Tatsuaki Okamoto, Moti Yung. 31-45 [doi]
- On the Foundations of Modern CryptographyOded Goldreich. 46-74 [doi]
- Plug and Play EncryptionDonald Beaver. 75-89 [doi]
- Deniable EncryptionRan Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky. 90-104 [doi]
- Eliminating Decryption Errors in the Ajtai-Dwork CryptosystemOded Goldreich, Shafi Goldwasser, Shai Halevi. 105-111 [doi]
- Public-Key Cryptosystems from Lattice Reduction ProblemsOded Goldreich, Shafi Goldwasser, Shai Halevi. 112-131 [doi]
- RSA-Based Undeniable SignaturesRosario Gennaro, Hugo Krawczyk, Tal Rabin. 132-149 [doi]
- Security of Blind Digital Signatures (Extended Abstract)Ari Juels, Michael Luby, Rafail Ostrovsky. 150-164 [doi]
- Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption)Yuliang Zheng. 165-179 [doi]
- How to Sign Digital StreamsRosario Gennaro, Pankaj Rohatgi. 180-197 [doi]
- Merkle-Hellman Revisited: A Cryptoanalysis of the Qu-Vanstone Cryptosystem Based on Group FactorizationsPhong Q. Nguyen, Jacques Stern. 198-212 [doi]
- Failure of the McEliece Public-Key Cryptosystem Under Message-Resend and Related-Message AttackThomas A. Berson. 213-220 [doi]
- A Multiplicative Attack Using LLL Algorithm on RSA Signatures with RedundancyJean-François Misarsky. 221-234 [doi]
- On the Security of the KMOV Public Key CryptosystemDaniel Bleichenbacher. 235-248 [doi]
- A Key Recovery Attack on Discrete Log-based Schemes Using a Prime Order SubgrouppChae Hoon Lim, Pil Joong Lee. 249-263 [doi]
- The Prevalence of Kleptographic Attacks on Discrete-Log Based CryptosystemsAdam Young, Moti Yung. 264-276 [doi]
- Pseudo-Random Number Generation Within Cryptographic Algorithms: The DDS CaseMihir Bellare, Shafi Goldwasser, Daniele Micciancio. 277-291 [doi]
- Unconditional Security Against Memory-Bounded AdversariesChristian Cachin, Ueli M. Maurer. 292-306 [doi]
- Privacy Amplification Secure Against Active AdversariesUeli M. Maurer, Stefan Wolf. 307-321 [doi]
- Visual Authentication and IdentificationMoni Naor, Benny Pinkas. 322-336 [doi]
- Quantum Information Processing: The Good, the Bad and the UglyGilles Brassard. 337-341 [doi]
- Efficient Algorithms for Elliptic Curve CryptosystemsJorge Guajardo, Christof Paar. 342-356 [doi]
- An Improved Algorithm for Arithmetic on a Family of Elliptic CurvesJerome A. Solinas. 357-371 [doi]
- Fast RSA-Type Cryptosystems Using N-Adic ExpansionTsuyoshi Takagi. 372-384 [doi]
- A One Way Function Based on Ideal Arithmetic in Number FieldsJohannes Buchmann, Sachar Paulus. 385-394 [doi]
- Efficient Anonymous Multicast and Reception (Extended Abstract)Shlomi Dolev, Rafail Ostrovsky. 395-409 [doi]
- Efficient Group Signature Schemes for Large Groups (Extended Abstract)Jan Camenisch, Markus Stadler. 410-424 [doi]
- Efficient Generation of Shared RSA Keys (Extended Abstract)Dan Boneh, Matthew K. Franklin. 425-439 [doi]
- Proactive RSAYair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung. 440-454 [doi]
- Towards Realizing Random Oracles: Hash Functions That Hide All Partial InformationRan Canetti. 455-469 [doi]
- Collision-Resistant Hashing: Towards Making UOWHFs PracticalMihir Bellare, Phillip Rogaway. 470-484 [doi]
- Fast and Secure Hashing Based on CodesLars R. Knudsen, Bart Preneel. 485-498 [doi]
- Edit Distance Correlation Attack on the Alternating Step GeneratorJovan Dj. Golic, Renato Menicocci. 499-512 [doi]
- Differential Fault Analysis of Secret Key CryptosystemsEli Biham, Adi Shamir. 513-525 [doi]
- Cryptoanalysis of the Cellular Encryption AlgorithmDavid Wagner, Bruce Schneier, John Kelsey. 526-537 [doi]