Abstract
Auditing consists in logging answered queries and checking, each time that a new query is submitted, that no sensitive information is disclosed by combining responses to answered queries with the response to the current query. Such a method for controlling data disclosure naturally raises the following inference problem: Given a set Q of answered queries and a query q, is the information asked by q determined by responses to queries in Q? We solve this inference problem for sum-queries (of real type and nonnegative real type), max-queries and min-queries and provide tests running in polynomial time. To achieve this, we introduce an inference model which, unlike previous inference models, is sound and complete in that the answer to the question of the inference problem comes out to be affirmative if and only if the information asked by q coincides exactly with the value of q determined by Q.
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
Bishop, Y.M., Fienberg, S.E., Holland, P.W.: Discrete Multivariate Analysis: Theory and Practice. MIT Press, Cambridge (1975)
Chen, M.C., McNamee, L., Melkanoff, M.A.: A model of summary data and its applications in statistical databases. In: Rafanelli, M., Klensin, J.C., Svensson, P. (eds.) Proc. IV Int. Working Conf. on Statistical & Scientific Database Management. LNCS, vol. 339, pp. 354–372. Springer, Heidelberg (1989)
Chin, F.: Security problems on inference control for SUM, MAX, and MIN queries. J. ACM 33, 451–464 (1986)
Chin, F.Y., Özsoyoglu, G.: Statistical database design. ACM Trans. Database Syst. 6, 113–139 (1981)
Chin, F.Y., Özsoyoglu, G.: Auditing and inference control in statistical databases. IEEE Trans. Knowl. Data Eng. 8, 574–582 (1982)
Farkas, C., Jajodia, S.: The inference problem: a survey. Proc. of the XXIII Int. Conf. on Very Large Databases, 36–45 (1997)
Kleinberg, J.M., Papadimitriou, C.H., Raghavan, P.: Auditing Boolean attributes. J. Comput. System Sci. 66, 244–253 (2003)
Lenz, H.J., Shoshani, A.: Summarizability in OLAP and statistical databases. In: Proc IX Int. Conf. on Scientific and Statistical Database Management, pp. 132–143 (1997)
Malvestuto, F.M.: The derivation problem of summary data. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 82–89 (1988)
Malvestuto, F.M.: A universal-scheme approach to statistical databases containing homogeneous summary tables. ACM Trans. Database Syst. 18, 678–708 (1993)
Malvestuto, F.M., Mezzini, M., Moscarini, M.: Auditing sum-queries to make a statistical database secure. ACM Trans. Inf. Syst. Security 9, 31–60 (2006)
Malvestuto, F.M., Mezzini, M., Moscarini, M.: An analytical approach to the inference of summary data of additive type. Theoret. Comput. Sci. 385, 264–285 (2007)
Malvestuto, F.M., Moscarini, M.: Aggregate evaluability in statistical databases. In: Proc. of the XI Int. Conf. on Very Large Databases, pp. 279–286 (1989)
Malvestuto, F.M., Moscarini, M.: Query evaluability in statistical databases. IEEE Trans. Knowl. Data Eng. 2, 425–430 (1990)
Shoshani, A.: OLAP and statistical databases: similarities and differences. In: Proc. XVI ACM Symp. on Principles of Database Systems, pp. 185–196 (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Malvestuto, F.M. (2008). Auditing Categorical SUM, MAX and MIN Queries. In: Domingo-Ferrer, J., Saygın, Y. (eds) Privacy in Statistical Databases. PSD 2008. Lecture Notes in Computer Science, vol 5262. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87471-3_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-87471-3_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87470-6
Online ISBN: 978-3-540-87471-3
eBook Packages: Computer ScienceComputer Science (R0)