Pages that link to "Item:Q2811126"
From MaRDI portal
The following pages link to Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model (Q2811126):
Displayed 13 items.
- Private information retrieval with sublinear online time (Q2055601) (← links)
- Adaptively secure constrained pseudorandom functions in the standard model (Q2096499) (← links)
- Constrained pseudorandom functions from functional encryption (Q2290626) (← links)
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (Q2319626) (← links)
- Incremental symmetric puncturable encryption with support for unbounded number of punctures (Q2697484) (← links)
- Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation (Q5738765) (← links)
- Constraining Pseudorandom Functions Privately (Q5738766) (← links)
- Private Puncturable PRFs from Standard Lattice Assumptions (Q5738885) (← links)
- Verifiable random functions from non-interactive witness-indistinguishable proofs (Q5918799) (← links)
- Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness (Q6085266) (← links)
- Adaptive multiparty NIKE (Q6114272) (← links)
- Constrained (Verifiable) Pseudorandom Function from Functional Encryption (Q6163657) (← links)
- \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH (Q6186714) (← links)