Universal One-Way Hash Functions via Inaccessible Entropy

DOI10.1007/978-3-642-13190-5_31zbMath1280.94065OpenAlexW2155972716MaRDI QIDQ3563858

Hoeteck Wee, Thomas Holenstein, Iftach Haitner, Omer Reingold, Salil P. Vadhan

Publication date: 1 June 2010

Published in: Advances in Cryptology – EUROCRYPT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13190-5_31

zbMATH Keywords

computational complexitycryptographyhashingone-way functionstarget collision-resistance

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (11)

(Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and Beyond ⋮ Locally computable UOWHF with linear shrinkage ⋮ Non-adaptive universal one-way hash functions from arbitrary one-way functions ⋮ Indistinguishable Proofs of Work or Knowledge ⋮ Simple constructions from (almost) regular one-way functions ⋮ Computational fuzzy extractors ⋮ Simple hash function using discrete-time quantum walks ⋮ On the (im-)possibility of extending coin toss ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Many Entropies in One-Way Functions

This page was built for publication: Universal One-Way Hash Functions via Inaccessible Entropy