Abstract is missing.
- Provably Unforgeable SignaturesJurjen N. Bos, David Chaum. 1-14 [doi]
- New Constructions of Fail-Stop Signatures and Lower Bounds (Extended Abstract)Eugène van Heijst, Torben P. Pedersen, Birgit Pfitzmann. 15-30 [doi]
- Provably Secure and Practical Identification Schemes and Corresponding Signature SchemesTatsuaki Okamoto. 31-53 [doi]
- An Efficient Digital Signature Scheme Based on an Elliptic Curve Over the Ring Z::n::Tatsuaki Okamoto, Atsushi Fujioka, Eiichiro Fujisaki. 54-65 [doi]
- Designing and Detecting Trapdoors for Discrete Log CryptosystemsDaniel M. Gordon. 66-75 [doi]
- Response to Comments of the NIST Proposed Digital Signature StandardMiles E. Smid, Dennis K. Branstad. 76-88 [doi]
- Wallet Databases with ObserversDavid Chaum, Torben P. Pedersen. 89-105 [doi]
- Making Electronic Refunds SaferRafael Hirschfeld. 106-112 [doi]
- Fair Public-Key CryptosystemsSilvio Micali. 113-138 [doi]
- Pricing via Processing or Combatting Junk MailCynthia Dwork, Moni Naor. 139-147 [doi]
- On the Information Rate of Secret Sharing Schemes (Extended Abstract)Carlo Blundo, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro. 148-167 [doi]
- New General Lower Bounds on the Information Rate of Secret Sharing SchemesDouglas R. Stinson. 168-182 [doi]
- Universally Ideal Secret Sharing Schemes (Preliminary Version)Amos Beimel, Benny Chor. 183-195 [doi]
- Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung. 196-214 [doi]
- Low Communication 2-Prover Zero-Knowledge Proofs for NPCynthia Dwork, Uriel Feige, Joe Kilian, Moni Naor, Shmuel Safra. 215-227 [doi]
- Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract)Shafi Goldwasser, Rafail Ostrovsky. 228-245 [doi]
- On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols (Extended Abstract)Kouichi Sakurai, Toshiya Itoh. 246-259 [doi]
- On the Design of SP Networks From an Information Theoretic Point of ViewM. Sivabalan, Stafford E. Tavares, Lloyd E. Peppard. 260-279 [doi]
- Partially-Bent FunctionsClaude Carlet. 280-291 [doi]
- Practical Approaches to Attaining Security Against Adaptively Chosen Ciphertext Attacks (Extended Abstract)Yuliang Zheng, Jennifer Seberry. 292-304 [doi]
- On the Security of the Permuted Kernel Identification SchemeThierry Baritaud, Mireille Campana, Pascal Chauvaud, Henri Gilbert. 305-311 [doi]
- Massively Parallel Computation of Discrete LogarithmsDaniel M. Gordon, Kevin S. McCurley. 312-323 [doi]
- A Quadratic Sieve on the n-Dimensional CubeRené Peralta. 324-332 [doi]
- Efficient Multiplication on Certain Nonsupersingular Elliptic CurvesWilli Meier, Othmar Staffelbach. 333-344 [doi]
- Speeding up Elliptic Cryptosystems by Using a Signed Binary Window MethodKenji Koyama, Yukio Tsuruoka. 345-357 [doi]
- On Generation of Probable Primes By Incremental SearchJørgen Brandt, Ivan Damgård. 358-370 [doi]
- Kid KryptoMichael R. Fellows, Neal Koblitz. 371-389 [doi]
- On Defining Proofs of KnowledgeMihir Bellare, Oded Goldreich. 390-420 [doi]
- Pubic Randomness in CryptographyAmir Herzberg, Michael Luby. 421-432 [doi]
- Necessary and Sufficient Conditions For Collision-Free HashingAlexander Russell. 433-441 [doi]
- Certifying Cryptographic Tools: The Case of Trapdoor PermutationsMihir Bellare, Moti Yung. 442-460 [doi]
- Protocols for Secret Key Agreement by Public Discussion Based on Common InformationUeli M. Maurer. 461-470 [doi]
- Perfectly-Secure Key Distribution for Dynamic ConferencesCarlo Blundo, Alfredo De Santis, Amir Herzberg, Shay Kutten, Ugo Vaccaro, Moti Yung. 471-486 [doi]
- Differential Cryptanalysis of the Full 16-Round DESEli Biham, Adi Shamir. 487-496 [doi]
- Iterative Characteristics of DES and s²-DESLars R. Knudsen. 497-511 [doi]
- DES is not a GroupKeith W. Campbell, Michael J. Wiener. 512-520 [doi]
- A High-Speed DES Implementation for Network ApplicationsHans Eberle. 521-539 [doi]
- Threshold Schemes with DisenrollmentBob Blakley, G. R. Blakley, Agnes Hui Chan, James L. Massey. 540-548 [doi]
- Non-Existence of Homomorphic General Sharing Schemes for Some Key Spaces (Extended Abstract)Yair Frankel, Yvo Desmedt, Mike Burmester. 549-557 [doi]
- An l-Span Generalized Secret Sharing SchemeLein Harn, Hung-Yu Lin. 558-565 [doi]
- Provable Security Against Differential CryptanalysisKaisa Nyberg, Lars R. Knudsen. 566-574 [doi]
- Content-Addressable Search Engines and DES-like SystemsPeter C. Wayner. 575-586 [doi]
- FFT-Hash-II is not yet Collision-freeSerge Vaudenay. 587-593 [doi]