Zhongma Zhu

dblp:173/0475 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Authentication and access control · 67% Cryptographic protocols and secure computation · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Authentication and access control
access control
0.212016
A Secure Anti-Collusion Data Sharing Scheme for Dynamic Groups in the Cloud · IEEE Trans. Parallel Distributed Syst. 2016
Authentication and access control › access control
fine-grained access control
0.212016
A Secure Anti-Collusion Data Sharing Scheme for Dynamic Groups in the Cloud · IEEE Trans. Parallel Distributed Syst. 2016
Cryptographic protocols and secure computation
secure data sharing
0.212016
A Secure Anti-Collusion Data Sharing Scheme for Dynamic Groups in the Cloud · IEEE Trans. Parallel Distributed Syst. 2016
Cloud and datacenter computing
cloud storage
0.112016
A Secure Anti-Collusion Data Sharing Scheme for Dynamic Groups in the Cloud · IEEE Trans. Parallel Distributed Syst. 2016

Methods — techniques the papers use, named apart from their topics

user revocation · 0.5polynomial function · 0.5collusion resistance · 0.5
YearPublicationVenuePosition
2016 A Secure Anti-Collusion Data Sharing Scheme for Dynamic Groups in the Cloud
abstract
Benefited from cloud computing, users can achieve an effective and economical approach for data sharing among group members in the cloud with the characters of low maintenance and little management cost. Meanwhile, we must provide security guarantees for the sharing data files since they are outsourced. Unfortunately, because of the frequent change of the membership, sharing data while providing privacy-preserving is still a challenging issue, especially for an untrusted cloud due to the collusion attack. Moreover, for existing schemes, the security of key distribution is based on the secure communication channel, however, to have such channel is a strong assumption and is difficult for practice. In this paper, we propose a secure data sharing scheme for dynamic members. First, we propose a secure way for key distribution without any secure communication channels, and the users can securely obtain their private keys from group manager. Second, our scheme can achieve fine-grained access control, any user in the group can use the source in the cloud and revoked users cannot access the cloud again after they are revoked. Third, we can protect the scheme from collusion attack, which means that revoked users cannot get the original data file even if they conspire with the untrusted cloud. In our approach, by leveraging polynomial function, we can achieve a secure user revocation scheme. Finally, our scheme can achieve fine efficiency, which means previous users need not to update their private keys for the situation either a new user joins in the group or a user is revoked from the group.
Zhongma Zhu
IEEE Trans. Parallel Distributed Syst.1