Abstract is missing.
- A Generalized Wiener Attack on RSAJohannes Blömer, Alexander May. 1-13 [doi]
- Cryptanalysis of a Public-Key Encryption Scheme Based on the Polynomial Reconstruction ProblemJean-Sébastien Coron. 14-27 [doi]
- Faster Scalar Multiplication on Koblitz Curves Combining Point Halving with the Frobenius EndomorphismRoberto Maria Avanzi, Mathieu Ciet, Francesco Sica. 28-40 [doi]
- Application of Montgomery s Trick to Scalar Multiplication for Elliptic and Hyperelliptic Curves Using a Fixed Base PointPradeep Kumar Mishra, Palash Sarkar. 41-54 [doi]
- Fast Arithmetic on Jacobians of Picard CurvesStéphane Flon, Roger Oyono. 55-68 [doi]
- Undeniable Signatures Based on Characters: How to Sign with One BitJean Monnerat, Serge Vaudenay. 69-85 [doi]
- Efficient Extension of Standard Schnorr/RSA Signatures into Universal Designated-Verifier SignaturesRon Steinfeld, Huaxiong Wang, Josef Pieprzyk. 86-100 [doi]
- Constructing Committed Signatures from Strong-RSA Assumption in the Standard Complexity ModelHuafei Zhu. 101-114 [doi]
- Constant Round Authenticated Group Key Agreement via Distributed ComputationEmmanuel Bresson, Dario Catalano. 115-129 [doi]
- Efficient ID-based Group Key Agreement with Bilinear MapsKyu Young Choi, Jung Yeon Hwang, Dong-Hoon Lee. 130-144 [doi]
- New Security Results on Encrypted Key ExchangeEmmanuel Bresson, Olivier Chevassut, David Pointcheval. 145-158 [doi]
- New Results on the Hardness of Diffie-Hellman BitsMaria Isabel Gonzalez Vasco, Mats Näslund, Igor Shparlinski. 159-172 [doi]
- Short Exponent Diffie-Hellman ProblemsTakeshi Koshiba, Kaoru Kurosawa. 173-186 [doi]
- Efficient Signcryption with Key Privacy from Gap Diffie-Hellman GroupsBenoît Libert, Jean-Jacques Quisquater. 187-200 [doi]
- Algebraic Attacks over GF(2:::k:::), Application to HFE Challenge 2 and Sflash-v2Nicolas Courtois. 201-217 [doi]
- Secret Exponent Attacks on RSA-type Schemes with Moduli N= p:::r:::qAlexander May. 218-230 [doi]
- General Group Authentication Codes and Their Relation to Unconditionally-Secure Signatures Reihaneh Safavi-Naini, Luke McAven, Moti Yung. 231-247 [doi]
- From Digital Signature to ID-based Identification/SignatureKaoru Kurosawa, Swee-Huay Heng. 248-261 [doi]
- Identity-Based Threshold DecryptionJoonsang Baek, Yuliang Zheng. 262-276 [doi]
- An Efficient Signature Scheme from Bilinear Pairings and Its ApplicationsFangguo Zhang, Reihaneh Safavi-Naini, Willy Susilo. 277-290 [doi]
- An RSA Family of Trap-Door Permutations with a Common Domain and Its ApplicationsRyotaro Hayashi, Tatsuaki Okamoto, Keisuke Tanaka. 291-304 [doi]
- A New Variant of the Matsumoto-Imai Cryptosystem through PerturbationJintai Ding. 305-318 [doi]
- Efficient, Verifiable Shuffle Decryption and Its Requirement of UnlinkabilityJun Furukawa. 319-332 [doi]
- A Point Compression Method for Elliptic Curves Defined over GF(2 n)Brian King. 333-345 [doi]
- On the Optimal Parameter Choice for Elliptic Curve Cryptosystems Using IsogenyToru Akishita, Tsuyoshi Takagi. 346-359 [doi]
- On the Security of Multiple Encryption or CCA-security+CCA-security=CCA-security?Rui Zhang 0002, Goichiro Hanaoka, Junji Shikata, Hideki Imai. 360-374 [doi]
- QuasiModo: Efficient Certificate Validation and RevocationFarid F. Elwailly, Craig Gentry, Zulfikar Ramzan. 375-388 [doi]
- A Distributed Online Certificate Status Protocol with a Single Public KeySatoshi Koga, Kouichi Sakurai. 389-401 [doi]
- A First Approach to Provide Anonymity in Attribute CertificatesVicente Benjumea, Javier Lopez, José A. Montenegro, José M. Troya. 402-415 [doi]
- A Nonuniform Algorithm for the Hidden Number Problem in SubgroupsIgor Shparlinski, Arne Winterhof. 416-424 [doi]
- Cryptographic Randomized Response TechniquesAndris Ambainis, Markus Jakobsson, Helger Lipmaa. 425-438 [doi]
- A Correct, Private, and Efficient Mix NetworkKun Peng, Colin Boyd, Ed Dawson, Kapalee Viswanathan. 439-454 [doi]