Locally computable UOWHF with linear shrinkage
From MaRDI portal
Publication:2408584
DOI10.1007/s00145-016-9232-xzbMath1377.94028OpenAlexW2919836788MaRDI QIDQ2408584
Publication date: 12 October 2017
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-016-9232-x
Related Items (3)
Non-adaptive universal one-way hash functions from arbitrary one-way functions ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Correction to: ``Locally computable UOWHF with linear shrinkage
Cites Work
- Unnamed Item
- Unnamed Item
- Cryptography in constant parallel time
- Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
- Cryptography with constant input locality
- Computationally private randomizing polynomials and their applications
- A Dichotomy for Local Small-Bias Generators
- Input Locality and Hardness Amplification
- Candidate One-Way Functions Based on Expander Graphs
- Expander codes
- Universal One-Way Hash Functions via Inaccessible Entropy
- Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms
- Randomness conductors and constant-degree lossless expanders
- Constructive Proofs of Concentration Bounds
- Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms
- On the Security of Goldreich’s One-Way Function
- Foundations of Cryptography
- Pseudorandom Generators with Long Stretch and Low Locality from Random Local One-Way Functions
- Fast Software Encryption
- Cryptography in $NC^0$
- On the solution-space geometry of random constraint satisfaction problems
This page was built for publication: Locally computable UOWHF with linear shrinkage
