Abstract is missing.
- The XTR Public Key SystemArjen K. Lenstra, Eric R. Verheul. 1-19 [doi]
- A Chosen-Ciphertext Attack against NTRUÉliane Jaulmes, Antoine Joux. 20-35 [doi]
- Privacy Preserving Data MiningYehuda Lindell, Benny Pinkas. 36-54 [doi]
- Reducing the Servers Computation in Private Information Retrieval: PIR with PreprocessingAmos Beimel, Yuval Ishai, Tal Malkin. 55-73 [doi]
- Parallel Reducibility for Information-Theoretically Secure ComputationYevgeniy Dodis, Silvio Micali. 74-92 [doi]
- Optimistic Fair Secure ComputationChristian Cachin, Jan Camenisch. 93-111 [doi]
- A Cryptographic Solution to a Game Theoretic ProblemYevgeniy Dodis, Shai Halevi, Tal Rabin. 112-130 [doi]
- Differential Fault Attacks on Elliptic Curve CryptosystemsIngrid Biehl, Bernd Meyer, Volker Müller. 131-146 [doi]
- Quantum Public-Key CryptosystemsTatsuaki Okamoto, Keisuke Tanaka, Shigenori Uchiyama. 147-165 [doi]
- New Public-Key Cryptosystem Using Braid GroupsKi Hyoung Ko, Sangjin Lee, Jung Hee Cheon, Jae Woo Han, Ju-Sung Kang, Choonsik Park. 166-183 [doi]
- Key Recovery and Forgery Attacks on the MacDES MAC AlgorithmDon Coppersmith, Lars R. Knudsen, Chris J. Mitchell. 184-196 [doi]
- CBC MACs for Arbitrary-Length Messages: The Three-Key ConstructionsJohn Black, Phillip Rogaway. 197-215 [doi]
- L-collision Attacks against Randomized MACsMichael Semanko. 216-228 [doi]
- On the Exact Security of Full Domain HashJean-Sébastien Coron. 229-235 [doi]
- Timed CommitmentsDan Boneh, Moni Naor. 236-254 [doi]
- A Practical and Provably Secure Coalition-Resistant Group Signature SchemeGiuseppe Ateniese, Jan Camenisch, Marc Joye, Gene Tsudik. 255-270 [doi]
- Provably Secure Partially Blind SignaturesMasayuki Abe, Tatsuaki Okamoto. 271-286 [doi]
- Weaknesses in the SL::2::(IF::s:::2:::::) Hashing SchemeRainer Steinwandt, Markus Grassl, Willi Geiselmann, Thomas Beth. 287-299 [doi]
- Fast Correlation Attacks through Reconstruction of Linear PolynomialsThomas Johansson, Fredrik Jönsson. 300-315 [doi]
- Sequential Traitor Tracing316-332 [doi]
- Long-Lived Broadcast EncryptionJuan A. Garay, Jessica Staddon, Avishai Wool. 333-352 [doi]
- Taming the AdversaryMartín Abadi. 353-358 [doi]
- The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key SearchAnand Desai. 359-375 [doi]
- On the Round Security of Symmetric-Key Cryptographic PrimitivesZulfikar Ramzan, Leonid Reyzin. 376-393 [doi]
- New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext AttackAnand Desai. 394-412 [doi]
- Efficient Non-malleable Commitment SchemesMarc Fischlin, Roger Fischlin. 413-431 [doi]
- Improved Non-committing Encryption Schemes Based on a General Complexity AssumptionIvan Damgård, Jesper Buus Nielsen. 432-450 [doi]
- A Note on the Round-Complexity of Concurrent Zero-KnowledgeAlon Rosen. 451-468 [doi]
- An Improved Pseudo-random Generator Based on Discrete LogRosario Gennaro. 469-481 [doi]
- Linking Classical and Quantum Key Agreement: Is There Bound Information ?Nicolas Gisin, Stefan Wolf. 482-500 [doi]
- Maximum Correlation Analysis of Nonlinear S-boxes in Stream CiphersMuxiang Zhang, Agnes Hui Chan. 501-514 [doi]
- Nonlinearity Bounds and Constructions of Resilient Boolean FunctionsPalash Sarkar, Subhamoy Maitra. 515-532 [doi]
- Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic ApplicationsJürgen Bierbrauer, Holger Schellwat. 533-544 [doi]