Abstract is missing.
- Analysis of Bernstein s Factorization CircuitArjen K. Lenstra, Adi Shamir, Jim Tomlinson, Eran Tromer. 1-26 [doi]
- A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown OrderStefan Lucks. 27-45 [doi]
- Looking beyond XTRWieb Bosma, James Hutton, Eric R. Verheul. 46-63 [doi]
- Bounds for Robust Metering Schemes and Their Relationship with A-codeWakaha Ogata, Kaoru Kurosawa. 64-80 [doi]
- Unconditionally Secure Anonymous Encryption and Group AuthenticationGoichiro Hanaoka, Junji Shikata, Yumiko Hanaoka, Hideki Imai. 81-99 [doi]
- Adapting the Weaknesses of the Random Oracle Model to the Generic Group ModelAlexander W. Dent. 100-109 [doi]
- On the Impossibilities of Basing One-Way Permutations on Central Cryptographic PrimitivesYan-Cheng Chang, Chun-Yun Hsiao, Chi-Jen Lu. 110-124 [doi]
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden OrderIvan Damgård, Eiichiro Fujisaki. 125-142 [doi]
- Efficient Oblivious Transfer in the Bounded-Storage ModelDowon Hong, Ku-Young Chang, Heuisu Ryu. 143-159 [doi]
- In How Many Ways Can You Write Rijndael?Elad Barkan, Eli Biham. 160-175 [doi]
- On the Security of Rijndael-Like Structures against Differential and Linear CryptanalysisSangwoo Park, Soo Hak Sung, Seongtaek Chee, E-Joong Yoon, Jongin Lim. 176-191 [doi]
- Threshold Cryptosystems Based on FactoringJonathan Katz, Moti Yung. 192-205 [doi]
- Non-interactive Distributed-Verifier Proofs and Proving Relations among CommitmentsMasayuki Abe, Ronald Cramer, Serge Fehr. 206-223 [doi]
- Asynchronous Secure Communication Tolerating Mixed AdversariesK. Srinathan, M. V. N. Ashwin Kumar, C. Pandu Rangan. 224-242 [doi]
- Amplified Boomerang Attack against Reduced-Round SHACALJongsung Kim, Dukjae Moon, Wonil Lee, Seokhie Hong, Sangjin Lee, Seokwon Jung. 243-253 [doi]
- Enhancing Differential-Linear CryptanalysisEli Biham, Orr Dunkelman, Nathan Keller. 254-266 [doi]
- Cryptanalysis of Block Ciphers with Overdefined Systems of EquationsNicolas Courtois, Josef Pieprzyk. 267-287 [doi]
- Analysis of Neural CryptographyAlexander Klimov, Anton Mityagin, Adi Shamir. 288-298 [doi]
- The Hardness of Hensel Lifting: The Case of RSA and Discrete LogarithmDario Catalano, Phong Q. Nguyen, Jacques Stern. 299-310 [doi]
- A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2Pierrick Gaudry. 311-327 [doi]
- A General Formula of the (t, n)-Threshold Visual Secret Sharing SchemeHiroki Koga. 328-345 [doi]
- On Unconditionally Secure Robust Distributed Key Distribution CentersPaolo D Arco, Douglas R. Stinson. 346-363 [doi]
- Short Signatures in the Random Oracle ModelLouis Granboulan. 364-378 [doi]
- The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature SchemesAlejandro Hevia, Daniele Micciancio. 379-396 [doi]
- Transitive Signatures Based on Factoring and RSAMihir Bellare, Gregory Neven. 397-414 [doi]
- 1-out-of-n Signatures from a Variety of KeysMasayuki Abe, Miyako Ohkubo, Koutarou Suzuki. 415-432 [doi]
- A Revocation Scheme with Minimal Storage at ReceiversTomoyuki Asano. 433-450 [doi]
- Optimistic Mixing for Exit-PollsPhilippe Golle, Sheng Zhong, Dan Boneh, Markus Jakobsson, Ari Juels. 451-465 [doi]
- Improved Construction of Nonlinear Resilient S-BoxesKishan Chand Gupta, Palash Sarkar. 466-483 [doi]
- An Upper Bound on the Number of m-Resilient Boolean FunctionsClaude Carlet, Aline Gouget. 484-496 [doi]
- Group Diffie-Hellman Key Exchange Secure against Dictionary AttacksEmmanuel Bresson, Olivier Chevassut, David Pointcheval. 497-514 [doi]
- Secure Channels Based on Authenticated Encryption Schemes: A Simple CharacterizationChanathip Namprempre. 515-532 [doi]
- ID-Based Blind Signature and Ring Signature from PairingsFangguo Zhang, Kwangjo Kim. 533-547 [doi]
- Hierarchical ID-Based CryptographyCraig Gentry, Alice Silverberg. 548-566 [doi]
- Crypto-integrityMoti Yung. 567-573 [doi]
- Gummy and Conductive Silicone Rubber FingersTsutomu Matsumoto. 574-576 [doi]