General constructions for information-theoretic private information retrieval
From MaRDI portal
Recommendations
Cites work
- A Geometric Approach to Information-Theoretic Private Information Retrieval
- Automata, Languages and Programming
- Communication Complexity of Simultaneous Messages
- Exponential lower bound for 2-query locally decodable codes via a quantum argument
- How to share a secret
- scientific article; zbMATH DE number 4179276 (Why is no real title available?)
- scientific article; zbMATH DE number 4213418 (Why is no real title available?)
- scientific article; zbMATH DE number 5604104 (Why is no real title available?)
- scientific article; zbMATH DE number 3763833 (Why is no real title available?)
- scientific article; zbMATH DE number 1261806 (Why is no real title available?)
- scientific article; zbMATH DE number 1302806 (Why is no real title available?)
- scientific article; zbMATH DE number 1304086 (Why is no real title available?)
- scientific article; zbMATH DE number 2019623 (Why is no real title available?)
- scientific article; zbMATH DE number 1512689 (Why is no real title available?)
- scientific article; zbMATH DE number 1559546 (Why is no real title available?)
- scientific article; zbMATH DE number 1754644 (Why is no real title available?)
- scientific article; zbMATH DE number 1775399 (Why is no real title available?)
- scientific article; zbMATH DE number 1418319 (Why is no real title available?)
- Improved upper bounds on information-theoretic private information retrieval (extended abstract)
- Locally random reductions: Improvements and applications
- On secret sharing systems
- On the efficiency of local decoding procedures for error-correcting codes
- Reducing the servers' computation in private information retrieval: PIR with preprocessing
- Short locally testable codes and proofs
- Simultaneous messages vs. communication
- Some Applications of Coding Theory in Computational Complexity
- Theory of Cryptography
- Universal service-providers for private information retrieval
- Upper bound on the communication complexity of private information retrieval
Cited in
(47)- Protecting data privacy in private information retrieval schemes
- Improved user-private information retrieval via finite geometry
- Reducing the servers' computation in private information retrieval: PIR with preprocessing
- Query-efficient locally decodable codes of subexponential length
- Information hiding using matroid theory
- Multi-value private information retrieval with colluding databases via trace functions
- How to correct errors in multi-server PIR
- On quantum advantage in information theoretic single-server PIR
- A general private information retrieval scheme for MDS coded databases with colluding servers
- A tight lower bound for restricted PIR protocols
- Robust information-theoretic private information retrieval
- Private information retrieval with preprocessing based on the approximate GCD problem
- Improved upper bounds on information-theoretic private information retrieval (extended abstract)
- One-way functions are essential for single-server private information retrieval
- Iterative Constructions and Private Data Release
- The order of communication complexity of PIR-protocols
- A Geometric Approach to Information-Theoretic Private Information Retrieval
- Communication-efficient distributed oblivious transfer
- scientific article; zbMATH DE number 1952910 (Why is no real title available?)
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- scientific article; zbMATH DE number 1754644 (Why is no real title available?)
- scientific article; zbMATH DE number 1775399 (Why is no real title available?)
- Private information retrieval from coded databases with colluding servers
- Applied Cryptography and Network Security
- Private Information Retrieval Over Gaussian MAC
- Similarity Based Interactive Private Information Retrieval
- CNF-FSS and its applications
- Протокол конфиденциального получения информации
- Verifiable multi-server private information retrieval
- Degeneracy bounds for private information retrieval protocols
- Some results on query processes and reconstruction functions for unconditionally secure 2-server 1-round binary private information retrieval protocols
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
- Reed-Muller Codes
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR
- Quadratic multiparty randomized encodings beyond honest majority and their applications
- PIR codes from combinatorial structures
- Private information retrieval schemes using cyclic codes
- On the optimal communication complexity of error-correcting multi-server PIR
- OnionPIR: effective protection of sensitive metadata in online communication networks
- Private information retrieval with result verification for more servers
- Improved polynomial secret-sharing schemes
- Information-theoretic single-server PIR in the shuffle model
- On the definition of malicious private information retrieval
- Two-server private information retrieval in sublinear time and quasilinear space
- Selling multiple secrets to a single buyer
- Private information and the `Information function': A survey of possible uses
- Optimal configurations for peer-to-peer user-private information retrieval
This page was built for publication: General constructions for information-theoretic private information retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485285)
