Journal of Cryptology, Volume 17

Volume 17, Number 1, January 2004

• Oded Goldreich:
  Preface. 1-3
  
• Stefan Dziembowski, Ueli M. Maurer:
  Optimal Randomizer Efficiency in the Bounded-Storage Model. 5-26
  
• Chi-Jen Lu:
  Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors. 27-42
  
• Salil P. Vadhan:
  Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model. 43-77
  

Volume 17, Number 2, March 2004

• Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointcheval, Jacques Stern:
  RSA-OAEP Is Secure under the RSA Assumption. 81-104
  
• Michael J. Wiener:
  The Full Cost of Cryptanalytic Attacks. 105-124
  
• Amos Beimel, Yuval Ishai, Tal Malkin:
  Reducing the Servers' Computation in Private Information Retrieval: PIR with Preprocessing. 125-151
  

Volume 17, Number 3, June 2004

• Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin:
  Adaptive versus Non-Adaptive Security of Multi-Party Protocols. 153-207
  
• Gustav Hast:
  Nearly One-Sided Tests and the Goldreich?Levin Predicate. 209-229
  

Volume 17, Number 4, September 2004

• Arjen K. Lenstra:
  Preface. 233
  
• Victor S. Miller:
  The Weil Pairing, and Its Efficient Calculation. 235-261
  
• Antoine Joux:
  A One Round Protocol for Tripartite Diffie-Hellman. 263-276
  
• Eric R. Verheul:
  Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems. 277-296
  
• Dan Boneh, Ben Lynn, Hovav Shacham:
  Short Signatures from the Weil Pairing. 297-319
  
• Paulo S. L. M. Barreto, Ben Lynn, Michael Scott:
  Efficient Implementation of Pairing-Based Cryptosystems. 321-334
  

Last update Wed Feb 15 05:38:28 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page