Loading article...
Loading article...
Stream/Area:
-
Subject:
-
Paper ID:
10.55041/IJSREM20421
Volume:
7 |
5 |
May 2023
Pages:
Publication Frequency:
Monthly (12 issues per year)
License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.
Social networks have led to the emergence of numerous social applications for instant group communication and formation, and subgraph matching has become a popular research area in social networks. However, due to the high cost of managing and computing graph data, it may be necessary to outsource the computations to a cloud server. The main challenge is that the cloud server may leak the graph information during processing, and external attackers may modify the graph information during transmission on a public channel. Therefore, confidentiality and authentication are crucial attributes in the subgraph matching query service. In this article, we propose an efficient and privacy-preserving subgraph matching scheme that provides authentication in social networks. Our scheme allows the cloud to perform the subgraph matching query process without obtaining any sensitive information about the users. Furthermore, we achieve data integrity verification and user authentication, allowing each receiver to verify if the received messages come from the legitimate sender and have not been tampered with. Our security and efficiency analysis demonstrate that our scheme meets security requirements and achieves high efficiency in local users, making it suitable for practical applications.
KEYWORDS
Publication Date
6/4/2023
Peer Review Type
Double-Blind Peer Review
Review Rounds: 2
Documents
Article Views
0
Total views since publication
PDF Downloads
1
Total downloads since publication
Geographic Reach
5
Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.
Plagiarism Screening
This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.
Conflict of Interest
The authors declare no conflict of interest related to this research work.
Funding Information
No funding information available for this research.
Related research in the same subject area
Loading similar articles...