OpenAlex
PricingAboutJobs
Log inGet started
Work

Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval

HTML

Year: 2003
Type: conference-paper
Source: Annual Symposium on Foundations of Computer Science
DOI: 10.1109/sfcs.2002.1181949
Authors: A. Beimel, Y. Ishai, E. Kushilevitz, J.-F. Raymond
Institutions: Ben-Gurion University of the Negev, Technion – Israel Institute of Technology, McGill University
Language: English

Topic: Cryptography and Data Security
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Keywords: private information retrieval, information-theoretic security, communication complexity, locally decodable codes, database privacy, asymptotic bounds

Open Access status: closed
OpenAlex ID: W2087207261
FWCI: 5.851
Cites: 35
Cited by: 265
Related to: 9
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms