Private information retrieval with preprocessing based on the approximate GCD problem

DOI10.1007/978-3-319-31301-6_14MaRDI QIDQ2807210zbMATH OpenOpenAlexFDO

Authors Thomas Vannet, Noboru Kunihiro

Publication date 19 May 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-31301-6_14

zbMATH Keywords

approximate GCDdistributed databasesinformation-theoretic protocolsprivacysublinear communicationsublinear computation

Mathematics Subject Classification ID

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

Recommendations

• Reducing the servers' computation in private information retrieval: PIR with preprocessing
• Reducing the servers computation in private information retrieval: PIR with preprocessing
• General constructions for information-theoretic private information retrieval
• Almost optimal private information retrieval
• Towards doubly efficient private information retrieval

Cites work

• An Efficient PIR Construction Using Trusted Hardware
• Batch codes and their applications
• Computationally private information retrieval with polylogarithmic communication
• Fully homomorphic encryption over the integers
• How to share a secret
• Private database queries using somewhat homomorphic encryption
• Private information retrieval
• Reducing the servers' computation in private information retrieval: PIR with preprocessing
• Single-database private information retrieval with constant communication rate

Cited in

(3)

• Verifiable single-server private information retrieval from LWE with binary errors
• Private Information Retrieval Over Gaussian MAC
• Efficient pre-processing PIR without public-key cryptography

Describes a project that uses

Uses Software

• Percy++

This page was built for publication: Private information retrieval with preprocessing based on the approximate GCD problem

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