The Secure Link Prediction Problem

@article{Sardar2019TheSL,
  title={The Secure Link Prediction Problem},
  author={Laltu Sardar and Sushmita Ruj},
  journal={IACR Cryptol. ePrint Arch.},
  year={2019},
  volume={2019},
  pages={87}
}
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… Expand
3 Citations
Securely Computing Clustering Coefficient for Outsourced Dynamic Encrypted Graph Data
TLDR
A novel graph encryption technique that allows calculating clustering coefficient on the outsourced encrypted graph and supports edge and neighborhood queries and it is shown that the designed scheme is secure under chosen-query attack. Expand
FSPVDsse: A Forward Secure Publicly Verifiable Dynamic SSE Scheme
TLDR
This paper has proposed a generic publicly verifiable dynamic SSE (DSSE) scheme that makes any forward private DSSE scheme verifiable without losing forward privacy and does not require any extra storage at owner-side and requires minimal computational cost as well for the owner. Expand
A Secure Fog-Based Architecture for Industrial Internet of Things and Industry 4.0
TLDR
A secure fog-based IIoT architecture is proposed by suitably plugging a number of security features into it and by offloading some of the tasks judiciously to fog nodes, respectively, to secure the system alongside reducing the trust and burden on the cloud and resource-constrained devices. Expand

References

SHOWING 1-10 OF 24 REFERENCES
Privacy-Preserving Link Prediction in Decentralized Online Social Networks
TLDR
This work considers the privacy-preserving link prediction problem in decentralized online social network (OSNs) as a sparse logistic regression problem and solves it with a novel decentralized two-tier method using alternating direction method of multipliers (ADMM). Expand
Wherefore Art Thou R 3579 X ? Anonymized Social Networks , Hidden Patterns , and Structural
Large-scale social networks have emerged as a major part of our world in the last two decades. With it has come research interest into the structure of these graphs. However, one barrier to researchExpand
Graph Encryption for Top-K Nearest Keyword Search Queries on Cloud
TLDR
This paper specially investigate graph encryption method for an important graph query type, called top-k Nearest Keyword (kNK) searches, and design several indexes to store necessary information for answering queries and guarantee that private information about the graph such as vertex identifiers, keywords and edges are encrypted or excluded. Expand
SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates
TLDR
In the era of big data, graph databases have become increasingly important for NoSQL technologies, and many systems can be modeled as graphs for semantic queries, and the ability to query over the encrypted graphs is retained. Expand
The link-prediction problem for social networks
TLDR
Experiments on large coauthorship networks suggest that information about future interactions can be extracted from network topology alone, and that fairly subtle measures for detecting node proximity can outperform more direct measures. Expand
GRECS: Graph Encryption for Approximate Shortest Distance Queries
TLDR
GRECS (stands for GRaph EnCryption for approximate Shortest distance queries) is proposed which includes three oracle encryption schemes that are provably secure against any semi-honest server and is both computationally-efficient and achieves optimal communication complexity at the cost of a small amount of additional leakage. Expand
Cloud-Based Approximate Constrained Shortest Distance Queries Over Encrypted Graphs With Privacy Protection
TLDR
Connor is a novel graph encryption scheme that enables approximate CSD querying over encrypted graphs and is built based on an efficient, tree-based ciphertext comparison protocol, and makes use of symmetric-key primitives and the somewhat homomorphic encryption, making it computationally efficient. Expand
GraphSC: Parallel Secure Computation Made Easy
TLDR
This work builds Graph SC, a framework that provides a programming paradigm that allows non-cryptography experts to write secure code, brings parallelism to such secure implementations, and meets the need for obliviousness, thereby not leaking any private information. Expand
Structured Encryption and Controlled Disclosure
TLDR
The notion of structured encryption is introduced which generalizes previous work on symmetric searchable encryption (SSE) to the setting of arbitrarily-structured data. Expand
Practical techniques for searches on encrypted data
TLDR
This work describes the cryptographic schemes for the problem of searching on encrypted data and provides proofs of security for the resulting crypto systems, and presents simple, fast, and practical algorithms that are practical to use today. Expand
...
1
2
3
...