A t-private k-database information retrieval scheme (original) (raw)

• 152 Accesses
• 7 Citations
• Explore all metrics

Abstract

A private information retrieval scheme enables a user to privately recover an item from a public accessible database. In this paper we present a private information retrieval scheme for k replicated databases. The scheme is information-theoretic secure for coalitions of databases of size t≤k-1. It improves the communication complexity of the scheme described in [Ishai and Kushilevitz (1999) Proc 31st Annu ACM Symp Theory Comput pp 79–88] for coalitions of size \(\tfrac{k} {2} \leqslant t \leqslant k - 1\).

Access this article

Log in via an institution

Subscribe and save

• Starting from 10 chapters or articles per month
• Access and download chapters and articles from more than 300k books and 2,500 journals
• Cancel anytime View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

1. Dipartimento di Informatica ed Applicazioni, Università di Salerno, 84081 Baronissi, Italy E-mail: {carblu,paodar,ads}@dia.unisa.it, IT
   Carlo Blundo, Paolo D’Arco & Alfredo De Santis

Authors

1. Carlo Blundo
2. Paolo D’Arco
3. Alfredo De Santis

Additional information

Published online: 27 July 2001

Rights and permissions

About this article

Cite this article

Blundo, C., D’Arco, P. & De Santis, A. A t-private k-database information retrieval scheme.IJIS 1, 64–68 (2001). https://doi.org/10.1007/s102070100005

Download citation

• Published: 31 January 2014
• Issue date: August 2001
• DOI: https://doi.org/10.1007/s102070100005