Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem

DOI10.1007/978-3-319-31301-6_14zbMath1396.68042OpenAlexW2469581176MaRDI QIDQ2807210

Noboru Kunihiro, Thomas Vannet

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

privacydistributed databasesapproximate GCDsublinear communicationinformation-theoretic protocolssublinear computation

Mathematics Subject Classification ID

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

Related Items (1)

Verifiable single-server private information retrieval from LWE with binary errors

Uses Software

• Percy++

Cites Work

• Unnamed Item
• Reducing the servers' computation in private information retrieval: PIR with preprocessing
• Private Database Queries Using Somewhat Homomorphic Encryption
• How to share a secret
• Private information retrieval
• An Efficient PIR Construction Using Trusted Hardware
• Fully Homomorphic Encryption over the Integers
• Batch codes and their applications
• Automata, Languages and Programming

This page was built for publication: Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem