971 Hits in 5.7 sec

Approximate and exact hybrid algorithms for private nearest-neighbor queries with database protection

Gabriel Ghinita, Panos Kalnis, Murat Kantarcioglu, Elisa Bertino
2010 Geoinformatica  
We propose hybrid, two-step approaches for private location-based queries which provide protection for both the users and the database.  ...  We also introduce algorithms to efficiently support PIR on dynamic POI Geoinformatica (2011) 15:699-726 sub-sets. We provide solutions for both approximate and exact NN queries.  ...  Experiments We evaluate experimentally the proposed hybrid methods for approximate and exact nearest-neighbor queries with respect to the effectiveness in controlling the disclosed POI and the incurred  ... 
doi:10.1007/s10707-010-0121-4 fatcat:5ukztguhange5ktx6d7j7la5ya

Special section on spatial and temporal databases

Nikos Mamoulis, Thomas Seidl
2011 Geoinformatica  
The paper Approximate and Exact Hybrid Algorithms for Private Nearest-Neighbor Queries with Database Protection, by Gabriel Ghinita, Panos Kalnis, Murat Kantarcioglu, and Elisa Bertino, extends SSTD09  ...  paper "A Hybrid Technique for Private Location-Based Queries with Database Protection."  ... 
doi:10.1007/s10707-011-0139-2 fatcat:vfsripwibvfbffrvni7yfgf244

Optimized kNN Query Processing using Clustering in Untrusted Cloud Environment

Lokesh. V, Anandajayam. P, Shanmugasundaram.S Shanmugasundaram.S
2015 International Journal of Computer Applications  
By using this clustering method, we can get the nearest neighbor query in a fast and efficient manner. Keywords Location based service, point of interest, mutable order preserving encoding, and kNN.  ...  Here, they previously used cloaking region and PIR (Private Information Retrieval). Now we propose Voronoi Diagram along with a new clustering method known as Self Updating Clustering Method.  ...  Bertino, Approximate and exact hybrid algorithmsfor private nearest-neighbor queries with database protection, Geoinformatica 2011 Fig. 3 3 System Architecture  ... 
doi:10.5120/20184-2405 fatcat:geaqnwho5vfrnnfaivtn43i4ji

A Hybrid Technique for Private Location-Based Queries with Database Protection [chapter]

Gabriel Ghinita, Panos Kalnis, Murat Kantarcioglu, Elisa Bertino
2009 Lecture Notes in Computer Science  
We propose a hybrid, two-step approach to private location-based queries, which provides protection for both the users and the database.  ...  Next, a PIR protocol is applied with respect to the obtained query CR.  ...  The work in [5] extends the above-mentioned protocol for binary data to the LBS domain, and proposes approximate (ApproxNN) and exact (ExactNN) protocols for nearest-neighbor queries.  ... 
doi:10.1007/978-3-642-02982-0_9 fatcat:4liiyyg5jbfv3mlrniqqog5b2y

Location Privacy Techniques in Client-Server Architectures [chapter]

Christian S. Jensen, Hua Lu, Man Lung Yiu
2009 Lecture Notes in Computer Science  
Second, they have potential for wide application, as the client-server architecture remains dominant for web services.  ...  We end by pointing out promising directions and open problems.  ...  An alternative server-side algorithm for processing the range nearest neighbor query is also available [17] .  ... 
doi:10.1007/978-3-642-03511-1_2 fatcat:u4fbxg6zkfc5rbqvw7z5yqqvky

Anonymization Privacy Security and Preserving Similarity Joins for Secured Data

Ms. S. Deepa
2018 International Journal for Research in Applied Science and Engineering Technology  
In this thesis, aside from the above work, two obligation clarify this issues on suppression-based and generalization-based k-anonymous and secrete databases are approached.  ...  This project proposed a paper approach to share accommodating -specific lengthwise data that offers booming confidentiality guarantees, while preserving data utility for many biomedical investigations.  ...  Elmehdwi, Bharath K et al [3] describe a novel SkNN protocol to facilitate the k-nearest neighbor search over encrypted data in the cloud that preserves both the data privacy and query privacy.  ... 
doi:10.22214/ijraset.2018.4211 fatcat:vpw6hwp6nzd2xkzxxxw3k2hlqm

Secure and Practical Group Nearest Neighbor Query for Location-Based Services in Cloud Computing

Jingjing Guo, Jiacong Sun, AnMin Fu
2021 Security and Communication Networks  
It supports the GNN query with n n ≥ 3 LBS users and assures the data privacy and query privacy.  ...  Group nearest neighbor (GNN) query enables a group of location-based service (LBS) users to retrieve a point from point of interests (POIs) with the minimum aggregate distance to them.  ...  Acknowledgments is work was supported by National Natural Science Foundation of China (no. 61960206014) and National Crypto Development Foundation (no. MMJJ20180110).  ... 
doi:10.1155/2021/5686506 fatcat:535shhk6avcwldqa3b7b7rkbmy

Privacy-preserving parallel kNN classification algorithm using index-based filtering in cloud computing

