Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Wang, Lingyua; * | Li, Yingjiub | Jajodia, Sushilc | Wijesekera, Dumindac
Affiliations: [a] Concordia Institute for Information Systems Engineering, Concordia University, 1455 de Maisonneuve Blvd. West, Montreal, QC H3G 1M8, Canada. E-mail: wang@ciise.concordia.ca | [b] School of Information Systems, Singapore Management University, 80 Stamford Road, Singapore 178902, Republic of Singapore. E-mail: yjli@smu.edu.sg | [c] Center for Secure Information Systems, George Mason University, MSN 5B5, 4400 University Drive, Fairfax, VA 22030-4444, USA. E-mail: dwijesek@gmu.edu, jajodia@gmu.edu
Correspondence: [*] Corresponding author. Tel.: +1-514-848-2424-5662, Fax: +1-514-848-3171, E-mail: wang@ciise.concordia.ca.
Abstract: This paper studies the inference control of multi-dimensional range (MDR) sum queries. We show that existing inference control methods are usually inefficient for MDR queries. We then consider parity-based inference control that restricts users to queries involving an even number of sensitive values. Such a restriction renders inferences significantly more difficult, because an even number is closed under addition and subtraction, whereas inferences target at one value. However, more sophisticated inferences are still possible with only even MDR queries. We show that the collection of all even MDR queries causes inferences if and only if a special collection of sum-two queries (that is, the summation of exactly two values) does so. The result leads to an inference control method with an improved computational complexity O(mn) (over the previous result of O(m2n)) for m MDR queries over n values. We show that no odd MDR queries can be answered without causing inferences. We show how to check non-MDR queries for inferences in linear time. We also show how to find large inference-free subsets of even MDR queries when they do cause inferences.
Keywords: Database security, data privacy, OLAP, range query, inference control, data cube
DOI: 10.3233/JCS-2007-15401
Journal: Journal of Computer Security, vol. 15, no. 4, pp. 417-445, 2007
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl