Query auditing for protecting max/min values of sensitive attributes in statistical databases

Ta Vinh Thong, L. Buttyán

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

1 Citation (Scopus)

Abstract

In this paper, we define a novel setting for query auditing, where instead of detecting or preventing the disclosure of individual sensitive values, we want to detect or prevent the disclosure of aggregate values in the database. More specifically, we study the problem of detecting or preventing the disclosure of the maximum (minimum) value in the database, when the querier is allowed to issue average queries to the database. We propose efficient off-line and on-line query auditors for this problem in the full disclosure model, and an efficient simulatable on-line query auditor in the partial disclosure model.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages192-206
Number of pages15
Volume7449 LNCS
DOIs
Publication statusPublished - 2012
Event9th International Conference on Trust, Privacy and Security in Digital Business, TrustBus 2012 - Vienna, Austria
Duration: Sep 3 2012Sep 7 2012

Publication series

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

Other

Other9th International Conference on Trust, Privacy and Security in Digital Business, TrustBus 2012
CountryAustria
CityVienna
Period9/3/129/7/12

Fingerprint

Auditing
Disclosure
Min-max
Attribute
Query
Partial
Line
Model

Keywords

  • offline auditor
  • online auditor
  • Privacy
  • probabilistic auditor
  • query auditing
  • simulatable auditor
  • statistical database

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Thong, T. V., & Buttyán, L. (2012). Query auditing for protecting max/min values of sensitive attributes in statistical databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7449 LNCS, pp. 192-206). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7449 LNCS). https://doi.org/10.1007/978-3-642-32287-7_17

Query auditing for protecting max/min values of sensitive attributes in statistical databases. / Thong, Ta Vinh; Buttyán, L.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7449 LNCS 2012. p. 192-206 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7449 LNCS).

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

Thong, TV & Buttyán, L 2012, Query auditing for protecting max/min values of sensitive attributes in statistical databases. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 7449 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7449 LNCS, pp. 192-206, 9th International Conference on Trust, Privacy and Security in Digital Business, TrustBus 2012, Vienna, Austria, 9/3/12. https://doi.org/10.1007/978-3-642-32287-7_17
Thong TV, Buttyán L. Query auditing for protecting max/min values of sensitive attributes in statistical databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7449 LNCS. 2012. p. 192-206. (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-32287-7_17
Thong, Ta Vinh ; Buttyán, L. / Query auditing for protecting max/min values of sensitive attributes in statistical databases. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7449 LNCS 2012. pp. 192-206 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{53ca0b3bca294a3eaf097fa3700434c3,
title = "Query auditing for protecting max/min values of sensitive attributes in statistical databases",
abstract = "In this paper, we define a novel setting for query auditing, where instead of detecting or preventing the disclosure of individual sensitive values, we want to detect or prevent the disclosure of aggregate values in the database. More specifically, we study the problem of detecting or preventing the disclosure of the maximum (minimum) value in the database, when the querier is allowed to issue average queries to the database. We propose efficient off-line and on-line query auditors for this problem in the full disclosure model, and an efficient simulatable on-line query auditor in the partial disclosure model.",
keywords = "offline auditor, online auditor, Privacy, probabilistic auditor, query auditing, simulatable auditor, statistical database",
author = "Thong, {Ta Vinh} and L. Butty{\'a}n",
year = "2012",
doi = "10.1007/978-3-642-32287-7_17",
language = "English",
isbn = "9783642322860",
volume = "7449 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "192--206",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Query auditing for protecting max/min values of sensitive attributes in statistical databases

AU - Thong, Ta Vinh

AU - Buttyán, L.

PY - 2012

Y1 - 2012

N2 - In this paper, we define a novel setting for query auditing, where instead of detecting or preventing the disclosure of individual sensitive values, we want to detect or prevent the disclosure of aggregate values in the database. More specifically, we study the problem of detecting or preventing the disclosure of the maximum (minimum) value in the database, when the querier is allowed to issue average queries to the database. We propose efficient off-line and on-line query auditors for this problem in the full disclosure model, and an efficient simulatable on-line query auditor in the partial disclosure model.

AB - In this paper, we define a novel setting for query auditing, where instead of detecting or preventing the disclosure of individual sensitive values, we want to detect or prevent the disclosure of aggregate values in the database. More specifically, we study the problem of detecting or preventing the disclosure of the maximum (minimum) value in the database, when the querier is allowed to issue average queries to the database. We propose efficient off-line and on-line query auditors for this problem in the full disclosure model, and an efficient simulatable on-line query auditor in the partial disclosure model.

KW - offline auditor

KW - online auditor

KW - Privacy

KW - probabilistic auditor

KW - query auditing

KW - simulatable auditor

KW - statistical database

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

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

U2 - 10.1007/978-3-642-32287-7_17

DO - 10.1007/978-3-642-32287-7_17

M3 - Conference contribution

AN - SCOPUS:84866012431

SN - 9783642322860

VL - 7449 LNCS

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

SP - 192

EP - 206

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

ER -