Tracing and revoking scheme for dynamic privileges against pirate rebroadcast

Zhao, Xingwen; Zhang, Fangguo

doi:10.1016/j.cose.2011.11.002

Cited by 2 publications

(12 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some schemes considered the situations where users belonged to different privileges. Adelsbach et al .…”

Section: Related Workmentioning

confidence: 99%

“…However, the storage cost in previous static schemes is dependent on the number of revoked users and the number of groups, and the storage cost in previous dynamic scheme is dependent on the number of groups, the number of revoked users, and the total number of users (described in Subsection 5.2 of ). The storage cost in our framework is dependent on the number of groups only, if the ciphertext length of the employed data sharing scheme is constant, as is the encryption scheme used in . Moreover, our framework allows directed‐acyclic‐graph‐structured privileges, whereas these works allow only line‐structured privileges, that is, one group in each privilege.…”

Section: Efficiency Evaluationmentioning

confidence: 99%

“…With the use of similar skills, schemes [35,36] achieved a constant size of private keys for each user, and schemes [37,38] achieved adaptive security without random oracles. Some schemes [9,7,10] considered the situations where users belonged to different privileges. Adelsbach et al [9] presented a broadcast tree with different subtrees for different properties, which correspond to different levels of security.…”

Section: Broadcast Encryptionmentioning

confidence: 99%

“…Moreover, our framework is efficient in decrypting messages in descending groups because it needs only O(1) computation, while it may not be constant in the employed data sharing schemes. For instance, it needs O(|S|) computations in [34], where |S| is the number of users in the receiver set S. Decryption cost in [20] is in proportion to the average number of wildcards used in the access policies, and that in [24] is in proportion to the c: the ciphertext length in the scheme of [10];…”

Section: Comparisonsmentioning

confidence: 99%

“…We introduce a directed acyclic graph (DAG) structure for privileges, which is a generic structure and enables much more applications than the line‐structured schemes . With this feature, previous works will become more practical and require much less storage cost (and maybe less computation cost) to achieve dynamic privileges among the users.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Achieving dynamic privileges in secure data sharing on cloud storage

Zhao

2013

Security Comm Networks

Self Cite

View full text Add to dashboard Cite

With the rapid development of cloud computing, more and more enterprises will outsource their sensitive data for sharing in a cloud. Many data sharing and access control schemes have been submitted. However, dynamic privileges among user groups were not considered. In many circumstances, some users may have higher privileges than others, and they can decrypt more contents than those with low privileges. Moreover, the data owner may want to dynamically control the privileges in data sharing. In this paper, we present an efficient framework for data sharing system to achieve dynamic privileges, basing on chameleon hash function and one‐way function. With this framework, any data sharing and access control scheme can be turned into a dynamic privileged scheme, in which the data owner can change the group of each user dynamically and change the structure of privileges flexibly when it is needed. The proposed framework requires much less storage than previous schemes in handling dynamic privileges among the users. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

“…Some schemes considered the situations where users belonged to different privileges. Adelsbach et al .…”

Section: Related Workmentioning

confidence: 99%

Section: Efficiency Evaluationmentioning

confidence: 99%

Section: Broadcast Encryptionmentioning

confidence: 99%

Section: Comparisonsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Achieving dynamic privileges in secure data sharing on cloud storage

Zhao

2013

Security Comm Networks

Self Cite

View full text Add to dashboard Cite

show abstract

Improvement on a Multi-Channel Broadcast Encryption Scheme

Zhao

2013

AMM

View full text Add to dashboard Cite

Broadcast encryption provides a convenient method to distribute digital content to subscribers over an insecure broadcast channel so that only the qualified users can recover the data. In some broadcast encryption based systems such as pay-TV, multiple ciphertext headers (via multiple channels) are needed since the sender needs to send various contents to different groups of subscribers. Each receiver needs to store all headers in order to switch channel fluently. Recently, Phan et al. described a multi-channel broadcast encryption scheme, in which the sender encapsulates multiple ephemeral keys into one ciphertext header so that each receiver only stores one ciphertext header and still can recover various ephemeral keys for different contents. We present an improvement on their scheme, which will reduce the size of public key and the computation cost for decryption. The improved scheme can be used to construct efficient dynamically privileged broadcast encryption system.

show abstract

Tracing and revoking scheme for dynamic privileges against pirate rebroadcast

Cited by 2 publications

References 26 publications

Achieving dynamic privileges in secure data sharing on cloud storage

Achieving dynamic privileges in secure data sharing on cloud storage

Improvement on a Multi-Channel Broadcast Encryption Scheme

Contact Info

Product

Resources

About