Private anonymous data access

DOI10.1007/978-3-030-17656-3_9zbMATH Open1428.94076OpenAlexW2807569012MaRDI QIDQ2292872FDOQ2292872

Authors: Ariel Hamlin, Rafail Ostrovsky, Mor Weiss, Daniel Wichs 

Publication date: 6 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-17656-3_9

Recommendations

• Anonymous RAM
• On Private Information Retrieval Supporting Range Queries
• Can we access a database both locally and privately?
• Multi-client oblivious RAM with poly-logarithmic communication
• Applied Cryptography and Network Security

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (16)

• Lower bounds for (batch) PIR with private preprocessing
• Optimal single-server private information retrieval
• Is there an oblivious RAM lower bound for online reads?
• Succinct arguments for RAM programs via projection codes
• Anonymous permutation routing
• Multi-client oblivious RAM with poly-logarithmic communication
• Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
• 3D Visibility Representations of 1-planar Graphs
• Is there an oblivious RAM lower bound for online reads?
• Anonymous Data Collection System with Mediators
• Collusion-resistant functional encryption for RAMs
• Anonymous RAM
• Single-server private information retrieval with sublinear amortized time
• Private information retrieval with sublinear online time
• Laconic function evaluation and ABE for RAMs from (Ring-)LWE
• Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE

This page was built for publication: Private anonymous data access

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