Optimal single-server private information retrieval

DOI10.1007/978-3-031-30545-0_14OpenAlexW4365936297MaRDI QIDQ6138096FDOQ6138096

Yiannis Tselekounis, Elaine Shi, Mingxun Zhou, Wei-Kai Lin

Publication date: 16 January 2024

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

Full work available at URL: https://doi.org/10.1007/978-3-031-30545-0_14

Mathematics Subject Classification ID

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

Cites Work

• Fully homomorphic encryption using ideal lattices
• Sorting in \(c \log n\) parallel steps
• Universal service-providers for database private information retrieval (extended abstract)
• Title not available (Why is that?)
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Private information retrieval
• 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
• Title not available (Why is that?)
• 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
• Privately constraining and programming PRFs, the LWE way
• Spooky Encryption and Its Applications
• Constraining Pseudorandom Functions Privately
• Private Puncturable PRFs from Standard Lattice Assumptions
• Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
• 2-Server PIR with Sub-Polynomial Communication
• Distributed Point Functions and Their Applications
• Can we access a database both locally and privately?
• Towards doubly efficient private information retrieval
• Delegation for bounded space
• Title not available (Why is that?)
• Private information retrieval with sublinear online time
• Private anonymous data access
• Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
• Lightweight, maliciously secure verifiable function secret sharing
• Single-server private information retrieval with sublinear amortized time
• Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems
• Watermarking cryptographic functionalities from standard lattice assumptions
• Programmable distributed point functions

Cited In (2)

• Efficient pre-processing PIR without public-key cryptography
• Lower-bounds on public-key operations in PIR

This page was built for publication: Optimal single-server private information retrieval

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