Yong-Ki Kim, Hyeong-Jin Kim, Hyunjo Lee, Jae-Woo Chang, Hua Wang
2022 PLoS ONE  
For this, data mining techniques over encrypted data have been studied to protect the original database, user queries and data access patterns.  ...  In addition, the security analysis of the proposed algorithm is performed to prove its data protection, query protection, and access pattern protection.  ...  To process the secure kNN classification queries, the algorithm retrieves the relevant encrypted partition instead of finding the encrypted exact k-nearest neighbors.  ... 
doi:10.1371/journal.pone.0267908 pmid:35511912 pmcid:PMC9070920 fatcat:wlwucssi4rcufcczvsmkjddncy

A Hybrid Location Privacy Solution for Mobile LBS

Ruchika Gupta, Udai Pratap Rao
2017 Mobile Information Systems  
We propose a hybrid solution, HYB, to achieve location privacy for the mobile users who use location services frequently.  ...  This is the major limitation of such approaches; on the other hand, in trusted third-party-free framework clients collaborate with each other and freely communicate with the service provider without any  ...  "Find my nearest retail banking branch of SBI Bank" is the example of specific query, while "Find my nearest bank" is the example of generalized query.  ... 
doi:10.1155/2017/2189646 fatcat:2co7hhliergdlkmefhob3cwb6a

Private Searching on Encrypted Data in Cloud

Huda M., Hameed A.
2017 International Journal of Computer Applications  
This paper build secure and effective system for searching over encrypted images in cloud environment and propose public-key image encryption algorithm from RSA and Paillier algorithms.  ...  We used Scale Invariant Feature Transform algorithm (SIFT) algorithm for image feature extraction, locality sensitive hashing (LSH) to secure sensitive images and build index, and Eculidean distance as  ...  To avoid obstacle of searching in highdimensional space problem, results of c-Approximate Nearest Neighbor search (c-ANN) considered very close as the exact search. c-ANN search problem, include set of  ... 
doi:10.5120/ijca2017913924 fatcat:ulqsysq6uvbsbb2omyecbhul3q

Privacy-Preserving Image Features via Adversarial Affine Subspace Embeddings [article]

Mihai Dusmanu, Johannes L. Schönberger, Sudipta N. Sinha, Marc Pollefeys
2021 arXiv   pre-print
Compared to the original features, our approach makes it significantly more difficult for an adversary to recover private information.  ...  Many computer vision systems require users to upload image features to the cloud for processing and storage.  ...  We preserve the privacy of all query images with sub-hybrid lifting and use point-to-subspace distance for matching.  ... 
arXiv:2006.06634v3 fatcat:c5y5urkycnepjlz7x34lshmtlq

Decentralized Spatial Computing in Urban Environments [chapter]

Patrick Laube, Matt Duckham, Mike Worboys, Tony Joyce
2010 Geojournal Library  
query algorithms, solely collaborating with peers close by and thereby excluding the privacy bottleneck of an omniscient global service provider.  ...  The chapter concludes with a research and development agenda for DeSC in the urban context.  ...  Nearest neighbor queries can then be submitted to the agent's local POI database (cf. Figure 1).  ... 
doi:10.1007/978-90-481-8572-6_4 fatcat:7yfggj4tsbel3fdkarrdplquv4

Maximum Influential Location Selection with Differentially Private User Locations

Sehwa Park, Junkyu Lee, Seog Park
2020 IEEE Access  
Motivated by this, we propose a Max-inf problem query-processing technique with differentially private client location information.  ...  The widespread use of mobile devices and social network services has made optimal location queries an important research topic.  ...  We invoke reverse nearest neighbor (RNN) queries for each potential location p i ∈ P and identify clients whose nearest neighbor is p i .  ... 
doi:10.1109/access.2020.2990706 fatcat:5n5gjbd3bfdfzkqd75vqctlul4

A Privacy Preserving Method Using Privacy Enhancing Techniques for Location Based Services

William J. Buchanan, Zbigniew Kwecka, Elias Ekonomou
2012 Journal on spesial topics in mobile networks and applications  
Information about the user, their location and their trajectory can provide additional context information to a service, leading to useful applications such as directing a user to the nearest bus stop  ...  This paper reviews some of the methods currently being proposed to reduce the impact of location tracking on user privacy, and presents a novel encryption method for preserving the location and trajectory  ...  For this, they have extended the cloaking algorithms for both sporadic and continuous queries with spatial cloaking on an on-demand basis.  ... 
doi:10.1007/s11036-012-0362-6 fatcat:w62elvcxnvho5iqcqo4plmme6a

SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search [article]

Hao Chen and Ilaria Chillotti and Yihe Dong and Oxana Poburinnaya and Ilya Razenshteyn and M. Sadegh Riazi
2020 arXiv   pre-print
The k-Nearest Neighbor Search (k-NNS) is the backbone of several cloud-based services such as recommender systems, face recognition, and database search on text and images.  ...  In this paper, we introduce SANNS, a system for secure k-NNS that keeps client's query and the search result confidential.  ...  Acknowledgments We would like to thank the anonymous reviewers for their feedback and helpful comments. This work was partially done while all the authors visited Microsoft Research Redmond.  ... 
arXiv:1904.02033v5 fatcat:pvcw27sbqngfjekaygamwefjue
« Previous Showing results 1 — 15 out of 971 results