Abstract is missing.
- Factorization of a 512-Bit RSA ModulusStefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman te Riele, Karen Aardal, Jeff Gilchrist, Gérard Guillerm, Paul C. Leyland, Joël Marchand, François Morain, Alec Muffett, Chris Putnam, Craig Putnam, Paul Zimmermann. 1-18 [doi]
- An Algorithm for Solving the Discrete Log Problem on Hyperelliptic CurvesPierrick Gaudry. 19-34 [doi]
- Analysis and Optimization of the TWINKLE Factoring DeviceArjen K. Lenstra, Adi Shamir. 35-52 [doi]
- Noisy Polynomial Interpolation and Noisy Chinese RemainderingDaniel Bleichenbacher, Phong Q. Nguyen. 53-69 [doi]
- A Chosen Messages Attack on the ISO/IEC 9796-1 Signature SchemeFrançois Grieu. 70-80 [doi]
- Cryptanalysis of Countermeasures Proposed for Repairing ISO 9796-1Marc Girault, Jean-François Misarsky. 81-90 [doi]
- Security Analysis of the Gennaro-Halevi-Rabin Signature SchemeJean-Sébastien Coron, David Naccache. 91-101 [doi]
- On the Security of 3GPP NetworksMichael Walker. 102-103 [doi]
- One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information RetrievalEyal Kushilevitz, Rafail Ostrovsky. 104-121 [doi]
- Single Database Private Information Retrieval Implies Oblivious TransferGiovanni Di Crescenzo, Tal Malkin, Rafail Ostrovsky. 122-138 [doi]
- Authenticated Key Exchange Secure against Dictionary AttacksMihir Bellare, David Pointcheval, Phillip Rogaway. 139-155 [doi]
- Provably Secure Password-Authenticated Key Exchange Using Diffie-HellmanVictor Boyko, Philip D. MacKenzie, Sarvar Patel. 156-171 [doi]
- Fair Encryption of RSA KeysGuillaume Poupard, Jacques Stern. 172-189 [doi]
- Computing Inverses over a Shared Secret ModulusDario Catalano, Rosario Gennaro, Shai Halevi. 190-206 [doi]
- Practical Threshold SignaturesVictor Shoup. 207-220 [doi]
- Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing ErasuresStanislaw Jarecki, Anna Lysyanskaya. 221-242 [doi]
- Confirmer Signature Schemes Secure against Adaptive AdversariesJan Camenisch, Markus Michels. 243-258 [doi]
- Public-Key Encryption in a Multi-user Setting: Security Proofs and ImprovementsMihir Bellare, Alexandra Boldyreva, Silvio Micali. 259-274 [doi]
- Using Hash Functions as a Hedge against Chosen Ciphertext AttackVictor Shoup. 275-288 [doi]
- Security Aspects of Practical Quantum CryptographyGilles Brassard, Norbert Lütkenhaus, Tal Mor, Barry C. Sanders. 289-299 [doi]
- Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way PermutationPaul Dumais, Dominic Mayers, Louis Salvail. 300-315 [doi]
- General Secure Multi-party Computation from any Linear Secret-Sharing SchemeRonald Cramer, Ivan Damgård, Ueli M. Maurer. 316-334 [doi]
- Minimal-Latency Secure Function EvaluationDonald Beaver. 335-350 [doi]
- Information-Theoretic Key Agreement: From Weak to Strong Secrecy for FreeUeli M. Maurer, Stefan Wolf. 351-368 [doi]
- New Attacks on PKCS#1 v1.5 EncryptionJean-Sébastien Coron, Marc Joye, David Naccache, Pascal Paillier. 369-381 [doi]
- A NICE CryptanalysisÉliane Jaulmes, Antoine Joux. 382-391 [doi]
- Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial EquationsNicolas Courtois, Alexander Klimov, Jacques Patarin, Adi Shamir. 392-407 [doi]
- Cryptanalysis of Patarin s 2-Round Public Key System with S Boxes (2R)Eli Biham. 408-416 [doi]
- Colossus and the German Lorenz Cipher - Code Breaking in WW IIAnthony E. Sale. 417 [doi]
- Efficient Concurrent Zero-Knowledge in the Auxiliary String ModelIvan Damgård. 418-430 [doi]
- Efficient Proofs that a Committed Number Lies in an IntervalFabrice Boudot. 431-444 [doi]
- A Composition Theorem for Universal One-Way Hash FunctionsVictor Shoup. 445-452 [doi]
- Exposure-Resilient Functions and All-or-Nothing TransformsRan Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz, Amit Sahai. 453-469 [doi]
- The Sum of PRPs Is a Secure PRFStefan Lucks. 470-484 [doi]
- Construction of Nonlinear Boolean Functions with Important Cryptographic PropertiesPalash Sarkar, Subhamoy Maitra. 485-506 [doi]
- Propagation Characteristics and Correlation-Immunity of Highly Nonlinear Boolean FunctionsAnne Canteaut, Claude Carlet, Pascale Charpin, Caroline Fontaine. 507-522 [doi]
- Cox-Rower Architecture for Fast Parallel Montgomery MultiplicationShin-ichi Kawamura, Masanobu Koike, Fumihiko Sano, Atsushi Shimbo. 523-538 [doi]
- Efficient Receipt-Free Voting Based on Homomorphic EncryptionMartin Hirt, Kazue Sako. 539-556 [doi]
- How to Break a Practical MIX and Design a New OneYvo Desmedt, Kaoru Kurosawa. 557-572 [doi]
- Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5Anne Canteaut, Michaël Trabbia. 573-588 [doi]
- Advanced Slide AttacksAlex Biryukov, David Wagner. 589-606 [doi]