scientific article; zbMATH DE number 1759771

zbMath0989.68507MaRDI QIDQ4536794

Yuval Ishai, Amos Beimel, Tal Malkin

Publication date: 28 July 2002

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information storage and retrieval of data (68P20)

Related Items

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 ⋮ Permuted puzzles and cryptographic hardness ⋮ Optimal single-server private information retrieval ⋮ \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH ⋮ Random-index PIR and applications ⋮ An Efficient PIR Construction Using Trusted Hardware ⋮ Privacy-preserving verifiable delegation of polynomial and matrix functions ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Multi-server verifiable delegation of computations: unconditional security and practical efficiency ⋮ Verifiable single-server private information retrieval from LWE with binary errors ⋮ Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions ⋮ Private Information Retrieval Using Trusted Hardware