Article

Vulnerabilities in similarity search based systems

Authors:

Ali Saman Tosun,

Hakan FerhatosmanogluAuthors Info & Claims

CIKM '02: Proceedings of the eleventh international conference on Information and knowledge management

Pages 110 - 117

https://doi.org/10.1145/584792.584813

Published: 04 November 2002 Publication History

Abstract

Similarity based queries are common in several modern database applications, such as multimedia, scientific, and biomedical databases. In most of these systems, database responds with the tuple with the closest match according to some metric. In this paper we investigate some important security issues related to similarity search in databases. We investigate the vulnerability of such systems against users who try to copy the database by sending automated queries. We analyze two models for similarity search, namely reply model and score model. Reply model responds with the tuple with best match and score model responds with only the score of similarity search. For these models we analyze possible ways of attacks and strategies that can be used to detect attacks. Our analysis shows that in score model it is much easier to plug the vulnerabilities than in reply model. Sophisticated attacks can easily be used in reply model and the database is limited in capability to prevent such attacks.

References

[1]

G. Ankerst, M.and Kastenmüller, H. Kriegel, and T. Seidl. Nearest neighbor classification in 3d protein databases. In Proc. 7th Int. Conf. on Intelligent Systems for Molecular Biology (ISMB'99).]]

Digital Library

[2]

M. Ankerst, H. Kriegel, and T. Seidl. A multi-step approach for shape similarity in image databases. IEEE Transactions on Data Engineering (TKDE'98), 10(6), 1998.]]

Digital Library

[3]

S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching. In 5th Ann. ACM-SIAM Symposium on Discrete Algorithms, pages 573--582, 1994.]]

Digital Library

[4]

S. Berchtold, C. Bohm, D. Keim, and H. Kriegel. A cost model for nearest neighbor search in high-dimensional data space. In Proc. ACM Symp. on Principles of Database Systems, pages 78--86, Tuscon, Arizona, June 1997.]]

Digital Library

[5]

K. H.-P. Berchtold S. S3: Similarity search in cad database systems. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 564--567, Tuscon, Arizona, 1997.]]

Digital Library

[6]

K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is "nearest neighbor" meaningful. In Int. Conf. on Database Theory, pages 217--225, Jerusalem, Israel, Jan. 1999.]]

Digital Library

[7]

X. Cheng, R. Dolin, M. Neary, S. Prabhakar, K. Ravikanth, D. Wu, D. Agrawal, A. El Abbadi, M. Freeston, A. Singh, T. Smith, and J. Su. Scalable access within the context of digital libraries. In IEEE Proceedings of the International Conference on Advances in Digital Libraries, ADL, pages 70--81, Washington, D.C., 1997.]]

Digital Library

[8]

P. Ciaccia and M. Patella. PAC nearest neighbor queries: Approximate and controlled search in high-dimensional and metric spaces. In Proc. Int. Conf. Data Engineering, pages 244--255, San Diego, California, Mar. 2000.]]

Digital Library

[9]

W. Du and M. Atallah. Protocols for secure remote database access with approximate matching. In 7th ACM Conference of Computer and Communications Security (ACMCSS 2000), The First Workshop on Security and Privacy in E-commerce.]]

[10]

C. Faloutsos, R. Barber, M. Flickner, J. Hafner, W. Niblack, D. Petkovic, and W. Equitz. Efficient and effective querying by image content. Journal of Intelligent Information Systems, 3:231--262, 1994.]]

Digital Library

[11]

C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 419--429, Minneapolis, May 1994.]]

Digital Library

[12]

H. Ferhatosmanoglu, I. Stanoi, D. Agrawal, and A. E. Abbadi. Constrained nearest neighbor queries. In Proc. of the 7th International Symposium on Spatial and Temporal Databases (SSTD), Los Angeles, CA, July 2001.]]

Digital Library

[13]

H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. E. Abbadi. Vector approximation based indexing for non-uniform high dimensional data sets. In Proceedings of the 9th ACM Int. Conf. on Information and Knowledge Management, pages 202--209, McLean, Virginia, Nov. 2000.]]

Digital Library

[14]

H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. E. Abbadi. Approximate nearest neighbor searching in multimedia databases. In Proc of 17th IEEE Int. Conf. on Data Engineering (ICDE), pages 503--511, Heidelberg, Germany, Apr. 2001.]]

Digital Library

[15]

P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In 30th ACM Symposium on Theory of Computing, pages 604--613, Dallas, Texas, May 1998.]]

Digital Library

[16]

T. Kahveci and A. Singh. An efficient index structure for string databases. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 351--360, Roma, Italy, Sept. 2001.]]

Digital Library

[17]

F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas. Fast and efficient retrieval of medical tumor shapes. IEEE Transactions on Data Engineering (TKDE'98).]]

Digital Library

[18]

F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas. Fast nearest neighbor search in medical image databases. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 215--226, Mumbai, India, 1996.]]

