517 research outputs found
The Secure Link Prediction Problem
Link Prediction is an important and well-studied problem for social networks.
Given a snapshot of a graph, the link prediction problem predicts which new
interactions between members are most likely to occur in the near future. As
networks grow in size, data owners are forced to store the data in remote cloud
servers which reveals sensitive information about the network. The graphs are
therefore stored in encrypted form.
We study the link prediction problem on encrypted graphs. To the best of our
knowledge, this secure link prediction problem has not been studied before. We
use the number of common neighbors for prediction. We present three algorithms
for the secure link prediction problem. We design prototypes of the schemes and
formally prove their security. We execute our algorithms in real-life datasets.Comment: This has been accepted for publication in Advances in Mathematics of
Communications (AMC) journa
GraphSE: An Encrypted Graph Database for Privacy-Preserving Social Search
In this paper, we propose GraphSE, an encrypted graph database for online
social network services to address massive data breaches. GraphSE preserves
the functionality of social search, a key enabler for quality social network
services, where social search queries are conducted on a large-scale social
graph and meanwhile perform set and computational operations on user-generated
contents. To enable efficient privacy-preserving social search, GraphSE
provides an encrypted structural data model to facilitate parallel and
encrypted graph data access. It is also designed to decompose complex social
search queries into atomic operations and realise them via interchangeable
protocols in a fast and scalable manner. We build GraphSE with various
queries supported in the Facebook graph search engine and implement a
full-fledged prototype. Extensive evaluations on Azure Cloud demonstrate that
GraphSE is practical for querying a social graph with a million of users.Comment: This is the full version of our AsiaCCS paper "GraphSE: An
Encrypted Graph Database for Privacy-Preserving Social Search". It includes
the security proof of the proposed scheme. If you want to cite our work,
please cite the conference version of i
Privacy-Preserving Shortest Path Computation
Navigation is one of the most popular cloud computing services. But in
virtually all cloud-based navigation systems, the client must reveal her
location and destination to the cloud service provider in order to learn the
fastest route. In this work, we present a cryptographic protocol for navigation
on city streets that provides privacy for both the client's location and the
service provider's routing data. Our key ingredient is a novel method for
compressing the next-hop routing matrices in networks such as city street maps.
Applying our compression method to the map of Los Angeles, for example, we
achieve over tenfold reduction in the representation size. In conjunction with
other cryptographic techniques, this compressed representation results in an
efficient protocol suitable for fully-private real-time navigation on city
streets. We demonstrate the practicality of our protocol by benchmarking it on
real street map data for major cities such as San Francisco and Washington,
D.C.Comment: Extended version of NDSS 2016 pape
Outsourced Analysis of Encrypted Graphs in the Cloud with Privacy Protection
Huge diagrams have unique properties for organizations and research, such as
client linkages in informal organizations and customer evaluation lattices in
social channels. They necessitate a lot of financial assets to maintain because
they are large and frequently continue to expand. Owners of large diagrams may
need to use cloud resources due to the extensive arrangement of open cloud
resources to increase capacity and computation flexibility. However, the
cloud's accountability and protection of schematics have become a significant
issue. In this study, we consider calculations for security savings for
essential graph examination practices: schematic extraterrestrial examination
for outsourcing graphs in the cloud server. We create the security-protecting
variants of the two proposed Eigen decay computations. They are using two
cryptographic algorithms: additional substance homomorphic encryption (ASHE)
strategies and some degree homomorphic encryption (SDHE) methods. Inadequate
networks also feature a distinctively confidential info adaptation convention
to allow the trade-off between secrecy and data sparseness. Both dense and
sparse structures are investigated. According to test results, calculations
with sparse encoding can drastically reduce information. SDHE-based strategies
have reduced computing time, while ASHE-based methods have reduced stockpiling
expenses
- …