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

DOI10.1007/978-3-031-38545-2_10MaRDI QIDQ6186714zbMATH OpenOpenAlexFDO

Authors Arthur Lazzaretti, Charalampos Papamanthou

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

privacy-preserving primitivesprivate information retrievalpuncturable pseudorandom functions

Mathematics Subject Classification ID

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

Cites work

• 3-query locally decodable codes of subexponential length
• A simpler rate-optimal CPIR protocol
• Adaptively secure puncturable pseudorandom functions in the standard model
• Advances in Cryptology – CRYPTO 2004
• Automata, Languages and Programming
• Can we access a database both locally and privately?
• Communication optimal Tardos-based asymmetric fingerprinting
• Constraining and watermarking PRFs from milder assumptions
• Constraining pseudorandom functions privately
• Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
• Function secret sharing
• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• scientific article; zbMATH DE number 1304086 (Why is no real title available?)
• scientific article; zbMATH DE number 1754644 (Why is no real title available?)
• scientific article; zbMATH DE number 1759771 (Why is no real title available?)
• Information Security
• New directions in cryptography
• Private constrained PRFs (and more) from LWE
• Private information retrieval with sublinear online time
• Private puncturable PRFs from standard lattice assumptions
• Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
• Software protection and simulation on oblivious RAMs
• Towards 3-query locally decodable codes of subexponential length
• Towards doubly efficient private information retrieval
• Trapdoor hash functions and their applications

Cited in

(11)

• Efficient pre-processing PIR without public-key cryptography
• Hintless single-server private information retrieval
• Pseudorandom functions with weak programming privacy and applications to private information retrieval
• Single-server client preprocessing PIR with tight space-time trade-off
• Plinko: single-server PIR with efficient updates via invertible PRFs
• Information-theoretic multi-server private information retrieval with client preprocessing
• Constrained pseudorandom functions for inner-product predicates from weaker assumptions
• Scalable multi-server private information retrieval
• Multi-server doubly efficient PIR in the classical model and beyond
• \textsf{Zebra}: arithmetic garbled RAM for large words from DCR
• Amortizing Circuit-PSI in the multiple sender/receiver setting

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

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