skip to main content
10.1145/1806689.1806798acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
erratum

Erratum for: on basing one-way functions on NP-hardness

Published: 05 June 2010 Publication History

Abstract

This is an errata for our STOC'06 paper, "On Basing One-Way Functions on NP-Hardness".
There is a gap in the proof of our results regarding adaptive reductions, and we currently do not know whether Theorem 3 (as stated in Section 2) holds.

Cited By

View all

Index Terms

  1. Erratum for: on basing one-way functions on NP-hardness

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    STOC '10: Proceedings of the forty-second ACM symposium on Theory of computing
    June 2010
    812 pages
    ISBN:9781450300506
    DOI:10.1145/1806689

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 05 June 2010

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. average case complexity
    2. erratum
    3. one-way function
    4. worst case complexity

    Qualifiers

    • Erratum

    Conference

    STOC'10
    Sponsor:
    STOC'10: Symposium on Theory of Computing
    June 5 - 8, 2010
    Massachusetts, Cambridge, USA

    Acceptance Rates

    Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

    Upcoming Conference

    STOC '25
    57th Annual ACM Symposium on Theory of Computing (STOC 2025)
    June 23 - 27, 2025
    Prague , Czech Republic

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)6
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 17 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Fine-Grained Polynomial Functional EncryptionTheoretical Computer Science10.1016/j.tcs.2024.114730(114730)Online publication date: Jul-2024
    • (2021)Fine-Grained Cryptography RevisitedJournal of Cryptology10.1007/s00145-021-09390-334:3Online publication date: 24-May-2021
    • (2020)On Nonadaptive Reductions to the Set of Random Strings and Its Dense SubsetsComplexity and Approximation10.1007/978-3-030-41672-0_6(67-79)Online publication date: 21-Feb-2020
    • (2019)Fine-Grained Cryptography RevisitedAdvances in Cryptology – ASIACRYPT 201910.1007/978-3-030-34618-8_22(637-666)Online publication date: 22-Nov-2019
    • (2015)On Basing Size-Verifiable One-Way Functions on NP-HardnessTheory of Cryptography10.1007/978-3-662-46494-6_1(1-6)Online publication date: 2015

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media