Answering Multiple Aggregate Queries under a Specific Privacy Condition

Jordi Aranda; J. Nin; Javier Herranz

doi:10.1109/COMPSAC.2018.00099

Answering Multiple Aggregate Queries under a Specific Privacy Condition

Jordi Aranda, J. Nin, Javier Herranz

Research output: Book chapter › Conference contribution › peer-review

Abstract

We consider a real web tool where a bank allows clients to make aggregate queries on the market share of some subset of businesses, in a specific geographic area and all belonging to the same kind of business (e.g. restaurants). A single query is positively answered if a specific basic privacy condition is satisfied by the individual market shares of the involved businesses. A more serious problem appears when multiple queries are allowed: the combination of queries which individually satisfy the basic privacy condition may lead to aggregate information of some subset of businesses which does not satisfy this condition. We give a mathematical formalization of this problem and a possible algorithmic solution, which consists in an off-line phase, run only once, and an on-line phase which is run for each new query. We analyze the complexity of the proposed algorithms and we describe the experimental results that we have obtained with the implementation of such algorithms, run on real data.

Original language	English
Title of host publication	Proceedings - 2018 IEEE 42nd Annual Computer Software and Applications Conference, COMPSAC 2018
Editors	Chung-Horng Lung, Thomas Conte, Ling Liu, Toyokazu Akiyama, Kamrul Hasan, Edmundo Tovar, Hiroki Takakura, William Claycomb, Stelvio Cimato, Ji-Jiang Yang, Zhiyong Zhang, Sheikh Iqbal Ahamed, Sorel Reisman, Claudio Demartini, Motonori Nakamura
Publisher	IEEE Computer Society
Pages	661-666
Number of pages	6
ISBN (Electronic)	9781538626665
DOIs	https://doi.org/10.1109/COMPSAC.2018.00099
Publication status	Published - 8 Jun 2018
Externally published	Yes
Event	42nd IEEE Computer Software and Applications Conference, COMPSAC 2018 - Tokyo, Japan Duration: 23 Jul 2018 → 27 Jul 2018

Publication series

Name	Proceedings - International Computer Software and Applications Conference
Volume	1
ISSN (Print)	0730-3157

Conference

Conference	42nd IEEE Computer Software and Applications Conference, COMPSAC 2018
Country/Territory	Japan
City	Tokyo
Period	23/07/18 → 27/07/18

Keywords

Credit card payments
Privacy
Question answering

Access to Document

10.1109/COMPSAC.2018.00099

Cite this

Aranda, J., Nin, J., & Herranz, J. (2018). Answering Multiple Aggregate Queries under a Specific Privacy Condition. In C.-H. Lung, T. Conte, L. Liu, T. Akiyama, K. Hasan, E. Tovar, H. Takakura, W. Claycomb, S. Cimato, J.-J. Yang, Z. Zhang, S. I. Ahamed, S. Reisman, C. Demartini, & M. Nakamura (Eds.), Proceedings - 2018 IEEE 42nd Annual Computer Software and Applications Conference, COMPSAC 2018 (pp. 661-666). Article 8377724 (Proceedings - International Computer Software and Applications Conference; Vol. 1). IEEE Computer Society. https://doi.org/10.1109/COMPSAC.2018.00099

Aranda, Jordi ; Nin, J. ; Herranz, Javier. / Answering Multiple Aggregate Queries under a Specific Privacy Condition. Proceedings - 2018 IEEE 42nd Annual Computer Software and Applications Conference, COMPSAC 2018. editor / Chung-Horng Lung ; Thomas Conte ; Ling Liu ; Toyokazu Akiyama ; Kamrul Hasan ; Edmundo Tovar ; Hiroki Takakura ; William Claycomb ; Stelvio Cimato ; Ji-Jiang Yang ; Zhiyong Zhang ; Sheikh Iqbal Ahamed ; Sorel Reisman ; Claudio Demartini ; Motonori Nakamura. IEEE Computer Society, 2018. pp. 661-666 (Proceedings - International Computer Software and Applications Conference).

@inproceedings{bc53348b2f534260a7a56122f09863a8,

title = "Answering Multiple Aggregate Queries under a Specific Privacy Condition",

abstract = "We consider a real web tool where a bank allows clients to make aggregate queries on the market share of some subset of businesses, in a specific geographic area and all belonging to the same kind of business (e.g. restaurants). A single query is positively answered if a specific basic privacy condition is satisfied by the individual market shares of the involved businesses. A more serious problem appears when multiple queries are allowed: the combination of queries which individually satisfy the basic privacy condition may lead to aggregate information of some subset of businesses which does not satisfy this condition. We give a mathematical formalization of this problem and a possible algorithmic solution, which consists in an off-line phase, run only once, and an on-line phase which is run for each new query. We analyze the complexity of the proposed algorithms and we describe the experimental results that we have obtained with the implementation of such algorithms, run on real data.",

keywords = "Credit card payments, Privacy, Question answering",

author = "Jordi Aranda and J. Nin and Javier Herranz",

note = "Funding Information: ACKNOWLEDGEMENTS The work of the third author was partially supported by project MTM2016-77213-R of Spanish Ministry MINECO. Publisher Copyright: {\textcopyright} 2018 IEEE.; 42nd IEEE Computer Software and Applications Conference, COMPSAC 2018 ; Conference date: 23-07-2018 Through 27-07-2018",

year = "2018",

month = jun,

day = "8",

doi = "10.1109/COMPSAC.2018.00099",

language = "English",

series = "Proceedings - International Computer Software and Applications Conference",

publisher = "IEEE Computer Society",

pages = "661--666",

editor = "Chung-Horng Lung and Thomas Conte and Ling Liu and Toyokazu Akiyama and Kamrul Hasan and Edmundo Tovar and Hiroki Takakura and William Claycomb and Stelvio Cimato and Ji-Jiang Yang and Zhiyong Zhang and Ahamed, {Sheikh Iqbal} and Sorel Reisman and Claudio Demartini and Motonori Nakamura",

booktitle = "Proceedings - 2018 IEEE 42nd Annual Computer Software and Applications Conference, COMPSAC 2018",

address = "United States",

}

