The following pages link to (Q4536794):
Displaying 21 items.
- Privacy-preserving verifiable delegation of polynomial and matrix functions (Q2023805) (← links)
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency (Q2051777) (← links)
- Verifiable single-server private information retrieval from LWE with binary errors (Q2055570) (← links)
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time (Q2139652) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- Permuted puzzles and cryptographic hardness (Q2175950) (← links)
- Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions (Q2306905) (← links)
- Random-index PIR and applications (Q2697885) (← links)
- An Efficient PIR Construction Using Trusted Hardware (Q3540144) (← links)
- Similarity Based Interactive Private Information Retrieval (Q5055967) (← links)
- Private Information Retrieval Using Trusted Hardware (Q5862520) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5915623) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5918328) (← links)
- Near-optimal private information retrieval with preprocessing (Q6582182) (← links)
- Lower-bounds on public-key operations in PIR (Q6637562) (← links)
- Efficient pre-processing PIR without public-key cryptography (Q6637568) (← links)
- Laconic function evaluation and ABE for RAMs from (Ring-)LWE (Q6652894) (← links)
- Reusable online-efficient commitments (Q6653022) (← links)
- Doubly efficient cryptography: commitments, arguments and RAM MPC (Q6653029) (← links)
- PIR with client-side preprocessing: information-theoretic constructions and lower bounds (Q6653044) (← links)
- Hintless single-server private information retrieval (Q6653046) (← links)
