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}
}
  • C. Gentry, Zulfikar Ramzan
  • 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
    A Novel Scheme for Single Database Symmetric Private Information Retrieval
    • Krishna Suri Narayanam
    • 5
    Single-Database Private Information Retrieval from Fully Homomorphic Encryption
    • 64
    Optimal Rate Private Information Retrieval from Homomorphic Encryption
    • 26
    • Highly Influenced
    • PDF
    An Efficient Transformation Capabilities of Single Database Private Block Retrieval
    • PDF
    Computational Code-Based Single-Server Private Information Retrieval
    • 1
    • PDF
    High-Speed Private Information Retrieval Computation on GPU
    • 32
    Single-Database Private Information Retrieval Protocols~: Overview, Usability and Trends
    • 3
    A fast private information retrieval protocol
    • 78

    References

    SHOWING 1-10 OF 29 REFERENCES
    Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval
    • 191
    • PDF
    Private information retrieval
    • 1,250
    • PDF
    An Oblivious Transfer Protocol with Log-Squared Communication
    • 284
    • PDF
    Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups
    • 61
    • PDF
    A New Efficient All-Or-Nothing Disclosure of Secrets Protocol
    • 111
    • PDF
    Computationally Private Information Retrieval with Polylogarithmic Communication
    • 621
    • PDF
    Traitor Tracing with Constant Transmission Rate
    • 670
    • PDF
    Finding a Small Root of a Univariate Modular Equation
    • 308
    • PDF