Aranda, J, Nin, J & Herranz, J 2018, Answering Multiple Aggregate Queries under a Specific Privacy Condition. in C-H Lung, T Conte, L Liu, T Akiyama, K Hasan, E Tovar, H Takakura, W Claycomb, S Cimato, J-J Yang, Z Zhang, SI Ahamed, S Reisman, C Demartini & M Nakamura (eds), Proceedings - 2018 IEEE 42nd Annual Computer Software and Applications Conference, COMPSAC 2018., 8377724, Proceedings - International Computer Software and Applications Conference, vol. 1, IEEE Computer Society, pp. 661-666, 42nd IEEE Computer Software and Applications Conference, COMPSAC 2018, Tokyo, Japan, 23/07/18. https://doi.org/10.1109/COMPSAC.2018.00099

Answering Multiple Aggregate Queries under a Specific Privacy Condition. / Aranda, Jordi; Nin, J.; Herranz, Javier.
Proceedings - 2018 IEEE 42nd Annual Computer Software and Applications Conference, COMPSAC 2018. ed. / Chung-Horng Lung; Thomas Conte; Ling Liu; Toyokazu Akiyama; Kamrul Hasan; Edmundo Tovar; Hiroki Takakura; William Claycomb; Stelvio Cimato; Ji-Jiang Yang; Zhiyong Zhang; Sheikh Iqbal Ahamed; Sorel Reisman; Claudio Demartini; Motonori Nakamura. IEEE Computer Society, 2018. p. 661-666 8377724 (Proceedings - International Computer Software and Applications Conference; Vol. 1).

Research output: Book chapter › Conference contribution › peer-review

TY - GEN

T1 - Answering Multiple Aggregate Queries under a Specific Privacy Condition

AU - Aranda, Jordi

AU - Nin, J.

AU - Herranz, Javier

PY - 2018/6/8

Y1 - 2018/6/8

N2 - We consider a real web tool where a bank allows clients to make aggregate queries on the market share of some subset of businesses, in a specific geographic area and all belonging to the same kind of business (e.g. restaurants). A single query is positively answered if a specific basic privacy condition is satisfied by the individual market shares of the involved businesses. A more serious problem appears when multiple queries are allowed: the combination of queries which individually satisfy the basic privacy condition may lead to aggregate information of some subset of businesses which does not satisfy this condition. We give a mathematical formalization of this problem and a possible algorithmic solution, which consists in an off-line phase, run only once, and an on-line phase which is run for each new query. We analyze the complexity of the proposed algorithms and we describe the experimental results that we have obtained with the implementation of such algorithms, run on real data.

AB - We consider a real web tool where a bank allows clients to make aggregate queries on the market share of some subset of businesses, in a specific geographic area and all belonging to the same kind of business (e.g. restaurants). A single query is positively answered if a specific basic privacy condition is satisfied by the individual market shares of the involved businesses. A more serious problem appears when multiple queries are allowed: the combination of queries which individually satisfy the basic privacy condition may lead to aggregate information of some subset of businesses which does not satisfy this condition. We give a mathematical formalization of this problem and a possible algorithmic solution, which consists in an off-line phase, run only once, and an on-line phase which is run for each new query. We analyze the complexity of the proposed algorithms and we describe the experimental results that we have obtained with the implementation of such algorithms, run on real data.

KW - Credit card payments

KW - Privacy

KW - Question answering

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

U2 - 10.1109/COMPSAC.2018.00099

DO - 10.1109/COMPSAC.2018.00099

M3 - Conference contribution

AN - SCOPUS:85055425097

T3 - Proceedings - International Computer Software and Applications Conference

SP - 661

EP - 666

BT - Proceedings - 2018 IEEE 42nd Annual Computer Software and Applications Conference, COMPSAC 2018

A2 - Lung, Chung-Horng

A2 - Conte, Thomas

A2 - Liu, Ling

A2 - Akiyama, Toyokazu

A2 - Hasan, Kamrul

A2 - Tovar, Edmundo

A2 - Takakura, Hiroki

A2 - Claycomb, William

A2 - Cimato, Stelvio

A2 - Yang, Ji-Jiang

A2 - Zhang, Zhiyong

A2 - Ahamed, Sheikh Iqbal

A2 - Reisman, Sorel

A2 - Demartini, Claudio

A2 - Nakamura, Motonori

PB - IEEE Computer Society

T2 - 42nd IEEE Computer Software and Applications Conference, COMPSAC 2018

Y2 - 23 July 2018 through 27 July 2018

ER -

Aranda J, Nin J, Herranz J. Answering Multiple Aggregate Queries under a Specific Privacy Condition. In Lung CH, Conte T, Liu L, Akiyama T, Hasan K, Tovar E, Takakura H, Claycomb W, Cimato S, Yang JJ, Zhang Z, Ahamed SI, Reisman S, Demartini C, Nakamura M, editors, Proceedings - 2018 IEEE 42nd Annual Computer Software and Applications Conference, COMPSAC 2018. IEEE Computer Society. 2018. p. 661-666. 8377724. (Proceedings - International Computer Software and Applications Conference). doi: 10.1109/COMPSAC.2018.00099

Answering Multiple Aggregate Queries under a Specific Privacy Condition

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this