A Cookbook for Black-Box Separations and a Recipe for UOWHFs

DOI10.1007/978-3-642-36594-2_37zbMath1315.94053OpenAlexW152191533MaRDI QIDQ4910304

Thomas Holenstein, Kfir Barhum

Publication date: 18 March 2013

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36594-2_37

zbMATH Keywords

lower boundsone-way functionsblack-box constructionscomplexity-based cryptographyuniversal one-way hash functions

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

(Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and Beyond ⋮ Non-adaptive universal one-way hash functions from arbitrary one-way functions ⋮ Simple constructions from (almost) regular one-way functions

This page was built for publication: A Cookbook for Black-Box Separations and a Recipe for UOWHFs