A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Locally Computable UOWHF with Linear Shrinkage
2016
Journal of Cryptology
We study the problem of constructing locally computable Universal One-Way Hash Functions (UOWHFs) H : {0, 1} n → {0, 1} m . A construction with constant output locality, where every bit of the output depends only on a constant number of bits of the input, was established by [Applebaum, Ishai, and Kushilevitz, SICOMP 2006]. However, this construction suffers from two limitations: (1) It can only achieve a sub-linear shrinkage of n − m = n 1− ; and (2) It has a super-constant input locality,
doi:10.1007/s00145-016-9232-x
fatcat:o6n6pjucuremla3d2csjrnihty