Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time

DOI10.1007/978-3-030-84259-8_22zbMATH Open1486.68053OpenAlexW3192142816MaRDI QIDQ2139652FDOQ2139652

B. Chandrasekaran, Waqar Aqeel, Bruce M. Maggs, Elaine Shi

Publication date: 18 May 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-84259-8_22

Recommendations

• Reducing the servers' computation in private information retrieval: PIR with preprocessing
• Towards doubly efficient private information retrieval
• scientific article; zbMATH DE number 1759771
• Single-server private information retrieval with sublinear amortized time
• scientific article; zbMATH DE number 2090941

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Cryptography (94A60) Privacy of data (68P27)

Cites Work

• On lattices, learning with errors, random linear codes, and cryptography
• Title not available (Why is that?)
• Universal service-providers for database private information retrieval (extended abstract)
• Title not available (Why is that?)
• Software protection and simulation on oblivious RAMs
• Private information retrieval
• Oblivious RAM with O((logN)3) Worst-Case Cost
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Information Security and Privacy
• A Survey of Single-Database Private Information Retrieval: Techniques and Applications
• Batch codes and their applications
• Sometimes-Recurse Shuffle
• Title not available (Why is that?)
• Automata, Languages and Programming
• Modified ranks of tensors and the size of circuits
• Private constrained PRFs (and more) from LWE
• Function Secret Sharing
• How to Garble RAM Programs?
• Garbled RAM Revisited
• Constraining Pseudorandom Functions Privately
• Private Puncturable PRFs from Standard Lattice Assumptions
• Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
• TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption
• 2-Server PIR with Sub-Polynomial Communication
• Constrained keys for invertible pseudorandom functions
• Can we access a database both locally and privately?
• Towards doubly efficient private information retrieval
• The Mix-and-Cut Shuffle: Small-Domain Encryption Secure against N Queries
• Title not available (Why is that?)
• Private information retrieval with sublinear online time
• Private anonymous data access
• Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM

Cited In (11)

• Lower bounds for (batch) PIR with private preprocessing
• Optimal single-server private information retrieval
• Reducing the servers' computation in private information retrieval: PIR with preprocessing
• Near-optimal private information retrieval with preprocessing
• Programmable distributed point functions
• \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH
• Single-server private information retrieval with sublinear amortized time
• Efficient pre-processing PIR without public-key cryptography
• Lower-bounds on public-key operations in PIR
• PIR with client-side preprocessing: information-theoretic constructions and lower bounds
• Title not available (Why is that?)

This page was built for publication: Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139652)