General constructions for information-theoretic private information retrieval

DOI10.1016/J.JCSS.2005.03.002zbMATH Open1076.68027OpenAlexW2007208840MaRDI QIDQ2485285FDOQ2485285

Authors: Amos Beimel, Yuval Ishai, Eyal Kushilevitz 

Publication date: 3 August 2005

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2005.03.002

Recommendations

• scientific article; zbMATH DE number 1754644
• Improved upper bounds on information-theoretic private information retrieval (extended abstract)
• A Geometric Approach to Information-Theoretic Private Information Retrieval

zbMATH Keywords

Information-theoretic cryptographyLocally decodable codesMultiparty communication complexityPrivate information retrievalSimultaneous messages protocols

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites Work

• How to share a secret
• Title not available (Why is that?)
• On secret sharing systems
• Title not available (Why is that?)
• Theory of Cryptography
• Short locally testable codes and proofs
• On the efficiency of local decoding procedures for error-correcting codes
• A Geometric Approach to Information-Theoretic Private Information Retrieval
• Title not available (Why is that?)
• Title not available (Why is that?)
• Upper bound on the communication complexity of private information retrieval
• Locally random reductions: Improvements and applications
• Communication Complexity of Simultaneous Messages
• Simultaneous messages vs. communication
• Some Applications of Coding Theory in Computational Complexity
• Exponential lower bound for 2-query locally decodable codes via a quantum argument
• Title not available (Why is that?)
• Improved upper bounds on information-theoretic private information retrieval (extended abstract)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automata, Languages and Programming
• Universal service-providers for private information retrieval
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reducing the servers' computation in private information retrieval: PIR with preprocessing
• Title not available (Why is that?)

Cited In (43)

• Improved user-private information retrieval via finite geometry
• On the optimal communication complexity of error-correcting multi-server PIR
• Private Information Retrieval Over Gaussian MAC
• PIR codes from combinatorial structures
• Degeneracy bounds for private information retrieval protocols
• Reducing the servers' computation in private information retrieval: PIR with preprocessing
• Improved polynomial secret-sharing schemes
• Applied Cryptography and Network Security
• One-way functions are essential for single-server private information retrieval
• On quantum advantage in information theoretic single-server PIR
• A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
• Quadratic multiparty randomized encodings beyond honest majority and their applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Private information retrieval from coded databases with colluding servers
• Title not available (Why is that?)
• Private information retrieval schemes using cyclic codes
• Communication-efficient distributed oblivious transfer
• Some results on query processes and reconstruction functions for unconditionally secure 2-server 1-round binary private information retrieval protocols
• Протокол конфиденциального получения информации
• A general private information retrieval scheme for MDS coded databases with colluding servers
• Information hiding using matroid theory
• OnionPIR: effective protection of sensitive metadata in online communication networks
• CNF-FSS and its applications
• Verifiable multi-server private information retrieval
• Private information retrieval with preprocessing based on the approximate GCD problem
• Optimal configurations for peer-to-peer user-private information retrieval
• Reed-Muller Codes
• Multi-value private information retrieval with colluding databases via trace functions
• A tight lower bound for restricted PIR protocols
• Robust information-theoretic private information retrieval
• Private information and the `Information function': A survey of possible uses
• How to correct errors in multi-server PIR
• Query-efficient locally decodable codes of subexponential length
• Iterative Constructions and Private Data Release
• The order of communication complexity of PIR-protocols
• Similarity Based Interactive Private Information Retrieval
• Private information retrieval with result verification for more servers
• Title not available (Why is that?)
• Selling multiple secrets to a single buyer
• Improved upper bounds on information-theoretic private information retrieval (extended abstract)
• On locally decodable codes, self-correctable codes, and \(t\)-private PIR
• A Geometric Approach to Information-Theoretic 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)