UOWHFs from OWFs: Trading Regularity for Efficiency

DOI10.1007/978-3-642-33481-8_13zbMath1304.94034OpenAlexW38405524MaRDI QIDQ2915125

Kfir Barhum, Ueli M. Maurer

Publication date: 21 September 2012

Published in: Progress in Cryptology – LATINCRYPT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33481-8_13

zbMATH Keywords

one-way functionscomputational entropycomplexity-based cryptographyuniversal one-way hash functions

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (4)

(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 ⋮ Unnamed Item

This page was built for publication: UOWHFs from OWFs: Trading Regularity for Efficiency