Constrained Pseudorandom Functions for Unconstrained Inputs

DOI10.1007/978-3-662-49896-5_5zbMath1400.94140OpenAlexW2480137216MaRDI QIDQ5739200

Apoorvaa Deshpande, Venkata Koppula, Brent Waters

Publication date: 15 July 2016

Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49896-5_5

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Adaptive multiparty NIKE ⋮ Constrained (Verifiable) Pseudorandom Function from Functional Encryption ⋮ Short attribute-based signatures for arbitrary Turing machines from standard assumptions ⋮ Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Constrained pseudorandom functions from functional encryption ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation

This page was built for publication: Constrained Pseudorandom Functions for Unconstrained Inputs