The following pages link to Information Security and Privacy (Q5315290):
Displaying 16 items.
- A communication-efficient private matching scheme in client-server model (Q726566) (← 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)
- Privacy-enhanced attribute-based private information retrieval (Q2195304) (← links)
- Verifiable single-server private information retrieval (Q2218970) (← links)
- Amortizing rate-1 OT and applications to PIR and PSI (Q2697889) (← links)
- Hypercubes and Private Information Retrieval (Q3297525) (← links)
- (Q3374904) (← links)
- Similarity Based Interactive Private Information Retrieval (Q5055967) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)
- Automata, Languages and Programming (Q5716829) (← links)
- On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols (Q5744697) (← links)
- A Survey of Single-Database Private Information Retrieval: Techniques and Applications (Q5756546) (← links)
- Sublinear secure computation from new assumptions (Q6114267) (← links)
- Efficient pre-processing PIR without public-key cryptography (Q6637568) (← links)
