On building fine-grained one-way functions from strong average-case hardness
type: Item
instance of: scholarly article
title: On building fine-grained one-way functions from strong average-case hardness
author: Chris Brzuska
author: Geoffroy Couteau
published in: Journal of Cryptology
publication date: 2025-01-17T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 7969360
zbMATH Keywords: oracle separation
zbMATH Keywords: fine-grained one-way function
zbMATH Keywords: average-case hardness
zbMATH Keywords: exponential hardness
zbMATH Keywords: pessiland
MaRDI profile type: Publication
cites work: On basing one-way functions on NP-hardness
cites work: On Basing Size-Verifiable One-Way Functions on NP-Hardness
cites work: Notions of Black-Box Reductions, Revisited
cites work: Basing Weak Public-Key Cryptography on Strong One-Way Functions
cites work: Merkle Puzzles in a Quantum World
cites work: Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
cites work: Average-case fine-grained hardness
cites work: Proofs of Work from worst-case assumptions
cites work: Random oracles and non-uniformity
cites work: Q6126276
cites work: Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
cites work: Fine-Grained Cryptography
cites work: Random-Self-Reducibility of Complete Sets
cites work: A cryptanalytic time-memory trade-off
cites work: Average-case hardness of NP from exponential worst-case hardness assumptions
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Q5750403
cites work: Average Case Complete Problems
cites work: Public-key cryptography in the fine-grained setting
cites work: Secure communications over insecure channels
cites work: Security Proofs for Signature Schemes
cites work: Theory of Cryptography
cites work: Q4249649
cites work: Random Oracles and Auxiliary Input
DOI: 10.1007/S00145-024-09518-1
description: scientific article; zbMATH DE number 7969360