Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN

Abstract

Pseudorandom functions (PRFs) play a central role in symmetric cryptography. While in principle they can be built from any one-way functions by going through the generic HILL (SICOMP 1999) and GGM (JACM 1986) transforms, some of these steps are inherently sequential and far from practical. Naor, Reingold (FOCS 1997) and Rosen (SICOMP 2002) gave… (More)
DOI: 10.1007/978-3-662-49896-5_6

1 Figure or Table

Topics

  • Presentations referencing similar topics