# Single-Database Private Information Retrieval with Constant Communication Rate

@inproceedings{Gentry2005SingleDatabasePI,
title={Single-Database Private Information Retrieval with Constant Communication Rate},
author={C. Gentry and Zulfikar Ramzan},
booktitle={ICALP},
year={2005}
}
• Published in ICALP 2005
• Computer Science
• We present a single-database private information retrieval (PIR) scheme with communication complexity ${\mathcal O}(k+d)$, where k ≥ log n is a security parameter that depends on the database size n and d is the bit-length of the retrieved database block. This communication complexity is better asymptotically than previous single-database PIR schemes. The scheme also gives improved performance for practical parameter settings whether the user is retrieving a single bit or very large blocks. For… CONTINUE READING
305 Citations

#### Topics from this paper

Single-Database Private Information Retrieval from Fully Homomorphic Encryption
• Computer Science
• IEEE Transactions on Knowledge and Data Engineering
• 2013
• 64
Optimal Rate Private Information Retrieval from Homomorphic Encryption
• Computer Science
• Proc. Priv. Enhancing Technol.
• 2015
• 26
• Highly Influenced
• PDF
Computational Code-Based Single-Server Private Information Retrieval
• Computer Science, Mathematics
• 2020 IEEE International Symposium on Information Theory (ISIT)
• 2020
• 1
• PDF
High-Speed Private Information Retrieval Computation on GPU
• Computer Science
• 2008 Second International Conference on Emerging Security Information, Systems and Technologies
• 2008
• 32
A fast private information retrieval protocol
• Computer Science
• 2008 IEEE International Symposium on Information Theory
• 2008
• 78

#### References

SHOWING 1-10 OF 29 REFERENCES