Abstract is missing.
- Attacking the Chor-Rivest Cryptosystem by Improved Lattice ReductionClaus-Peter Schnorr, Horst Helmut Hörner. 1-12 [doi]
- Convergence in Differential DistributionsLuke O Connor. 13-23 [doi]
- A Generalization of Linear Cryptanalysis and the Applicability of Matsui s Piling-Up LemmaCarlo Harpes, Gerhard G. Kramer, James L. Massey. 24-38 [doi]
- On the Efficiency of Group Signatures Providing Information-Theoretic AnonymityLidong Chen, Torben P. Pedersen. 39-49 [doi]
- Verifiable Signature SharingMatthew K. Franklin, Michael K. Reiter. 50-63 [doi]
- Server (Prover/Signer)-Aided Verification of Identity Proofs and SignaturesChae Hoon Lim, Pil Joong Lee. 64-78 [doi]
- Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and PerformanceReynald Lercier, François Morain. 79-94 [doi]
- An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod pDamian Weber. 95-105 [doi]
- A Block Lanczos Algorithm for Finding Dependencies Over GF(2)Peter L. Montgomery. 106-120 [doi]
- How to Break Another Provably Secure Payment SystemBirgit Pfitzmann, Matthias Schunter, Michael Waidner. 121-132 [doi]
- Quantum Oblivious Mutual IdentificationClaude Crépeau, Louis Salvail. 133-146 [doi]
- Securing Traceability of Ciphertexts - Towards a Secure Software Key Escrow System (Extended Abstract)Yvo Desmedt. 147-157 [doi]
- Secure Multiround Authentication ProtocolsChristian Gehrmann. 158-167 [doi]
- Verifiable Secret Sharing as Secure ComputationRosario Gennaro, Silvio Micali. 168-182 [doi]
- Efficient Secret Sharing Without a Mutually Trusted Authority (Extended Abstract)Wen-Ai Jackson, Keith M. Martin, Christine M. O Keefe. 183-193 [doi]
- General Short Computational Secret Sharing SchemesPhilippe Béguin, Antonella Cresti. 194-208 [doi]
- Fair Blind SignaturesMarkus Stadler, Jean-Marc Piveteau, Jan Camenisch. 209-219 [doi]
- Ripping Coins For a Fair ExchangeMarkus Jakobsson. 220-230 [doi]
- Restrictive Blinding of Secret-Key CertificatesStefan Brands. 231-247 [doi]
- Towards Fast Correlation Attacks on Irregularly Clocked Shift RegistersJovan Dj. Golic. 248-262 [doi]
- Large Periods Nearly de Bruijn FCSR SequencesAndrew Klapper, Mark Goresky. 263-273 [doi]
- On Nonlinear Resilient Functions (Extended Abstract)Xian-Mo Zhang, Yuliang Zheng. 274-288 [doi]
- Combinatorial Bounds for Authentication Codes with ArbitrationKaoru Kurosawa, Satoshi Obana. 289-300 [doi]
- New Hash Functions For Message AuthenticationHugo Krawczyk. 301-310 [doi]
- A New Identification Scheme Based on the Perceptrons ProblemDavid Pointcheval. 319-328 [doi]
- Fast RSA-type Schemes Based on Singular Cubic Curves y²+axy=m³(mod n)Kenji Koyama. 329-340 [doi]
- Relationships Among the Computational Powers of Breaking Discrete Log CryptosystemsKouichi Sakurai, Hiroki Shizuya. 341-355 [doi]
- Universal Hash Functions & Hard Core BitsMats Näslund. 356-366 [doi]
- Recycling Random Bits in Composed Perfect Zero-KnowledgeGiovanni Di Crescenzo. 367-381 [doi]
- On the Matsumoto and Imai s Human Identification SchemeChih-Hung Wang, Tzonelih Hwang, Jiun-Jang Tsai. 382-392 [doi]
- Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting BoothKazue Sako, Joe Kilian. 393-403 [doi]
- Are Crypto-Accelerators Really Inevitable? 20Bit Zero-Knowledge in Less than a Second on Simple 8-bit MicrocontrollersDavid Naccache, David M Raïhi, William Wolfowicz, Adina di Porto. 404-409 [doi]
- Anonymous NIZK Proofs of Knowledge with PreprocessingStefano D Amiano, Giovanni Di Crescenzo. 413-416 [doi]