Journal of Cryptology, Volume 22

Volume 22, Number 1, January 2009

• Mihir Bellare, Chanathip Namprempre, Gregory Neven:
  Security Proofs for Identity-Based Identification and Signature Schemes. 1-61
  
• Wolfgang Lempken, Tran van Trung, Spyros S. Magliveras, Wandi Wei:
  A Public Key Cryptosystem Based on Non-abelian Finite Groups. 62-74
  
• Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets:
  Chernoff-Type Direct Product Theorems. 75-92
  
• Denis Xavier Charles, Kristin E. Lauter, Eyal Z. Goren:
  Cryptographic Hash Functions from Expander Graphs. 93-113
  
• Adam Bender, Jonathan Katz, Ruggero Morselli:
  Ring Signatures: Stronger Definitions, and Constructions without Random Oracles. 114-138
  

Volume 22, Number 2, April 2009

• Phong Q. Nguyen, Oded Regev:
  Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures. 139-160
  
• Yehuda Lindell, Benny Pinkas:
  A Proof of Security of Yao's Protocol for Two-Party Computation. 161-188
  
• Tal Moran, Ronen Shaltiel, Amnon Ta-Shma:
  Non-interactive Timestamping in the Bounded-Storage Model. 189-226
  
• Tamir Tassa, Nira Dyn:
  Multipartite Secret Sharing by Bivariate Interpolation. 227-258
  
• Manuel Barbosa, Andrew Moss, Dan Page:
  Constructive and Destructive Use of Compilers in Elliptic Curve Cryptography. 259-281
  

Volume 22, Number 3, July 2009

• Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel:
  Reducing Complexity Assumptions for Statistically-Hiding Commitment. 283-310
  
• John Black, Martin Cochran, Thomas Shrimpton:
  On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions. 311-329
  
• Karl Rubin, Alice Silverberg:
  Using Abelian Varieties to Improve Pairing-Based Cryptography. 330-364
  
• Nenad Dedic, Gene Itkis, Leonid Reyzin, Scott Russell:
  Upper and Lower Bounds on Black-Box Steganography. 365-394
  
• Yehuda Lindell:
  General Composition and Universal Composability in Secure Multiparty Computation. 395-428