Computing the identification capability of SQL queries for privacy comparison

Research output: Chapter in Book/Report/Conference proceedingsChapterpeer-review

Abstract

Comparing SQL queries is an interesting area of research, with applications of query similarity in different domains; for instance, anomaly-based intrusion detection systems. Comparing two SQL queries in terms of privacy-privacy comparison as well as computing a quantitative value for the identification capability of an SQL query is desirable. In this paper, we compute the identification capability of an SQL query and subsequently we propose an approach to compare two SQL queries in terms of privacy by introducing the notion of privacy equivalence, less-private and more-private relations. Additionally, an edge-labelled directed acyclic graph style privacyaware attribute relationship diagram is proposed that facilitates the privacy comparison.

Original languageEnglish
Title of host publicationIWSPA 2019 - Proceedings of the ACM International Workshop on Security and Privacy Analytics, co-located with CODASPY 2019
PublisherAssociation for Computing Machinery, Inc
Pages47-52
Number of pages6
ISBN (Electronic)9781450361781
DOIs
Publication statusPublished - 13 Mar 2019
Event5th ACM International Workshop on Security and Privacy Analytics, IWSPA 2019, co-located with CODASPY 2019 - Richardson, United States
Duration: 27 Mar 2019 → …

Publication series

NameIWSPA 2019 - Proceedings of the ACM International Workshop on Security and Privacy Analytics, co-located with CODASPY 2019

Conference

Conference5th ACM International Workshop on Security and Privacy Analytics, IWSPA 2019, co-located with CODASPY 2019
Country/TerritoryUnited States
CityRichardson
Period27/03/19 → …

Keywords

  • Database monitoring
  • Electronic privacy
  • Privacy Audit
  • RDBMS,Data-Mining

Fingerprint

Dive into the research topics of 'Computing the identification capability of SQL queries for privacy comparison'. Together they form a unique fingerprint.

Cite this