Backward private dynamic searchable encryption with update pattern
From MaRDI portal
Cites work
- Adaptively secure puncturable pseudorandom functions in the standard model
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
- Constrained pseudorandom functions and their applications
- Constraining pseudorandom functions privately
- Functional signatures and pseudorandom functions
- How to use indistinguishability obfuscation
- Key homomorphic PRFs and their applications
- Key-homomorphic constrained pseudorandom functions
- Privacy Preserving Keyword Searches on Remote Encrypted Data
- Private puncturable PRFs from standard lattice assumptions
- \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
This page was built for publication: Backward private dynamic searchable encryption with update pattern
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6494606)