Abstract
Considered in this paper are numeric databases, whose instances are vectors in \({\cal R}^n\), queries involve their linear transformations, and imprecise query answers are intervals. Introduced for the first time is a security requirement function ρ for a query, to specify the maximum probability ρ(l) that the precise query answer is within any interval of size l. Developed are random disclosure algorithms that satisfy security requirement functions, and guarantee, under certain conditions, maximum data availability.
This material is based upon work supported by National Science Foundation under grants CT-0627493, IIS-0242237, and IIS-0430402; and by Army Research Office under the grant W911NF-07-1-0383.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agrawal, D., Aggarwal, C.C.: On the design and quantification of privacy preserving data mining algorithms. In: Proceedings of the 20th Symposium on Principles of Database Systems (2001)
Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: SIGMOD, pp. 439–450 (2000)
Bertino, E., Samarati, P., Jajodia, S.: An extended authorization model for relational databases. IEEE Transactions on Knowledge and Data Engineering 9(1), 85–101 (1997)
Brodsky, A., Farkas, C., Wijesekera, D., Wang, X.S.: Constraints, inference channels and secure databases. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 98–113. Springer, Heidelberg (2000)
Bell, D.E., Lapadula, L.J.: Secure computer systems: Mathematical foundations and model. The Mitre Corporation (1975)
Dwork, C., Nissim, K.: Privacy-preserving data mining on vertically partitioned databases. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 528–544. Springer, Heidelberg (2004)
Evfimievski, A., Srikant, R., Agrawal, R., Gehrke, J.: Privacy preserving mining of association rules. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery in Databases and DataMining, pp. 217–228. ACM Press, New York (2002)
Jajodia, S., Samarati, P., Sapino, M.L., Subrahmanian, V.S.: Flexible support for multiple access control policies. ACM Trans. Database Syst. 26(2), 214–260 (2001)
Kenthapadi, K., Mishra, N., Nissim, K.: Simulatable auditing. In: PODS, pp. 118–127 (2005)
Li, Y., Wang, L., Wang, X., Jajodia, S.: Auditing interval-based inference. In: Proceedings of the 14th International Conference on Advanced Information Systems Engineering, pp. 553–567 (2002)
Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramaniam, M.: l-diversity: Privacy beyond k-anonymity. In: ICDE (2006)
Samarati, P.: Protecting respondents’ identities in microdata release. IEEE Trans. Knowl. Data Eng. (2001)
Samarati, P., Sweeney, L.: Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. Technical report, CMU, SRI (1998)
Sandhu, R., Coyne, E., Feinstein, H., Youman, C.: Role-based access control models. IEEE Computer, 38–47 (1996)
Xiao, X., Tao, Y.: Personalized privacy preservation. In: SIGMOD (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brodsky, A., Zhang, L., Jajodia, S. (2007). Answering Queries Based on Imprecision and Uncertainty Trade-Offs in Numeric Databases. In: Jonker, W., Petković, M. (eds) Secure Data Management. SDM 2007. Lecture Notes in Computer Science, vol 4721. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75248-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-75248-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75247-9
Online ISBN: 978-3-540-75248-6
eBook Packages: Computer ScienceComputer Science (R0)