A Time-Based Group Key Management Algorithm Based on Proxy Re-encryption for Cloud Storage

Cui, Yihui; Peng, Zhiyong; Song, Wei; Li, Xiaojuan; Cheng, Fangquan; Ding, Luxiao

doi:10.1007/978-3-319-11116-2_11

Cited by 4 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the data owner has to transform the plaintext into ciphertext, and vice versa that involves execution of computationally intensive multiplication and exponential operations of large numbers on resouce constraion mobile device. [27][28][29][30][31] propose proxy re-encryption algorithm to confirm the security of the data in the cloud, which can alleviate the client's burden, and enhance the confidentiality of cloud data. However, there are two major disadvantages with these techniques.…”

Section: Related Workmentioning

confidence: 99%

Searchable Re-encryption Cloud Storage Method Based on Markov Chain

Wang

Sheng

Jinguang³

2018

International Journal of Advanced Network, Monitoring and Controls

View full text Add to dashboard Cite

Cloud storage is an emerging paradigm that offers on-demand, flexible, and elastic computational and storage services for the terminal users. When the large amount of data increases dramatically, the storage efficiency of the system would be decreased seriously. In this paper a new method of SReCSM(Searchable Re-encryption Cloud Storage Method) based on Markov chain is proposed. It predicts periodically by using the steady Markov strategy in stages and easy to select the optimal storage node. The data is scheduled to store in the node with the lowest cost in real time, and the node is selected to implement cloud storage access on mobile terminal. By using searchable re-encryption method, SReCSM has increased the storage requirement flexibility and minimize cost and searching time. And then the reliability model of SReCSM is established. Simulation results show that SReCSM introduced in this paper has the ability to predict accurately when the size of the data is different. Moreover, the influence of storage efficiency is reduced effectively through SReCSM when different size of the data is stored in storage nodes regardless of the storage cost. It is verified that the SReCSM based on Markov chain has higher reliability.

show abstract

Section: Related Workmentioning

confidence: 99%

Searchable Re-encryption Cloud Storage Method Based on Markov Chain

Wang

Sheng

Jinguang³

2018

International Journal of Advanced Network, Monitoring and Controls

View full text Add to dashboard Cite

show abstract

“…Among different constructions of proxy re‐encryption, ElGamal‐based construction provides the features of collusion resistance, bidirectional, noninteractive, proxy‐invisibility, nontransitive, nontransferable, 8 9 . Following this, Cui et al 10 introduced a time‐based GKM scheme relying on proxy re‐encryption tailored for cloud storage systems. They claimed that in contrast to schemes based on Tree‐based Group Diffie–Hellman and public–private key pairs, the group key distribution and recovery costs in their scheme remain constant despite the increase in the number of users.…”

Section: Introductionmentioning

confidence: 99%

EPREKM: ElGamal proxy re‐encryption‐based key management scheme with constant rekeying cost and linear public bulletin size

Sharma,

B. R.

2024

Concurrency and Computation

View full text Add to dashboard Cite

SummaryA vast body of literature is filled with many key management schemes constructed using different cryptographic primitives. They aim toward either security goals or improvement in performance efficiency. However, the key management schemes based on proxy re‐encryption suffer from massive communication and computational costs. We propose an ElGamal proxy re‐encryption‐based construction for the key management scheme to resolve this. The proposed scheme involves constant computational and communication costs in rekeying operations and linear public bulletin size. We achieve essential security requirements of forward and backward secrecy in this scheme. The scheme is also secure against the collusion attack. In addition, we address the importance of adequately managing missed rekeying updates for offline users. The existing schemes trivially keep track of each rekeying message on the public bulletin board, which increases the size of the public bulletin with every join/leave operation. However, the proposed scheme uses the public bulletin board so that the handling of offline users is built into the scheme itself, which manages it efficiently. Also, the public bulletin size in the proposed scheme is not dependent on the number of rekeying operations but linear in the number of users.

show abstract

Secure Group Key Sharing Protocols and Cloud System

Thakare

Singh

2018

Encyclopedia of Information Science and Technology, Fourth Edition

View full text Add to dashboard Cite

Cloud Computing has been envisioned as the next-generation architecture of IT Enterprise. Secure and reliable communications have become critical in modern computing. The centralized services like e-mail and file sharing can be changed into distributed or collaborated system through multiple systems and networks. Basic cryptographic requirements such as data confidentiality, data integrity, authentication and access control are required to build secure collaborative system in the broadcast channel. For several groupware applications like voice & video conferences, distributed computation over the insecure network, developing an efficient group key agreement protocol for secure communication is required in internet. According to the recent rule released by Health and Human Services (HHS), healthcare data can be outsourced to cloud computing services for medical studies. The aim of this study is to provide the details about secure group data sharing protocols available and how it will be applicable in healthcare cloud applications to share data securely over healthcare cloud.

show abstract

A Time-Based Group Key Management Algorithm Based on Proxy Re-encryption for Cloud Storage

Cited by 4 publications

References 11 publications

Searchable Re-encryption Cloud Storage Method Based on Markov Chain

Searchable Re-encryption Cloud Storage Method Based on Markov Chain

EPREKM: ElGamal proxy re‐encryption‐based key management scheme with constant rekeying cost and linear public bulletin size

Secure Group Key Sharing Protocols and Cloud System

Contact Info

Product

Resources

About