1. Special Issue On Worst-case Versus Average-case Complexity Editors’ Foreword

   • Oded Goldreich
   • Salil Vadhan

   OriginalPaper Open access 05 December 2007 Pages: 325 - 330

2. Pseudorandomness and Average-Case Complexity Via Uniform Reductions

   • Luca Trevisan
   • Salil Vadhan

   OriginalPaper Open access 05 December 2007 Pages: 331 - 364

3. Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions

   • Daniele Micciancio

   OriginalPaper Open access 05 December 2007 Pages: 365 - 411

4. If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances

   • Dan Gutfreund
   • Ronen Shaltiel
   • Amnon Ta-Shma

   OriginalPaper Open access 05 December 2007 Pages: 412 - 441