scientific article; zbMATH DE number 1559546

zbMath0962.68054MaRDI QIDQ4526995

Benny Chor, Niv Gilboa

Publication date: 28 February 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

private information retrieval

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20)

Related Items

On the privacy of a code-based single-server computational PIR scheme ⋮ Selling multiple secrets to a single buyer ⋮ Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time ⋮ Similarity Based Interactive Private Information Retrieval ⋮ Single-server private information retrieval with sublinear amortized time ⋮ On locally decodable codes, self-correctable codes, and \(t\)-private PIR ⋮ Sublinear-communication secure multiparty computation does not require FHE ⋮ Sublinear secure computation from new assumptions ⋮ Optimal single-server private information retrieval ⋮ Lower bounds for (batch) PIR with private preprocessing ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ Dividing secrets to secure data outsourcing ⋮ Foundations of Homomorphic Secret Sharing ⋮ An Efficient PIR Construction Using Trusted Hardware ⋮ Hypercubes and Private Information Retrieval ⋮ Протокол конфиденциального получения информации ⋮ General constructions for information-theoretic private information retrieval ⋮ Optimal configurations for peer-to-peer user-private information retrieval ⋮ Verifiable single-server private information retrieval from LWE with binary errors ⋮ Private information retrieval with sublinear online time ⋮ Breaking the circuit size barrier for secure computation under quasi-polynomial LPN ⋮ Breaking the Circuit Size Barrier for Secure Computation Under DDH ⋮ Protecting data privacy in private information retrieval schemes