5,049 research outputs found
SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search
The -Nearest Neighbor Search (-NNS) is the backbone of several
cloud-based services such as recommender systems, face recognition, and
database search on text and images. In these services, the client sends the
query to the cloud server and receives the response in which case the query and
response are revealed to the service provider. Such data disclosures are
unacceptable in several scenarios due to the sensitivity of data and/or privacy
laws.
In this paper, we introduce SANNS, a system for secure -NNS that keeps
client's query and the search result confidential. SANNS comprises two
protocols: an optimized linear scan and a protocol based on a novel sublinear
time clustering-based algorithm. We prove the security of both protocols in the
standard semi-honest model. The protocols are built upon several
state-of-the-art cryptographic primitives such as lattice-based additively
homomorphic encryption, distributed oblivious RAM, and garbled circuits. We
provide several contributions to each of these primitives which are applicable
to other secure computation tasks. Both of our protocols rely on a new circuit
for the approximate top- selection from numbers that is built from comparators.
We have implemented our proposed system and performed extensive experimental
results on four datasets in two different computation environments,
demonstrating more than faster response time compared to
optimally implemented protocols from the prior work. Moreover, SANNS is the
first work that scales to the database of 10 million entries, pushing the limit
by more than two orders of magnitude.Comment: 18 pages, to appear at USENIX Security Symposium 202
Privacy preserving protocol for detecting genetic relatives using rare variants.
MotivationHigh-throughput sequencing technologies have impacted many areas of genetic research. One such area is the identification of relatives from genetic data. The standard approach for the identification of genetic relatives collects the genomic data of all individuals and stores it in a database. Then, each pair of individuals is compared to detect the set of genetic relatives, and the matched individuals are informed. The main drawback of this approach is the requirement of sharing your genetic data with a trusted third party to perform the relatedness test.ResultsIn this work, we propose a secure protocol to detect the genetic relatives from sequencing data while not exposing any information about their genomes. We assume that individuals have access to their genome sequences but do not want to share their genomes with anyone else. Unlike previous approaches, our approach uses both common and rare variants which provide the ability to detect much more distant relationships securely. We use a simulated data generated from the 1000 genomes data and illustrate that we can easily detect up to fifth degree cousins which was not possible using the existing methods. We also show in the 1000 genomes data with cryptic relationships that our method can detect these individuals.AvailabilityThe software is freely available for download at http://genetics.cs.ucla.edu/crypto/
Privacy Preserving Multi-Server k-means Computation over Horizontally Partitioned Data
The k-means clustering is one of the most popular clustering algorithms in
data mining. Recently a lot of research has been concentrated on the algorithm
when the dataset is divided into multiple parties or when the dataset is too
large to be handled by the data owner. In the latter case, usually some servers
are hired to perform the task of clustering. The dataset is divided by the data
owner among the servers who together perform the k-means and return the cluster
labels to the owner. The major challenge in this method is to prevent the
servers from gaining substantial information about the actual data of the
owner. Several algorithms have been designed in the past that provide
cryptographic solutions to perform privacy preserving k-means. We provide a new
method to perform k-means over a large set using multiple servers. Our
technique avoids heavy cryptographic computations and instead we use a simple
randomization technique to preserve the privacy of the data. The k-means
computed has exactly the same efficiency and accuracy as the k-means computed
over the original dataset without any randomization. We argue that our
algorithm is secure against honest but curious and passive adversary.Comment: 19 pages, 4 tables. International Conference on Information Systems
Security. Springer, Cham, 201
NextBestOnce: Achieving Polylog Routing despite Non-greedy Embeddings
Social Overlays suffer from high message delivery delays due to insufficient
routing strategies. Limiting connections to device pairs that are owned by
individuals with a mutual trust relationship in real life, they form topologies
restricted to a subgraph of the social network of their users. While
centralized, highly successful social networking services entail a complete
privacy loss of their users, Social Overlays at higher performance represent an
ideal private and censorship-resistant communication substrate for the same
purpose.
Routing in such restricted topologies is facilitated by embedding the social
graph into a metric space. Decentralized routing algorithms have up to date
mainly been analyzed under the assumption of a perfect lattice structure.
However, currently deployed embedding algorithms for privacy-preserving Social
Overlays cannot achieve a sufficiently accurate embedding and hence
conventional routing algorithms fail. Developing Social Overlays with
acceptable performance hence requires better models and enhanced algorithms,
which guarantee convergence in the presence of local optima with regard to the
distance to the target.
We suggest a model for Social Overlays that includes inaccurate embeddings
and arbitrary degree distributions. We further propose NextBestOnce, a routing
algorithm that can achieve polylog routing length despite local optima. We
provide analytical bounds on the performance of NextBestOnce assuming a
scale-free degree distribution, and furthermore show that its performance can
be improved by more than a constant factor when including Neighbor-of-Neighbor
information in the routing decisions.Comment: 23 pages, 2 figure
- …