Security problems on inference control for SUM, MAX, and MIN queries

Author:

Chin Francis1

Affiliation:

1. Univ. of Hong Kong

Abstract

The basic inference problem is defined as follows: For a finite set X = { x i , … , x n }, we wish to infer properties of elements of X on the basis of sets of "queries" regarding subsets of X . By restricting these queries to statistical queries, the statistical database (SDB) security problem is obtained. The security problem for the SDB is to limit the use of the SDB so that only statistical information is available and no sequence of queries is sufficient to infer protected information about any individual. When such information is obtained the SDB is said to be compromised. In this paper, two applications concerning the security of the SDB are considered: On-line application . The queries are answered one by one in sequence and it is necessary to determine whether the SDB is compromised if a new query is answered. Off-line application . All queries are available at the same time and it is necessary to determine the maximum subset of queries to be answered without compromising the SDB. The complexity of these two applications, when the set of queries consists of (a) a single type of SUM query, (b) a single type of MAX/MIN query, (c) mixed types of MAX and MIN queries, (d) mixed types of SUM and MAX/MIN queries, and (e) mixed types of SUM, MAX, and MIN queries, is studied. Efficient algorithms are designed for some of these situations while others are shown to be NP-hard.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference17 articles.

1. The effectiveness of output modification by rounding for protection of statistical databases;ACHUGBUE J. D.;INFOR,1979

2. A security machanism for statistical database

3. Security in statistical databases for queries with small counts

4. CHIN F. Y. AND KOSSOWSKI P. The theory of secure policies for inference control by auditing in statistical databases (unpublished manuscript). CHIN F. Y. AND KOSSOWSKI P. The theory of secure policies for inference control by auditing in statistical databases (unpublished manuscript).

Cited by 43 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Privacy Analysis of Query-Set-Size Control;ACM Transactions on Privacy and Security;2022-07-09

2. CASTLE: Enhancing the Utility of Inequality Query Auditing Without Denial Threats;IEEE Transactions on Information Forensics and Security;2018-07

3. Related Work;Advances in Information Security;2016

4. Privacy Assurance in Data-Aggregation for Multiple MAX Transactions;2015 IEEE 39th Annual Computer Software and Applications Conference;2015-07

5. k-jump: A strategy to design publicly-known algorithms for privacy preserving micro-data disclosure;Journal of Computer Security;2015-06-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3