Journal of Cryptology, Volume 25

Volume 25, Number 1, January 2012

• Rahul Jain:
  Resource Requirements of Private Quantum Channels and Consequences for Oblivious Remote State Preparation. 1-13
  
• S. Dov Gordon, Jonathan Katz:
  Partial Fairness in Secure Two-Party Computation. 14-40
  
• Jonathan Katz:
  Which Languages Have 4-Round Zero-Knowledge Proofs? 41-56
  
• Alexandra Boldyreva, Adriana Palacio, Bogdan Warinschi:
  Secure Proxy Signature Schemes for Delegation of Signing Rights. 57-115
  
• Krzysztof Pietrzak, Douglas Wikström:
  Parallel Repetition of Computationally Sound Protocols Revisited. 116-135
  
• Wim Aerts, Eli Biham, Dieter De Moitie, Elke De Mulder, Orr Dunkelman, Sebastiaan Indesteege, Nathan Keller, Bart Preneel, Guy A. E. Vandenbosch, Ingrid Verbauwhede:
  A Practical Attack on KeeLoq. 136-157
  
• Shai Halevi, Yael Tauman Kalai:
  Smooth Projective Hashing and Two-Message Oblivious Transfer. 158-193
  

Volume 25, Number 2, April 2012

• Jung Hee Cheon, Jin Hong, Minkyu Kim:
  Accelerating Pollard's Rho Algorithm on Finite Fields. 195-242
  
• Giuseppe Ateniese, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
  Provably-Secure Time-Bound Hierarchical Key Assignment Schemes. 243-270
  
• Shoichi Hirose, Je Hong Park, Aaram Yun:
  A Simple Variant of the Merkle-Damgård Scheme with a Permutation. 271-309
  
• Tom Roeder, Rafael Pass, Fred B. Schneider:
  Multi-Verifier Signatures. 310-348
  
• Lorenz Minder, Alistair Sinclair:
  The Extended k-tree Algorithm. 349-382
  

Volume 25, Number 3, July 2012

• Carmit Hazay, Kobbi Nissim:
  Efficient Set Operations in the Presence of Malicious Adversaries. 383-433
  
• Oriol Farràs, Jaume Martí-Farré, Carles Padró:
  Ideal Multipartite Secret Sharing Schemes. 434-463
  
• Stanislav Smyshlyaev:
  Perfectly Balanced Boolean Functions and Golić Conjecture. 464-483
  
• Dennis Hofheinz, Eike Kiltz:
  Programmable Hash Functions and Their Applications. 484-527
  
• Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami:
  Computational Indistinguishability Between Quantum States and Its Cryptographic Application. 528-555
  

Volume 25, Number 4, October 2012

• Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Xiaoming Sun, Christophe Tartary, Huaxiong Wang, Andrew Chi-Chih Yao:
  Graph Coloring Applied to Secure Computation in Non-Abelian Groups. 557-600
  
• David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert:
  Bonsai Trees, or How to Delegate a Lattice Basis. 601-639
  
• Mihir Bellare, Alexandra Boldyreva, Lars R. Knudsen, Chanathip Namprempre:
  On-line Ciphers and the Hash-CBC Constructions. 640-679
  
• Yehuda Lindell, Benny Pinkas:
  Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. 680-722
  
• Jan Camenisch, Susan Hohenberger, Michael Østergaard Pedersen:
  Batch Verification of Short Signatures. 723-747
  
• Praveen Gauravaram, Lars R. Knudsen:
  Security Analysis of Randomize-Hash-then-Sign Digital Signatures. 748-779
  

Last update Sat May 25 20:44:48 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page