Private information retrieval with preprocessing based on the approximate GCD problem

DOI10.1007/978-3-319-31301-6_14zbMATH Open1396.68042OpenAlexW2469581176MaRDI QIDQ2807210FDOQ2807210

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

Recommendations

• Reducing the servers' computation in private information retrieval: PIR with preprocessing
• scientific article; zbMATH DE number 1759771
• General constructions for information-theoretic private information retrieval
• scientific article; zbMATH DE number 2090941
• Towards doubly efficient private information retrieval

zbMATH Keywords

privacyapproximate GCDdistributed databasessublinear communicationinformation-theoretic protocolssublinear computation

Mathematics Subject Classification ID

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

Cites Work

• Fully homomorphic encryption over the integers
• How to share a secret
• Private information retrieval
• Batch codes and their applications
• Title not available (Why is that?)
• Private Database Queries Using Somewhat Homomorphic Encryption
• Automata, Languages and Programming
• Reducing the servers' computation in private information retrieval: PIR with preprocessing
• An Efficient PIR Construction Using Trusted Hardware

Cited In (2)

• Private Information Retrieval Over Gaussian MAC
• Verifiable single-server private information retrieval from LWE with binary errors

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)