MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "On basing one-way functions on NP-hardness." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 5 documents found, showing 1 through 5.
ATOM RSS
  • On basing one-way functions on NP-hardness  
  • by Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz — 2006 — In Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing
  • …On Basing One-Way Functions on NP-Hardness Adi Akavia ∗ Oded Goldreich † Shafi Goldwasser ‡ Dana…
  • Cited by 10 (1 self) – Add To MetaCart
  • On Worst-Case to Average-Case Reductions for NP Problems  
  • by Andrej Bogdanov Luca, Luca Trevisan — 2003 — In Proceedings of the 44th IEEE Symposium on Foundations of Computer Science
  • … our results also rule out the possibility of basing one-way functions on NP-hardness using non…
  • Add To MetaCart
  • On Worst-Case to Average-Case Reductions for NP Problems  
  • by Andrej Bogdanov Adib, Andrej Bogdanov, Luca Trevisan — 2003 — In Proceedings of the 44th IEEE Symposium on Foundations of Computer Science
  • …-adaptive reductions) to base the average-case hardness of a problem in NP or the security of a one-way function…
  • Add To MetaCart
Help! Showing 1 through 5.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB