Reducing Depth in Constrained PRFs: From Bit-Fixing to $$\mathbf {NC}^{1}$$

DOI10.1007/978-3-662-49387-8_14zbMath1395.94272OpenAlexW2296098703MaRDI QIDQ2798807

Nishanth Chandran, Srinivasan Raghuraman, Dhinakaran Vinayagamurthy

Publication date: 13 April 2016

Published in: Public-Key Cryptography – PKC 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49387-8_14

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Adaptive multiparty NIKE ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs

This page was built for publication: Reducing Depth in Constrained PRFs: From Bit-Fixing to $$\mathbf {NC}^{1}$$