Private information retrieval
From MaRDI portal
Publication:3158526
DOI10.1145/293347.293350zbMath1065.68524OpenAlexW2073346043WikidataQ55980348 ScholiaQ55980348MaRDI QIDQ3158526
Madhu Sudan, Eyal Kushilevitz, Benny Chor, Oded Goldreich
Publication date: 25 January 2005
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/293347.293350
Related Items (82)
Private Sequential Learning ⋮ Some basics on privacy techniques, anonymization and their big data challenges ⋮ On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate ⋮ Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time ⋮ The order of communication complexity of PIR-protocols ⋮ Towards breaking the exponential barrier for general secret sharing ⋮ Quantum symmetrically-private information retrieval ⋮ PIR codes with short block length ⋮ Garbled circuits with sublinear evaluator ⋮ Single-server private information retrieval with sublinear amortized time ⋮ Authentication in Constrained Settings ⋮ Credibility in private set membership ⋮ Erasures versus errors in local decoding and property testing ⋮ Fast systematic encoding of multiplicity codes ⋮ LCD matrix product codes with an application ⋮ A novel quantum private set intersection scheme with a semi-honest third party ⋮ Optimal single-server private information retrieval ⋮ Lower bounds for (batch) PIR with private preprocessing ⋮ Privacy-enhanced attribute-based private information retrieval ⋮ Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ Private join and compute from PIR with default ⋮ New flexible quantum private query protocol against rotation noise ⋮ Unnamed Item ⋮ Private information retrieval schemes using cyclic codes ⋮ On the optimal communication complexity of error-correcting multi-server PIR ⋮ From private simultaneous messages to zero-information Arthur-Merlin protocols and back ⋮ Private Information Retrieval from Coded Databases with Colluding Servers ⋮ Query-efficient locally decodable codes of subexponential length ⋮ Multi-client oblivious RAM with poly-logarithmic communication ⋮ Low-Leakage Secure Search for Boolean Expressions ⋮ Fully homomorphic SIMD operations ⋮ On Privacy-Preserving Biometric Authentication ⋮ Quantum Cryptography: Key Distribution and Beyond ⋮ Foundations of Homomorphic Secret Sharing ⋮ Improved user-private information retrieval via finite geometry ⋮ Hypercubes and Private Information Retrieval ⋮ Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations ⋮ Privacy protection in on-line shopping for electronic documents ⋮ Searchable symmetric encryption over multiple servers ⋮ An optimal distributed discrete log protocol with applications to homomorphic secret sharing ⋮ Asymptotically Tight Bounds for Composing ORAM with PIR ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Short Locally Testable Codes and Proofs: A Survey in Two Parts ⋮ Local Property Reconstruction and Monotonicity ⋮ Optimal configurations for peer-to-peer user-private information retrieval ⋮ Abstractions of non-interference security: probabilistic versus possibilistic ⋮ Quantum private information retrieval has linear communication complexity ⋮ Generic construction of designated tester public-key encryption with keyword search ⋮ Some results on query processes and reconstruction functions for unconditionally secure 2-server 1-round binary private information retrieval protocols ⋮ Fast Private Norm Estimation and Heavy Hitters ⋮ The communication complexity of private simultaneous messages, revisited ⋮ Private Database Access with HE-over-ORAM Architecture ⋮ On Basing Private Information Retrieval on NP-Hardness ⋮ Exponential lower bound for 2-query locally decodable codes via a quantum argument ⋮ Polylogarithmic two-round argument systems ⋮ Information hiding using matroid theory ⋮ Security and privacy aspects in MapReduce on clouds: a survey ⋮ Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem ⋮ Communication-Efficient Private Protocols for Longest Common Subsequence ⋮ High-entropy dual functions over finite fields and locally decodable codes ⋮ Private multiparty sampling and approximation of vector combinations ⋮ Locally decodable and updatable non-malleable codes and their applications ⋮ Multi-value private information retrieval with colluding databases via trace functions ⋮ Privacy-Preserving k-Nearest Neighbour Query on Outsourced Database ⋮ On Sums of Locally Testable Affine Invariant Properties ⋮ Limits on the Rate of Locally Testable Affine-Invariant Codes ⋮ Verifiable single-server private information retrieval from LWE with binary errors ⋮ Private information retrieval with sublinear online time ⋮ Short Locally Testable Codes and Proofs ⋮ Another Look at Extended Private Information Retrieval Protocols ⋮ Quantum Homomorphic Encryption for Polynomial-Sized Circuits ⋮ Breaking the Circuit Size Barrier for Secure Computation Under DDH ⋮ Oblivious keyword search ⋮ Quantum Private Queries ⋮ Outlaw distributions and locally decodable codes ⋮ A general private information retrieval scheme for MDS coded databases with colluding servers ⋮ A combination of testability and decodability by tensor products ⋮ Private Information Retrieval Using Trusted Hardware ⋮ Homomorphic Encryption ⋮ Some Open Problems in Information-Theoretic Cryptography ⋮ Reed-Muller Codes
This page was built for publication: Private information retrieval
