Security-preserving hardness-amplification for any regular one-way function

DOI10.1145/301250.301296zbMATH Open1345.94056OpenAlexW2043766162MaRDI QIDQ2819544

Giovanni Di Crescenzo, Russell Impagliazzo

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301296

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation ⋮ A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch

Recommendations

• On the security of Goldreich's one-way function 👍 👎
• On hardness of one-way functions 👍 👎
• Non-interactive secure computation from one-way functions 👍 👎
• On building fine-grained one-way functions from strong average-case hardness 👍 👎
• On basing one-way functions on NP-hardness 👍 👎
• On the Security of Goldreich’s One-Way Function 👍 👎
• Theory of Cryptography 👍 👎
• One-Way Functions and (Im)perfect Obfuscation 👍 👎
• Theory of Cryptography 👍 👎

This page was built for publication: Security-preserving hardness-amplification for any regular one-way function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819544)