Detecting suspicious relational database queries

ARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings

Volumn , Issue , 2008, Pages 771-778

  Böttcher, Stefan ^a   Hartel, Rita ^a   Kirschner, Matthias ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS CONTROL; DATABASE SYSTEMS; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION;

BOOLEAN FORMULAS; INTERNATIONAL CONFERENCES; NP-COMPLETE; POLYNOMIAL-TIME; PRIVACY VIOLATION; RELATIONAL DATABASES; SECRET INFORMATIONS; THIRD PARTIES;

BOOLEAN FUNCTIONS;

EID: 49049112899     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ARES.2008.125     Document Type: Conference Paper

References (18)

1. C. C. Aggarwal. On k-anonymity and the curse of dimensionality. In Böhm et al. [6], pages 901-909.
2. R. Agrawal, R. J. B. Jr., C. Faloutsos, J. Kiernan, R. Rantzau, and R. Srikant. Auditing compliance with a hippocratic database. In M. A. Nascimento, M. T. Özsu, D. Kossmann, R. J. Miller, J. A. Blakeley, and K. B. Schiefer, editors, VLDB, pages 516-527. Morgan Kaufmann, 2004.
3. R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu. Hippocratic databases. In VLDB, pages 143-154. Morgan Kaufmann, 2002.
4. E. Bertino, S. Castano, and E. Ferrari. On specifying security policies for web documents with an XML-based language. In SACMAT, pages 57-65, 2001.
5. E. Bertino and E. Ferrari. Secure and selective dissemination of XML documents. ACM Trans. Inf. Syst. Secur., 5(3):290-331,2002.
6. K. Böhm, C. S. Jensen, L. M. Haas, M. L. Kersten, P.-Å. Larson, and B. C. Ooi, editors. Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30 - September 2, 2005. ACM, 2005.
7. S. Böttcher and R. Steinmetz. Information Disclosure by XPath Queries. In Jonkerand Petkovic [10], pages 160-174.
8. J.-W. Byun, Y. Sohn, E. Bertino, and N. Li. Secure Anonymization for Incremental Datasets. In Jonker and Petkovic [10], pages 48-63.
9. E. Damiani, S. D. C. di Vimercati, S. Paraboschi, and P. Samarati. Securing XML Documents. In C. Zaniolo, P. C. Lockemann, M. H. Scholl, and T. Grust, editors, EDBT, volume 1777 of Lecture Notes in Computer Science, pages 121-135. Springer, 2000.
10. W. Jonker and M. Petkovic, editors. Secure Data Management, Third VLDB Workshop, SDM 2006, Seoul, Korea, September 10-11, 2006, Proceedings, volume 4165 of Lecture Notes in Computer Science. Springer, 2006.
11. K. LeFevre, D. J. DeWitt, and R. Ramakrishnan. Incognito: Efficient Full-Domain K-Anonymity. In F. Özcan, editor, SIGMOD Conference, pages 49-60. ACM, 2005.
12. A. Meyerson and R. Williams. On the Complexity of Optimal K-Anonymity. In A. Deutsch, editor, PODS, pages 223-228. ACM, 2004.
13. R. Munz, H.-J. Schneider, and F. Steyer. Application of Sub-Predicate Tests in Database Systems. In A. L. Furtado and H. L. Morgan, editors, VLDB, pages 426-435. IEEE Computer Society, 1979.
14. P. Samarati. Protecting Respondents' Identities in Microdata Release. IEEE Trans. Knowl. Data Eng., 13(6): 1010-1027, 2001.
15. K. Stoffel and T. Studer. Provable Data Privacy. In K. V. Andersen, J. K. Debenham, and R. Wagner, editors, DEXA, volume 3588 of Lecture Notes in Computer Science, pages 324-332. Springer, 2005.
16. L. Sweene. Achieving k-Anonymity Privacy Protection Using Generalization and Suppression. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 10(5):571-588, 2002.
17. L. Sweene. k-Anonymity: A Model for Protecting Privacy. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 10(5):557-570, 2002.
18. C. Yao, X. S. Wang, and S. Jajodia. Checking for k-Anonymity Violation by Views. In Böhm et al. [6], pages 910-921.