17,909 Hits in 2.8 sec

Secure and efficient approximate nearest neighbors search

Benjamin Mathon, Teddy Furon, Laurent Amsaleg, Julien Bringer
2013 Proceedings of the first ACM workshop on Information hiding and multimedia security - IH&MMSec '13  
This paper presents a moderately secure but very efficient approximate nearest neighbors search.  ...  After detailing the threats pertaining to the 'honest but curious' model, our approach starts from a state-of-the-art algorithm in the domain of approximate nearest neighbors search.  ...  This challenge has been addressed in many research works proposing approximate nearest neighbors (k-ANN) search.  ... 
doi:10.1145/2482513.2482539 dblp:conf/ih/MathonFAB13 fatcat:zvqtg2yokrc6rjm3g4msawa2py

Secure binary embeddings for privacy preserving nearest neighbors

Petros Boufounos, Shantanu Rane
2011 2011 IEEE International Workshop on Information Forensics and Security  
We present a novel method to securely determine whether two signals are similar to each other, and apply it to approximate nearest neighbor clustering.  ...  Taking advantage of this property, we suggest that these binary hashes can be used to perform privacy-preserving nearest neighbor search with significantly lower complexity compared to protocols which  ...  It is, therefore, inevitable that reliable, efficient, and secure search of a signal's nearest neighbors has received significant attention in the literature.  ... 
doi:10.1109/wifs.2011.6123149 dblp:conf/wifs/BoufounosR11 fatcat:sydjntnnfvdoroicvruy2itv7u

A Trajectory Privacy Preserving Scheme in the CANNQ Service for IoT

Zhang, Jin, Huang, Fu, Wang
2019 Sensors  
The response speed of the results is improved by narrowing the search scope of the points of interest (POIs) and speeding up the prune of the non-nearest neighbors.  ...  Furthermore, an aggregate nearest neighbor query algorithm based on strategy optimization, is adopted, to minimize the overhead of the LSP.  ...  Suppose the nearest neighbor set of q cur is extended, and the current searched nearest neighbor is p.  ... 
doi:10.3390/s19092190 fatcat:73wfdz5pqzfplj3foswlzykdly

Lightweight Private Similarity Search [article]

Sacha Servan-Schreiber, Simon Langowski, Srinivas Devadas
2021 IACR Cryptology ePrint Archive  
Nearest neighbor search is a fundamental building-block for a wide range of applications.  ...  Existing protocols for private nearest neighbor search require heavy cryptographic tools, resulting in high computational and bandwidth overheads.  ...  Acknowledgements We thank Kyle Hogan and Zachary Newman for helpful feedback on early drafts of this paper.  ... 
dblp:journals/iacr/Servan-Schreiber21a fatcat:h54x5cp2affk7nv7hp4cxfq2ny

A two-step face hallucination approach for video surveillance applications

Zhen Jia, Jianwei Zhao, Hongcheng Wang, Ziyou Xiong, Alan Finn
2013 Multimedia tools and applications  
Our proposed algorithm uses the Approximate Nearest Neighbors (ANN) search method to find a number of nearest neighbors for a stack of queries, instead of finding the exact match for each low frequency  ...  Median filtering is used to remove the noise from the nearest neighbors in order to enhance the signal.  ...  Fast example-based super-resolution with approximate nearest neighbors search Approximate Nearest Neighbors (ANN) search [6, 8] is a well-known database indexing and search method, which quickly and accurately  ... 
doi:10.1007/s11042-013-1721-4 fatcat:tpbk5x5vxjesdnxb472ltndst4

Fast face hallucination with sparse representation for video surveillance

Zhen Jia, Hongcheng Wang, Ziyou Xiong, Alan Finn
2011 The First Asian Conference on Pattern Recognition  
Our proposed algorithm uses the Approximate Nearest Neighbors (ANN) search method to find a number of nearest neighbors for a stack of queries, instead of finding the exact match for each low frequency  ...  Median filtering is used to remove the noise from the nearest neighbors in order to enhance the signal.  ...  From the literature, Approximate Nearest Neighbors searching [3] [1] is a well-known database indexing and searching method, which quickly and accurately retrieves nearest neighbors from a database.  ... 
doi:10.1109/acpr.2011.6166702 dblp:conf/acpr/JiaWXF11 fatcat:oxx4yfyfwjfhnkbbxitkudamr4

Private Information Retrieval Techniques for Enabling Location Privacy in Location-Based Services [chapter]

Ali Khoshgozaran, Cyrus Shahabi
2009 Lecture Notes in Computer Science  
In this chapter, we review a set of fundamental approaches based on private information retrieval to process range and k-nearest neighbor queries, the elemental queries used in many Location Based Services  ...  The anonymity and cloaking-based approaches proposed to address this problem cannot provide stringent privacy guarantees without incurring costly computation and communication overhead.  ...  The empirical comparison between the exact and approximate nearest neighbor search strategies discussed above as well as the efficiency of each partitioning algorithm are presented in [9] .  ... 
doi:10.1007/978-3-642-03511-1_3 fatcat:mcnrxnowhzckbjir6qqygxlgam

Secure and Efficient Nearest Neighbor Query for an Outsourced Database

Jingjing Guo, Jiacong Sun
2020 IEEE Access  
In this paper, we propose the secure and efficient query (SecNN) scheme to address the secure nearest neighbor query problem, which is popular in academia and industry.  ...  Finally, an experimental evaluation demonstrates the high efficiency of our scheme. INDEX TERMS Cloud computing, outsourcing computation, database encryption, nearest neighbor query.  ...  OUR CONTRIBUTIONS In this paper, we focus on the construction of a secure and efficient nearest neighbor query scheme for the outsourced database in cloud computing.  ... 
doi:10.1109/access.2020.2989433 fatcat:gz4m7zoiyfgavo4vhda7ccluam

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.  ...  The security for this query processing technique is provided by the mutable order preserving encoding (mOPE) and cryptographic security process (AES and DES).  ...  Voronoi Diagram We use voronoi diagram in order to yield highly efficient and secure results, when querying about the nearest neighbor than the earlier used cloaking region and private information retrieval  ... 
doi:10.5120/20184-2405 fatcat:geaqnwho5vfrnnfaivtn43i4ji

Privacy-Preserving Approximate k-Nearest-Neighbors Search that Hides Access, Query and Volume Patterns

Alexandra Boldyreva, Tianxin Tang
2021 Proceedings on Privacy Enhancing Technologies  
We study the problem of privacy-preserving approximate kNN search in an outsourced environment — the client sends the encrypted data to an untrusted server and later can perform secure approximate kNN  ...  search and updates.  ...  Acknowledgments We thank Arthur Lazzaretti's help with the experiments and the reviewers for very useful and insightful comments.  ... 
doi:10.2478/popets-2021-0084 fatcat:fvvd57dazjdhrfuouf7bfjnrea

An Efficient Algorithm For Privacy In Nearest Neighbourhood Search In Mqmo For Point Clouds

D. Phaltane Anjali, Prof.Vidya Jagtap.
2018 Zenodo  
In order to protect users private information many solutions are offered but most of them only addressed on snapshot query and no support for continual query and Moving Query Moving Object(MQMO). https  ...  This paper uses a fully distributed setting for secure multi-party group nearest neighbor function evaluation protocol (GNN)., Proceedings of 1st In [7] an energy-efficient search algorithm based on  ...  It does not focus on MQMO and indexing using V. PROPOSED SYSTEM The key idea of the propose system is to advance the security of the user and to focus on efficient retrieval of solutions.  ... 
doi:10.5281/zenodo.1411177 fatcat:y5smvm7uvjam7hge5pcvvs3npe

Privacy Preserving Nearest Neighbor Search

Mark Shaneck, Yongdae Kim, Vipin Kumar
2006 Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)  
In this paper we address the issue of privacy preserving nearest neighbor search, which forms the kernel of many data mining applications.  ...  To this end, we present a novel algorithm based on secure multiparty computation primitives to compute the nearest neighbors of records in horizontally distributed data.  ...  Acknowledgements We would like to thank Nicholas Hopper for his comments on the security proofs, and Karthikeyan Mahadevan, Vishal Kher, Peng Wang, Shyam Boriah, and Varun Chandola for their helpful discussions  ... 
doi:10.1109/icdmw.2006.133 dblp:conf/icdm/ShaneckKK06 fatcat:wt5bkrfisngcdmdh3qatvbjv74

Audio Fingerprinting: Nearest Neighbor Search in High Dimensional Binary Spaces

Matthew L. Miller, Manuel Acevedo Rodriguez, Ingemar J. Cox
2005 Journal of VLSI Signal Processing Systems for Signal, Image and Video Technology  
However, recently, there has been significant work on efficient, approximate, search algorithms. We build on this work and describe preliminary results of a probabilistic search algorithm.  ...  In this paper, we are given an 8192-bit binary representation of each five second interval of a song and therefore focus our attention on the problem of high-dimensional nearest neighbor search.  ...  Acknowledgment The authors thank Ton Kalker and Philips Corporation for use of their fingerprint extraction software.  ... 
doi:10.1007/s11265-005-4152-2 fatcat:fof5yguixzgjjd7zdtze4ojldm

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  
In this paper, we illustrate a secure group nearest neighbor query scheme, which is referred to as SecGNN.  ...  Since SecGNN only achieves linear search complexity, an efficiency enhanced scheme (named Sec GNN + ) is introduced by taking advantage of the KD-tree data structure.  ...  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

An efficient scoring algorithm for Gaussian mixture model based speaker identification

B.L. Pellom, J.H.L. Hansen
1998 IEEE Signal Processing Letters  
The overall approach is integrated into a beam-search strategy and shown to reduce the time to identify a speaker by a factor of 140 over the standard full-search method, and by a factor of six over the  ...  standard beam-search method when identifying speakers from the 138 speaker YOHO corpus.  ...  Evaluations included 1) full Gaussian mixture density evaluation without beam-search; 2) approximated nearest-neighbor Gaussian mixture density evaluation without beam-search; 3) nearest-neighbor approximation  ... 
doi:10.1109/97.728467 fatcat:o4pdve735rdedaz2tvg3jtbos4
« Previous Showing results 1 — 15 out of 17,909 results