Publications

5 results at STOC 1998

Shortest vector problem in L₂ is NP-hard for randomized reductions
- - Miklos Ajtai
- 1998
- STOC 1998
Random oracle methodology, revisited
- - R. Canetti
  - Oded Goldreich
  - et al.
- 1998
- STOC 1998
Perfectly one-way probabilistic hash functions
- - R. Canetti
  - Daniele Micciancio
  - et al.
- 1998
- STOC 1998
Concurrent zero-knowledge
- - Cynthia Dwork
  - Moni Naor
  - et al.
- 1998
- STOC 1998
Closure of monadic NP
- - Miklos Ajtai
  - Ronald Fagin
  - et al.
- 1998
- STOC 1998

Shortest vector problem in L2 is NP-hard for randomized reductions