International audienceThis 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. We gradually develop mechanisms partially blocking the attacks threatening the original algorithm. The loss of performances compared to the original algorithm is mainly an overhead of a constant computation time and communication payload which are independent of the size of the database
We introduce a new variant of the nearest neighbor search problem, which allows for some coordinates...
Data mining is frequently obstructed by privacy concerns. In many cases, data is distributed and br...
Abstract—In this paper, we investigate the secure nearest neighbor (SNN) problem, in which a client ...
International audienceThis paper presents a moderately secure but very efficient approximate nearest...
Nearest neighbor search is a fundamental building-block for a wide range of applications. A privacy-...
Nearest-neighbor search is a very natural and universal problem in computer science. Often times, th...
Approximate Nearest neighbor search (ANNS) is fundamental and essential operation in applications f...
The nearest neighbor problem is one of the most important problems in computational geometry. Many o...
This paper describes a new approach for performing efficient approximate k-nearest-neighbor searches...
In this paper we present an original approach for finding approximate nearest neighbours in collecti...
In this article, we propose a scheme, named QuickN, which can efficiently and securely enable neares...
International audienceThis paper proposes a binarization scheme for vectors of high dimension based ...
We study the problem of privacy-preserving approximate kNN search in an outsourced environment — the...
The long-standing problem of efficient nearest-neighbor (NN) search has ubiqui-tous applications ran...
The nearest neighbor problem is the following: Given a set of n points P = fp1�:::�p ng in some metr...
We introduce a new variant of the nearest neighbor search problem, which allows for some coordinates...
Data mining is frequently obstructed by privacy concerns. In many cases, data is distributed and br...
Abstract—In this paper, we investigate the secure nearest neighbor (SNN) problem, in which a client ...
International audienceThis paper presents a moderately secure but very efficient approximate nearest...
Nearest neighbor search is a fundamental building-block for a wide range of applications. A privacy-...
Nearest-neighbor search is a very natural and universal problem in computer science. Often times, th...
Approximate Nearest neighbor search (ANNS) is fundamental and essential operation in applications f...
The nearest neighbor problem is one of the most important problems in computational geometry. Many o...
This paper describes a new approach for performing efficient approximate k-nearest-neighbor searches...
In this paper we present an original approach for finding approximate nearest neighbours in collecti...
In this article, we propose a scheme, named QuickN, which can efficiently and securely enable neares...
International audienceThis paper proposes a binarization scheme for vectors of high dimension based ...
We study the problem of privacy-preserving approximate kNN search in an outsourced environment — the...
The long-standing problem of efficient nearest-neighbor (NN) search has ubiqui-tous applications ran...
The nearest neighbor problem is the following: Given a set of n points P = fp1�:::�p ng in some metr...
We introduce a new variant of the nearest neighbor search problem, which allows for some coordinates...
Data mining is frequently obstructed by privacy concerns. In many cases, data is distributed and br...
Abstract—In this paper, we investigate the secure nearest neighbor (SNN) problem, in which a client ...