The following pages link to Private information retrieval (Q3158526):
Displaying 50 items.
- Privacy protection in on-line shopping for electronic documents (Q506124) (← links)
- Searchable symmetric encryption over multiple servers (Q680933) (← links)
- Generic construction of designated tester public-key encryption with keyword search (Q713419) (← links)
- Security and privacy aspects in MapReduce on clouds: a survey (Q739007) (← links)
- Optimal configurations for peer-to-peer user-private information retrieval (Q980206) (← links)
- Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
- Some basics on privacy techniques, anonymization and their big data challenges (Q1616158) (← links)
- On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate (Q1629415) (← links)
- Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
- Can we access a database both locally and privately? (Q1690289) (← links)
- Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost (Q1694723) (← links)
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back (Q1698392) (← links)
- Improved user-private information retrieval via finite geometry (Q1727378) (← links)
- A novel tamper evident single database information-theoretic private information retrieval for user privacy applications (Q1736062) (← links)
- Querying databases privately. A new approach to private information retrieval. (Q1763051) (← links)
- Oblivious keyword search (Q1827575) (← links)
- Query-efficient locally decodable codes of subexponential length (Q1947042) (← links)
- Abstractions of non-interference security: probabilistic versus possibilistic (Q2018754) (← links)
- Quantum private information retrieval has linear communication complexity (Q2018821) (← links)
- Information hiding using matroid theory (Q2040985) (← links)
- Multi-value private information retrieval with colluding databases via trace functions (Q2053906) (← links)
- Verifiable single-server private information retrieval from LWE with binary errors (Q2055570) (← links)
- Private information retrieval with sublinear online time (Q2055601) (← links)
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time (Q2139652) (← links)
- Garbled circuits with sublinear evaluator (Q2169991) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- Privacy-enhanced attribute-based private information retrieval (Q2195304) (← links)
- Locally decodable and updatable non-malleable codes and their applications (Q2303459) (← links)
- A general private information retrieval scheme for MDS coded databases with colluding servers (Q2329401) (← links)
- Quantum symmetrically-private information retrieval (Q2390235) (← links)
- Fast systematic encoding of multiplicity codes (Q2422714) (← links)
- Fully homomorphic SIMD operations (Q2439746) (← links)
- PIR codes with short block length (Q2657142) (← links)
- New flexible quantum private query protocol against rotation noise (Q2687080) (← links)
- Multi-client oblivious RAM with poly-logarithmic communication (Q2692380) (← links)
- Private Database Access with HE-over-ORAM Architecture (Q2794501) (← links)
- On Basing Private Information Retrieval on NP-Hardness (Q2796134) (← links)
- Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem (Q2807210) (← links)
- Privacy-Preserving k-Nearest Neighbour Query on Outsourced Database (Q2817461) (← links)
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits (Q2829941) (← links)
- Breaking the Circuit Size Barrier for Secure Computation Under DDH (Q2835599) (← links)
- Authentication in Constrained Settings (Q2947097) (← links)
- A new multi-server scheme for private information retrieval (Q2975246) (← links)
- Low-Leakage Secure Search for Boolean Expressions (Q2975821) (← links)
- On Privacy-Preserving Biometric Authentication (Q2980853) (← links)
- On Sums of Locally Testable Affine Invariant Properties (Q3088113) (← links)
- Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
- Short Locally Testable Codes and Proofs (Q3088191) (← links)
- Quantum Private Queries (Q3107670) (← links)
- The order of communication complexity of PIR-protocols (Q3184562) (← links)
