Adaptively secure puncturable pseudorandom functions in the standard model
From MaRDI portal
Recommendations
Cited in
(19)- Private information retrieval with sublinear online time
- Adaptively secure constrained pseudorandom functions in the standard model
- Constrained pseudorandom functions from functional encryption
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- From non-adaptive to adaptive pseudorandom functions
- Incremental symmetric puncturable encryption with support for unbounded number of punctures
- From non-adaptive to adaptive pseudorandom functions
- A punctured programming approach to adaptively secure functional encryption
- 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
- 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
- Backward private dynamic searchable encryption with update pattern
- Adaptively secure puncturable pseudorandom functions via puncturable identity-based KEMs
- Constrained pseudorandom functions for inner-product predicates from weaker assumptions
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)