Abstract is missing.
- Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt 2001Craig Gentry, Jakob Jonsson, Jacques Stern, Michael Szydlo. 1-20 [doi]
- On the Insecurity of a Server-Aided RSA ProtocolPhong Q. Nguyen, Igor Shparlinski. 21-35 [doi]
- The Modular Inversion Hidden Number ProblemDan Boneh, Shai Halevi, Nick Howgrave-Graham. 36-51 [doi]
- Secure Human Identification ProtocolsNicholas J. Hopper, Manuel Blum. 52-66 [doi]
- Unbelievable Security. Matching AES Security Using Public Key SystemsArjen K. Lenstra. 67-86 [doi]
- A Probable Prime Test with Very High Confidence for n equiv 1 mod 4Siguna Müller. 87-106 [doi]
- Computation of Discrete Logarithms in F::2:::607:::::Emmanuel Thomé. 107-124 [doi]
- Speeding Up XTRMartijn Stam, Arjen K. Lenstra. 125-143 [doi]
- An Efficient Implementation of Braid GroupsJae Choon Cha, Ki Hyoung Ko, Sangjin Lee, Jae Woo Han, Jung Hee Cheon. 144-156 [doi]
- How to Achieve a McEliece-Based Digital Signature SchemeNicolas Courtois, Matthieu Finiasz, Nicolas Sendrier. 157-174 [doi]
- Efficient Traitor Tracing Algorithms Using List DecodingAlice Silverberg, Jessica Staddon, Judy L. Walker. 175-192 [doi]
- Security of Reduced Version of the Block Cipher Camellia against Truncated and Impossible Differential CryptanalysisMakoto Sugita, Kazukuni Kobara, Hideki Imai. 193-207 [doi]
- Known-IV Attacks on Triple Modes of Operation of Block CiphersDeukjo Hong, Jaechul Sung, Seokhie Hong, Wonil Lee, Sangjin Lee, Jongin Lim, Okyeon Yi. 208-221 [doi]
- Generic Attacks on Feistel SchemesJacques Patarin. 222-238 [doi]
- A Compact Rijndael Hardware Architecture with S-Box OptimizationAkashi Satoh, Sumio Morioka, Kohji Takano, Seiji Munetoh. 239-254 [doi]
- Provable Security of KASUMI and 3GPP Encryption Mode f8Ju-Sung Kang, Sang Uk Shin, Dowon Hong, Okyeon Yi. 255-271 [doi]
- Efficient and Mutually Authenticated Key Exchange for Low Power Computing DevicesDuncan S. Wong, Agnes Hui Chan. 272-289 [doi]
- Provably Authenticated Group Diffie-Hellman Key Exchange - The Dynamic CaseEmmanuel Bresson, Olivier Chevassut, David Pointcheval. 290-309 [doi]
- Fully Distributed Threshold RSA under Standard AssumptionsPierre-Alain Fouque, Jacques Stern. 310-330 [doi]
- Adaptive Security in the Threshold Setting: From Cryptosystems to Signature SchemesAnna Lysyanskaya, Chris Peikert. 331-350 [doi]
- Threshold Cryptosystems Secure against Chosen-Ciphertext AttacksPierre-Alain Fouque, David Pointcheval. 351-368 [doi]
- Oblivious Polynomial Evaluation and Oblivious Neural LearningYan-Cheng Chang, Chi-Jen Lu. 369-384 [doi]
- Mutually Independent CommitmentsMoses Liskov, Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Adam Smith. 385-401 [doi]
- Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRankNicolas Courtois. 402-421 [doi]
- Responsive Round Complexity and Concurrent Zero-KnowledgeTzafrir Cohen, Joe Kilian, Erez Petrank. 422-441 [doi]
- Practical Construction and Analysis of Pseudo-Randomness PrimitivesJohan Håstad, Mats Näslund. 442-459 [doi]
- Autocorrelation Coefficients and Correlation Immunity of Boolean FunctionsYuriy Tarannikov, Peter Korolev, Anton Botev. 460-479 [doi]
- An Extension of Kedlaya s Point-Counting Algorithm to Superelliptic CurvesPierrick Gaudry, Nicolas Gürel. 480-494 [doi]
- Supersingular Curves in CryptographySteven D. Galbraith. 495-513 [doi]
- Short Signatures from the Weil PairingDan Boneh, Ben Lynn, Hovav Shacham. 514-532 [doi]
- Self-Blindable Credential Certificates from the Weil PairingEric R. Verheul. 533-551 [doi]
- How to Leak a SecretRonald L. Rivest, Adi Shamir, Yael Tauman. 552-565 [doi]
- Key-Privacy in Public-Key EncryptionMihir Bellare, Alexandra Boldyreva, Anand Desai, David Pointcheval. 566-582 [doi]
- Provably Secure Fair Blind Signatures with Tight RevocationMasayuki Abe, Miyako Ohkubo. 583-602 [doi]