Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model

DOI10.1007/978-3-662-48797-6_4zbMath1396.94084OpenAlexW2280248542MaRDI QIDQ2811126

Susan Hohenberger, Brent Waters, Venkata Koppula

Publication date: 10 June 2016

Published in: Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48797-6_4

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (13)

Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Adaptive multiparty NIKE ⋮ Constrained (Verifiable) Pseudorandom Function from Functional Encryption ⋮ \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH ⋮ Incremental symmetric puncturable encryption with support for unbounded number of punctures ⋮ Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation ⋮ Constraining Pseudorandom Functions Privately ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Constrained pseudorandom functions from functional encryption ⋮ Private information retrieval with sublinear online time ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Adaptively secure constrained pseudorandom functions in the standard model

This page was built for publication: Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model