2016
DOI: 10.1002/cpe.3870
|View full text |Cite
|
Sign up to set email alerts
|

Privacy‐preserving data search and sharing protocol for social networks through wireless applications

Abstract: SUMMARYData search and sharing are two important functionalities in social networks. The social network users can form a peer-to-peer group and securely and flexibly search and share cloud data through wireless applications. When the number of users increases, the communication, storage, and computational overheads will be increased, and the quality of services such as searching and data sharing for clients could be affected. In order to solve these problems, we formalize an ID-based multi-user searchable encr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 34 publications
0
3
0
Order By: Relevance
“…Recently, many efforts have been made to study privacy-preserving data publishing. [15][16][17][18] Partition-based anonymization techniques, such as k-anonymity, l-diversity, t-closeness, 10 and m-invariance, 19 are dominantly discussed in previous years. Now, differential privacy 5,20 has regarded as the de facto standard for private data publishing.…”
Section: Privacy-preserving Data Publishingmentioning
confidence: 99%
See 1 more Smart Citation
“…Recently, many efforts have been made to study privacy-preserving data publishing. [15][16][17][18] Partition-based anonymization techniques, such as k-anonymity, l-diversity, t-closeness, 10 and m-invariance, 19 are dominantly discussed in previous years. Now, differential privacy 5,20 has regarded as the de facto standard for private data publishing.…”
Section: Privacy-preserving Data Publishingmentioning
confidence: 99%
“…Recently, many efforts have been made to study privacy‐preserving data publishing 15–18 . Partition‐based anonymization techniques, such as k ‐anonymity, l ‐diversity, t ‐closeness, 10 and m ‐invariance, 19 are dominantly discussed in previous years.…”
Section: Related Workmentioning
confidence: 99%
“…Xiaofen Wang et al . propose a new privacy‐preserving data search and sharing protocol for social networks. The protocol leverages an ID‐based multi‐user searchable encryption scheme to achieve data search pattern privacy‐preserving, anonymity, and request unlinkability.…”
mentioning
confidence: 99%