The following pages link to (Q3374904):
Displaying 27 items.
- Quantum oblivious transfer with relaxed constraints on the receiver (Q496888) (← links)
- Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
- Protecting data privacy in private information retrieval schemes (Q1577014) (← links)
- Providing accurate models across private partitioned data: secure maximum likelihood estimation (Q1624813) (← links)
- Flexible quantum oblivious transfer (Q1705113) (← links)
- Information hiding using matroid theory (Q2040985) (← links)
- Private information retrieval with sublinear online time (Q2055601) (← links)
- Privacy-enhanced attribute-based private information retrieval (Q2195304) (← links)
- Quantum oblivious transfer based on a quantum symmetrically private information retrieval protocol (Q2353122) (← links)
- On Basing Private Information Retrieval on NP-Hardness (Q2796134) (← links)
- One-way functions are essential for single-server private information retrieval (Q2819537) (← links)
- On the Security Loss in Cryptographic Reductions (Q3627428) (← links)
- Another Look at Extended Private Information Retrieval Protocols (Q3637147) (← links)
- Homomorphic Encryption (Q5021133) (← links)
- Information Security and Privacy (Q5315290) (← links)
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way (Q5445518) (← links)
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)
- Automata, Languages and Programming (Q5716829) (← links)
- A Survey of Single-Database Private Information Retrieval: Techniques and Applications (Q5756546) (← links)
- Programmable distributed point functions (Q6111543) (← links)
- Improved and formal proposal for device-independent quantum private query <sup>*</sup> (Q6190385) (← links)
- Combinatorially homomorphic encryption (Q6582175) (← links)
- Near-optimal private information retrieval with preprocessing (Q6582182) (← links)
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search (Q6637539) (← links)
- Lower-bounds on public-key operations in PIR (Q6637562) (← links)
- Efficient pre-processing PIR without public-key cryptography (Q6637568) (← links)
- PIR with client-side preprocessing: information-theoretic constructions and lower bounds (Q6653044) (← links)
