\textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH

DOI10.1007/978-3-031-38545-2_10OpenAlexW4385654013MaRDI QIDQ6186714

Charalampos Papamanthou, Arthur Lazzaretti

Publication date: 2 February 2024

Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-38545-2_10

zbMATH Keywords

private information retrievalprivacy-preserving primitivespuncturable pseudorandom functions

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Private constrained PRFs (and more) from LWE
• Can we access a database both locally and privately?
• Towards doubly efficient private information retrieval
• Private information retrieval with sublinear online time
• Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
• Trapdoor hash functions and their applications
• Communication Optimal Tardos-Based Asymmetric Fingerprinting
• Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model
• 2-Server PIR with Sub-Polynomial Communication
• Function Secret Sharing
• Towards 3-query locally decodable codes of subexponential length
• New directions in cryptography
• Software protection and simulation on oblivious RAMs
• 3-Query Locally Decodable Codes of Subexponential Length
• Constraining and Watermarking PRFs from Milder Assumptions
• Advances in Cryptology – CRYPTO 2004
• Information Security
• Automata, Languages and Programming
• Constraining Pseudorandom Functions Privately
• Private Puncturable PRFs from Standard Lattice Assumptions
• Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
• A Simpler Rate-Optimal CPIR Protocol

This page was built for publication: \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH