Journal of Cryptology, Volume 23

Volume 23, Number 1, January 2010

• Oded Goldreich:
  On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits. 1-36
  
• Eran Tromer, Dag Arne Osvik, Adi Shamir:
  Efficient Cache Attacks on AES, and Countermeasures. 37-71
  
• Lars R. Knudsen, John Erik Mathiassen, Frédéric Muller, Søren S. Thomsen:
  Cryptanalysis of MD2. 72-90
  
• Yvo Desmedt, Rosario Gennaro, Kaoru Kurosawa, Victor Shoup:
  A New and Improved Paradigm for Hybrid Encryption Secure Against Chosen-Ciphertext Attack. 91-120
  
• Dennis Hofheinz, John Malone-Lee, Martijn Stam:
  Obfuscation for Cryptographic Purposes. 121-168
  

Volume 23, Number 2, April 2010

• Daniele Micciancio:
  The RSA Group is Pseudo-Free. 169-186
  
• Paul Morrissey, Nigel P. Smart, Bogdan Warinschi:
  The TLS Handshake Protocol: A Modular Analysis. 187-223
  
• David Freeman, Michael Scott, Edlyn Teske:
  A Taxonomy of Pairing-Friendly Elliptic Curves. 224-280
  
• Yonatan Aumann, Yehuda Lindell:
  Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. 281-343
  
• Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb:
  How Should We Solve Search Problems Privately? 344-371
  

Volume 23, Number 3, July 2010

• Gagan Aggarwal, Nina Mishra, Benny Pinkas:
  Secure Computation of the Median (and Other Elements of Specified Ranks). 373-401
  
• Jonathan Katz, Ji Sun Shin, Adam Smith:
  Parallel and Concurrent Security of the HB and HB⁺ Protocols. 402-421
  
• Carmit Hazay, Yehuda Lindell:
  Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. 422-456
  
• Jung Hee Cheon:
  Discrete Logarithm Problems with Auxiliary Inputs. 457-476
  
• Elisavet Konstantinou, Aristides Kontogeorgis, Yannis C. Stamatiou, Christos D. Zaroliagis:
  On the Efficient Generation of Prime-Order Elliptic Curves. 477-503
  

Volume 23, Number 4, October 2010

• Alex Biryukov, Adi Shamir:
  Structural Cryptanalysis of SASAS. 505-518
  
• John Black, Phillip Rogaway, Thomas Shrimpton, Martijn Stam:
  An Analysis of the Blockcipher-Based Hash Functions from PGV. 519-545
  
• Jens Groth:
  A Verifiable Secret Shuffle of Homomorphic Encryptions. 546-579
  
• Omer Barkol, Yuval Ishai, Enav Weinreb:
  On d-Multiplicative Secret Sharing. 580-593
  
• Jörn Müller-Quade, Dominique Unruh:
  Long-Term Security and Universal Composability. 594-671
  

Last update Tue May 21 19:17:53 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page