Adaptively secure puncturable pseudorandom functions in the standard model
From MaRDI portal
Publication:2811126
DOI10.1007/978-3-662-48797-6_4zbMATH Open1396.94084OpenAlexW2280248542MaRDI QIDQ2811126FDOQ2811126
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
Recommendations
Cited In (16)
- Constraining Pseudorandom Functions Privately
- Private Puncturable PRFs from Standard Lattice Assumptions
- From non-adaptive to adaptive pseudorandom functions
- Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Constrained (Verifiable) Pseudorandom Function from Functional Encryption
- \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH
- Adaptive multiparty NIKE
- Private information retrieval with sublinear online time
- Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
- Adaptively secure constrained pseudorandom functions in the standard model
- Backward private dynamic searchable encryption with update pattern
- Constrained pseudorandom functions from functional encryption
- Adaptively secure puncturable pseudorandom functions via puncturable identity-based KEMs
- Incremental symmetric puncturable encryption with support for unbounded number of punctures
This page was built for publication: Adaptively secure puncturable pseudorandom functions in the standard model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811126)
