Private information retrieval with sublinear online time
type: Item
instance of: scholarly article
title: Private information retrieval with sublinear online time
DOI: 10.1007/978-3-030-45721-1_3
author: Henry Corrigan-Gibbs
author: Dmitry Kogan
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7436914
MaRDI profile type: Publication
full work available at URL: 978-3-030-45721-1 3
OpenAlex ID: W2918752259
cites work: Upper bound on the communication complexity of private information retrieval
cites work: Semi-homomorphic Encryption and Multiparty Computation
cites work: Functional Signatures and Pseudorandom Functions
cites work: Function Secret Sharing
cites work: Theory of Cryptography
cites work: Q4535072
cites work: Reducing the servers' computation in private information retrieval: PIR with preprocessing
cites work: Can we access a database both locally and privately?
cites work: Private Puncturable PRFs from Standard Lattice Assumptions
cites work: Constraining Pseudorandom Functions Privately
cites work: Private constrained PRFs (and more) from LWE
cites work: Constrained Pseudorandom Functions and Their Applications
cites work: Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
cites work: Q4526995
cites work: Q4231909
cites work: Private information retrieval
cites work: Towards doubly efficient private information retrieval
cites work: Q4250776
cites work: 2-Server PIR with Sub-Polynomial Communication
cites work: Trapdoor hash functions and their applications
cites work: Universal service-providers for database private information retrieval (extended abstract)
cites work: Universal service-providers for private information retrieval
cites work: Q3374904
cites work: Multiparty Computation from Somewhat Homomorphic Encryption
cites work: 3-Query Locally Decodable Codes of Subexponential Length
cites work: Fully homomorphic encryption using ideal lattices
cites work: Q3729902
cites work: Distributed Point Functions and Their Applications
cites work: Automata, Languages and Programming
cites work: Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model
cites work: Private anonymous data access
cites work: Batch codes and their applications
cites work: Evaluating Branching Programs on Encrypted Data
cites work: Q2724459
cites work: Q3374903
cites work: Information Security
cites work: A Survey of Single-Database Private Information Retrieval: Techniques and Applications
cites work: Modified ranks of tensors and the size of circuits
cites work: Boolean Circuits, Tensor Ranks, and Communication Complexity
cites work: How to use indistinguishability obfuscation
cites work: Towards 3-query locally decodable codes of subexponential length
description: scientific article; zbMATH DE number 7436914