The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Secure kNN computation on encrypted databases
Abstract
Service providers like Google and Amazon are moving into the SaaS (Software as a Service) business. They turn their huge infrastructure into a cloud-computing environment and aggressively recruit businesses to run applications on their platforms. To enforce security and privacy on such a service model, we need to protect the data running on the platform. Unfortunately, traditional encryption methods that aim at providing "unbreakable" protection are often not adequate because they do not support the execution of applications such as database queries on the encrypted data. In this paper we discuss the general problem of secure computation on an encrypted database and propose a SCONEDB Secure Computation ON an Encrypted DataBase) model, which captures the execution and security requirements. As a case study, we focus on the problem of k-nearest neighbor (kNN) computation on an encrypted database. We develop a new asymmetric scalar-product-preserving encryption (ASPE) that preserves a special type of scalar product. We use APSE to construct two secure schemes that support kNN computation on encrypted data; each of these schemes is shown to resist practical attacks of a different background knowledge level, at a different overhead cost. Extensive performance studies are carried out to evaluate the overhead and the efficiency of the schemes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,411
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity
Li, N., Li, T., & Venkatasubramanian, S. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367856 · Cited by 3,451
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335438 · Cited by 2,961
L-diversity: privacy beyond k-anonymity
Machanavajjhala, A., Gehrke, J., Kifer, D., & Venkitasubramaniam, M. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.1 · Cited by 2,362
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335438 · Cited by 1,719
Order preserving encryption for numeric data
Agrawal, R., Kiernan, J., Srikant, R., & Xu, Y. (2004) · Proceedings of the 2004 ACM SIGMOD international conference on Management of data · doi:10.1145/1007568.1007632 · Cited by 1,206
Executing SQL over encrypted data in the database-service-provider model
Hacigümüş, H., Iyer, B., Li, C., & Mehrotra, S. (2002) · Proceedings of the 2002 ACM SIGMOD international conference on Management of data · doi:10.1145/564691.564717 · Cited by 1,149
The new Casper: query processing for location services without compromising privacy
Mokbel, M. F., Chow, C.-Y., & Aref, W. G. (2006) · doi:10.5555/1182635.1164193 · Cited by 999
Privacy preserving mining of association rules
Evfimievski, A., Srikant, R., Agrawal, R., & Gehrke, J. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775080 · Cited by 768
Private queries in location based services: anonymizers are not necessary
Ghinita, G., Kalnis, P., Khoshgozaran, A., Shahabi, C., & Tan, K.-L. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376631 · Cited by 758
Location Privacy in Mobile Systems: A Personalized Anonymization Model
Gedik, B., & Liu, L. (2005) · 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05) · doi:10.1109/icdcs.2005.48 · Cited by 719
Providing database as a service
Hacigumus, H., Iyer, B., & Mehrotra, S. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994695 · Cited by 613
Privacy Preserving Clustering by Data Transformation
Oliveira, S. R. D. M., & Zai͏̈ane, O. R. (2003) · Journal of Information and Data Management · doi:10.5753/jidm.2010.940 · Cited by 294
Introduction to cryptography: principles and applications
(2016) · Choice Reviews Online · doi:10.5860/choice.195379 · Cited by 225
An Attacker’s View of Distance Preserving Maps for Privacy Preserving Data Mining
Liu, K., Giannella, C. R., & Kargupta, H. (2006) · Lecture notes in computer science · doi:10.1007/11871637_30 · Cited by 150
Aggregation Queries in the Database-As-a-Service Model
Mykletun, E., & Tsudik, G. (2006) · Lecture notes in computer science · doi:10.1007/11805588_7 · Cited by 99
Agrawal, R., Asonov, D., Kantarcıoğlu, M., & Li, Y. (2006) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2006.144 · Cited by 66
Cited by
Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data
Cao, N., Wang, C., Li, M., Ren, K., & Lou, W. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.45 · Cited by 1,259
A Secure and Dynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data
Xia, Z., Wang, X., Sun, X., & Wang, Q. (2016) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2015.2401003 · Cited by 1,181
Enabling Personalized Search over Encrypted Outsourced Data with Efficiency Improvement
Fu, Z., Ren, K., Shu, J., Sun, X., & Huang, F. (2016) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2015.2506573 · Cited by 696
A Privacy-Preserving and Copy-Deterrence Content-Based Image Retrieval Scheme in Cloud Computing
Xia, Z., Wang, X., Zhang, L., Qin, Z., Sun, X., & Ren, K. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2590944 · Cited by 685
Privacy-preserving multi-keyword fuzzy search over encrypted data in the cloud
Wang, B., Yu, S., Lou, W., & Hou, Y. T. (2014) · IEEE INFOCOM 2014 - IEEE Conference on Computer Communications · doi:10.1109/infocom.2014.6848153 · Cited by 391
Metadata
- Authors
- Wong, W. K., Cheung, D. W.-L., Kao, B., & Mamoulis, N.
- Venue
- Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
- Publisher
- ACM
- Published
- 2009-06-29
- Pages
- 139-152
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2041480327
- Cited by
- 901
- References
- 18
- FWCI
- 10.81
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.