Digital Library

[19]

G. Miklan and D. Suciu. Cryptographically enforced conditional access for xml. In WebDB, 2002.]]

[20]

N. Roussopoulos, S. Kelly, and F. Vincent. Nearest neighbor queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 71--79, San Jose, California, May 1995.]]

Digital Library

[21]

V. Subrahmanian. Principles of Multimedia Database Systems. Morgan Kaufmann Publishers, Inc., San Francisco, California, 1999.]]

Digital Library

[22]

Y. Ting, M. Winslett, and K. Seamons. Automated trust negotiation over the internet. In 6th World Multiconference on Systemics, Cybernetics and Informatics, July 2002.]]

[23]

R. Weber and K. Bohm. Trading quality for time with nearest-neighbor search. In Proc. Int. Conf. on Extending Database Technology, pages 21--35, Konstanz, Germany, Mar. 2000.]]

Digital Library

Cited By

Altiparmak FTosun AFerhatosmanoglu HSacan A(2008)Automated data discovery in similarity score queriesProceedings of the 13th international conference on Database systems for advanced applications10.5555/1802514.1802558(440-451)Online publication date: 19-Mar-2008
https://dl.acm.org/doi/10.5555/1802514.1802558
Altiparmak FTosun AFerhatosmanoglu HSacan A(2008)Automated Data Discovery in Similarity Score QueriesDatabase Systems for Advanced Applications10.1007/978-3-540-78568-2_33(440-451)Online publication date: 2008
https://doi.org/10.1007/978-3-540-78568-2_33
Liu NYan JBai FZhang BXi WFan WChen ZJi LHu CMa W(2005)A similarity reinforcement algorithm for heterogeneous web pagesProceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development10.1007/978-3-540-31849-1_13(121-132)Online publication date: 29-Mar-2005
https://dl.acm.org/doi/10.1007/978-3-540-31849-1_13
Show More Cited By

Recommendations

Measuring Similarity for Security Vulnerabilities
HICSS '10: Proceedings of the 2010 43rd Hawaii International Conference on System Sciences

As the number of software vulnerabilities increases year by year, software vulnerability becomes a focusing point in information security. This paper proposes a vulnerability similarity measurement to compare different vulnerabilities according to a set ...
Cybersecurity: Zero-Day Vulnerabilities and Attack Vectors
Security vulnerabilities and mitigation techniques of web applications
SIN '13: Proceedings of the 6th International Conference on Security of Information and Networks

Web applications contain vulnerabilities, which may lead to serious security breaches such as stealing of confidential information. To protect against security breaches, it is necessary to understand the detailed steps of attacks and the pros and cons ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CIKM '02: Proceedings of the eleventh international conference on Information and knowledge management

November 2002

704 pages

ISBN:1581134924

DOI:10.1145/584792

General Chair:
Charles Nicholas
University of Maryland Baltimore County
,
Program Chairs:
David Grossman
Illinois Institute of Technology
,
Konstantinos Kalpakis
University of Maryland Baltimore County
,
Sajda Qureshi
Erasmus University, Rotterdam
,
Han van Dissel
Erasmus University, Rotterdam
,
Len Seligman
The MITRE Corporation

Copyright © 2002 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 November 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

CIKM02

Sponsor:

CIKM02: Eleventh ACM International Conference on Information and Knowledge Management

November 4 - 9, 2002

Virginia, McLean, USA

Acceptance Rates

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
471
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)1

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Altiparmak FTosun AFerhatosmanoglu HSacan A(2008)Automated data discovery in similarity score queriesProceedings of the 13th international conference on Database systems for advanced applications10.5555/1802514.1802558(440-451)Online publication date: 19-Mar-2008
https://dl.acm.org/doi/10.5555/1802514.1802558
Altiparmak FTosun AFerhatosmanoglu HSacan A(2008)Automated Data Discovery in Similarity Score QueriesDatabase Systems for Advanced Applications10.1007/978-3-540-78568-2_33(440-451)Online publication date: 2008
https://doi.org/10.1007/978-3-540-78568-2_33
Liu NYan JBai FZhang BXi WFan WChen ZJi LHu CMa W(2005)A similarity reinforcement algorithm for heterogeneous web pagesProceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development10.1007/978-3-540-31849-1_13(121-132)Online publication date: 29-Mar-2005
https://dl.acm.org/doi/10.1007/978-3-540-31849-1_13
Liu NZhang BYan JYang QYan SChen ZBai FMa WGrossman DGravano LZhai CHerzog OEvans D(2004)Learning similarity measures in non-orthogonal spaceProceedings of the thirteenth ACM international conference on Information and knowledge management10.1145/1031171.1031240(334-341)Online publication date: 13-Nov-2004
https://dl.acm.org/doi/10.1145/1031171.1031240

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents