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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, C.C., Yu, P.S. (eds.): Privacy-Preserving Data Mining - Models and Algorithms. Advances in Database Systems, vol. 34. Springer (2008)
Chen, Y., Evans, D.: Auditing information leakage for distance metrics. In: 3rd IEEE International Conference on Privacy, Security, Risk and Trust, pp. 1131–1140. IEEE (2011)
Chin, F.: Security problems on inference control for sum, max, and min queries. J. ACM 33, 451–464 (1986)
Chin, F., Ozsoyoglu, G.: Auditing for secure statistical databases. In: Proceedings of the ACM 1981 Conference, New York, USA, pp. 53–59 (1981)
Kenthapadi, K.: Models and algorithms for data privacy. Ph.D. Thesis, Computer Science Department, Stanford University (2006)
Kenthapadi, K., Mishra, N., Nissim, K.: Simulatable auditing. In: 25th Symposium on Principles of Database Systems (PODS), pp. 118–127 (2005)
Kleinberg, J., Papadimitriou, C., Raghavan, P.: Auditing boolean attributes. Journal of Computer and System Sciences, 86–91 (2000)
Zhang, L., Jajodia, S., Brodsky, A.: Simulatable Binding: Beyond Simulatable Auditing. In: Jonker, W., Petković, M. (eds.) SDM 2008. LNCS, vol. 5159, pp. 16–31. Springer, Heidelberg (2008)
Lovász, L., Vempala, S.: The geometry of logconcave functions and sampling algorithms. Journal Random Struct. Algorithms 30, 307–358 (2007)
Nabar, S.U., Marthi, B., Kenthapadi, K., Mishra, N., Motwani, R.: Towards robustness in query auditing. In: Proceedings of the 5th VLDB Workshop on Secure Data Management, pp. 151–162 (2006)
Nabar, S.U., Marthi, B., Kenthapadi, K., Mishra, N., Motwani, R.: Towards robustness in query auditing. Technical Report, Stanford University (2006)
Renegar, J.: A polynomial-time algorithm, based on Newton’s method, for linear programming, 1st edn. Mathematical Sciences Research Institute, Berkeley (1986)
Thong, T.V., Buttyán, L.: Query auditing for protecting max/min values of sensitive attributes in statistical databases (2012), http://www.crysys.hu/members/tvthong/QA/ThB12QATech.pdf
Li, Y., Wang, L., Sean Wang, X., Jajodia, S.: Auditing Interval-Based Inference. In: Pidduck, A.B., Mylopoulos, J., Woo, C.C., Ozsu, M.T. (eds.) CAiSE 2002. LNCS, vol. 2348, pp. 553–567. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thong, T.V., Buttyán, L. (2012). Query Auditing for Protecting Max/Min Values of Sensitive Attributes in Statistical Databases. In: Fischer-Hübner, S., Katsikas, S., Quirchmayr, G. (eds) Trust, Privacy and Security in Digital Business. TrustBus 2012. Lecture Notes in Computer Science, vol 7449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32287-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-32287-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32286-0
Online ISBN: 978-3-642-32287-7
eBook Packages: Computer ScienceComputer Science (R0)