Adjusting the trade-off between privacy guarantees and computational cost in secure hardware PIR

Spiridon Bakiras, Konstantinos F. Nikolopoulos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Database queries present a potential privacy risk to users, as they may disclose sensitive information about the person issuing the query. Consequently, privacy preserving query processing has gained significant attention in the literature, and numerous techniques have been proposed that seek to hide the content of the queries from the database server. Secure hardware-assisted private information retrieval (PIR) is currently the only practical solution that can be leveraged to build algorithms that provide perfect privacy. Nevertheless, existing approaches feature amortized page retrieval costs and, for large databases, some queries may lead to excessive delays, essentially taking the database server offline for large periods of time. In this paper, we address this drawback and introduce a novel approach that sacrifices some degree of privacy in order to provide fast and constant query response times. Our method leverages the internal cache of the secure hardware to constantly reshuffle the database pages in order to create sufficient uncertainty regarding the exact location of an arbitrary page. We give a formal definition of the privacy level of our algorithm and illustrate how to enforce it in practice. Based on the performance characteristics of the current state-of-the-art secure hardware platforms, we show that our method can provide low page access times, even for very large databases.

Original languageEnglish
Title of host publicationSecure Data Management - 8th VLDB Workshop, SDM 2011, Proceedings
Pages128-144
Number of pages17
Volume6933 LNCS
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event8th VLDB Workshop on Secure Data Management, SDM 2011 - Seattle, WA, United States
Duration: 2 Sep 20112 Sep 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6933 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other8th VLDB Workshop on Secure Data Management, SDM 2011
CountryUnited States
CitySeattle, WA
Period2/9/112/9/11

Fingerprint

Private Information Retrieval
Information retrieval
Privacy
Computational Cost
Trade-offs
Hardware
Query
Costs
Servers
Server
Query processing
Privacy Preserving
Query Processing
Period of time
Leverage
Cache
Computer hardware
Response Time
Person
Retrieval

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Bakiras, S., & Nikolopoulos, K. F. (2011). Adjusting the trade-off between privacy guarantees and computational cost in secure hardware PIR. In Secure Data Management - 8th VLDB Workshop, SDM 2011, Proceedings (Vol. 6933 LNCS, pp. 128-144). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6933 LNCS). https://doi.org/10.1007/978-3-642-23556-6_9

Adjusting the trade-off between privacy guarantees and computational cost in secure hardware PIR. / Bakiras, Spiridon; Nikolopoulos, Konstantinos F.

Secure Data Management - 8th VLDB Workshop, SDM 2011, Proceedings. Vol. 6933 LNCS 2011. p. 128-144 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6933 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bakiras, S & Nikolopoulos, KF 2011, Adjusting the trade-off between privacy guarantees and computational cost in secure hardware PIR. in Secure Data Management - 8th VLDB Workshop, SDM 2011, Proceedings. vol. 6933 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6933 LNCS, pp. 128-144, 8th VLDB Workshop on Secure Data Management, SDM 2011, Seattle, WA, United States, 2/9/11. https://doi.org/10.1007/978-3-642-23556-6_9
Bakiras S, Nikolopoulos KF. Adjusting the trade-off between privacy guarantees and computational cost in secure hardware PIR. In Secure Data Management - 8th VLDB Workshop, SDM 2011, Proceedings. Vol. 6933 LNCS. 2011. p. 128-144. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-23556-6_9
Bakiras, Spiridon ; Nikolopoulos, Konstantinos F. / Adjusting the trade-off between privacy guarantees and computational cost in secure hardware PIR. Secure Data Management - 8th VLDB Workshop, SDM 2011, Proceedings. Vol. 6933 LNCS 2011. pp. 128-144 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{6d87754b03544035a58273e51fe18ce6,
title = "Adjusting the trade-off between privacy guarantees and computational cost in secure hardware PIR",
abstract = "Database queries present a potential privacy risk to users, as they may disclose sensitive information about the person issuing the query. Consequently, privacy preserving query processing has gained significant attention in the literature, and numerous techniques have been proposed that seek to hide the content of the queries from the database server. Secure hardware-assisted private information retrieval (PIR) is currently the only practical solution that can be leveraged to build algorithms that provide perfect privacy. Nevertheless, existing approaches feature amortized page retrieval costs and, for large databases, some queries may lead to excessive delays, essentially taking the database server offline for large periods of time. In this paper, we address this drawback and introduce a novel approach that sacrifices some degree of privacy in order to provide fast and constant query response times. Our method leverages the internal cache of the secure hardware to constantly reshuffle the database pages in order to create sufficient uncertainty regarding the exact location of an arbitrary page. We give a formal definition of the privacy level of our algorithm and illustrate how to enforce it in practice. Based on the performance characteristics of the current state-of-the-art secure hardware platforms, we show that our method can provide low page access times, even for very large databases.",
author = "Spiridon Bakiras and Nikolopoulos, {Konstantinos F.}",
year = "2011",
doi = "10.1007/978-3-642-23556-6_9",
language = "English",
isbn = "9783642235559",
volume = "6933 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "128--144",
booktitle = "Secure Data Management - 8th VLDB Workshop, SDM 2011, Proceedings",

}

TY - GEN

T1 - Adjusting the trade-off between privacy guarantees and computational cost in secure hardware PIR

AU - Bakiras, Spiridon

AU - Nikolopoulos, Konstantinos F.

PY - 2011

Y1 - 2011

N2 - Database queries present a potential privacy risk to users, as they may disclose sensitive information about the person issuing the query. Consequently, privacy preserving query processing has gained significant attention in the literature, and numerous techniques have been proposed that seek to hide the content of the queries from the database server. Secure hardware-assisted private information retrieval (PIR) is currently the only practical solution that can be leveraged to build algorithms that provide perfect privacy. Nevertheless, existing approaches feature amortized page retrieval costs and, for large databases, some queries may lead to excessive delays, essentially taking the database server offline for large periods of time. In this paper, we address this drawback and introduce a novel approach that sacrifices some degree of privacy in order to provide fast and constant query response times. Our method leverages the internal cache of the secure hardware to constantly reshuffle the database pages in order to create sufficient uncertainty regarding the exact location of an arbitrary page. We give a formal definition of the privacy level of our algorithm and illustrate how to enforce it in practice. Based on the performance characteristics of the current state-of-the-art secure hardware platforms, we show that our method can provide low page access times, even for very large databases.

AB - Database queries present a potential privacy risk to users, as they may disclose sensitive information about the person issuing the query. Consequently, privacy preserving query processing has gained significant attention in the literature, and numerous techniques have been proposed that seek to hide the content of the queries from the database server. Secure hardware-assisted private information retrieval (PIR) is currently the only practical solution that can be leveraged to build algorithms that provide perfect privacy. Nevertheless, existing approaches feature amortized page retrieval costs and, for large databases, some queries may lead to excessive delays, essentially taking the database server offline for large periods of time. In this paper, we address this drawback and introduce a novel approach that sacrifices some degree of privacy in order to provide fast and constant query response times. Our method leverages the internal cache of the secure hardware to constantly reshuffle the database pages in order to create sufficient uncertainty regarding the exact location of an arbitrary page. We give a formal definition of the privacy level of our algorithm and illustrate how to enforce it in practice. Based on the performance characteristics of the current state-of-the-art secure hardware platforms, we show that our method can provide low page access times, even for very large databases.

UR - http://www.scopus.com/inward/record.url?scp=80052745036&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80052745036&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-23556-6_9

DO - 10.1007/978-3-642-23556-6_9

M3 - Conference contribution

SN - 9783642235559

VL - 6933 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 128

EP - 144

BT - Secure Data Management - 8th VLDB Workshop, SDM 2011, Proceedings

ER -