Abstract
We give the first demonstration of the cryptographic hardness of the Goldreich-Goldwasser-Micali (GGM) function family when the secret key is exposed. We prove that for any constant ϵ > 0, the GGM family is a 1/n2+ϵ-weakly one-way family of functions, when the lengths of secret key, inputs, and outputs are equal. Namely, any efficient algorithm fails to invert GGM with probability at least 1/n2+ϵ – even when given the secret key. Additionally, we state natural conditions under which the GGM family is strongly one-way.
Cite
CITATION STYLE
Cohen, A., & Klein, S. (2016). The GGM function family is a weakly one-way family of functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9985 LNCS, pp. 84–107). Springer Verlag. https://doi.org/10.1007/978-3-662-53641-4_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
