Ciphertext Policy Attribute-Based Proxy Re-encryption

Luo, Song; Hu, Jianbin; Zhong, Chen

doi:10.1007/978-3-642-17650-0_28

Cited by 91 publications

(67 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proxy re-encryption(PRE) technique encrypts the ciphertexts with re-encryption keys and makes it possible for users to decrypt the re-encrypted ciphertexts with their own original decryption keys without changing. In [30], Luo et al realize proxy re-encryption in CP-ABE scheme, with AND-gates that support multi-value attributes, negative attributes, and wildcards, the encryptor could choose any ciphertext to re-encrypt as they like. Lai et al formalize a new cryptographic primitive called adaptable ciphertext-policy attribute-based encryption, which allows a semi-trusted proxy to modify a ciphertext under one access policy into another one of the same plaintext under any other access policies [31].…”

Section: Related Workmentioning

confidence: 99%

An efficient traceable access control scheme with reliable key delegation in mobile cloud computing

Guan

Zhang

et al. 2016

J Wireless Com Network

View full text Add to dashboard Cite

With the increasing number of mobile applications and the popularity of cloud computing, the combination of these two techniques that named mobile cloud computing (MCC) attracts great attention in recent years. However, due to the risks associated with security and privacy, mobility security protection in MCC has become an important issue. In this paper, we propose an efficient traceable access control scheme with reliable key delegation named KD-TABE in MCC. Firstly, we present a traceable CP-ABE system and realize key delegation without loss of traceability. Secondly, a new type of re-encryption method is proposed, which is based on an intuitive method that supports any monotonic access tree instead of the re-encryption key. Lastly, to reduce trust on authority, we separate the authority into three parts, and each authority is responsible for generating different components of the key. The analysis shows that the proposed scheme can meet the security requirement of MCC. In addition, it cost less compared with the other popular models.

show abstract

Section: Related Workmentioning

confidence: 99%

An efficient traceable access control scheme with reliable key delegation in mobile cloud computing

Guan

Zhang

et al. 2016

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…In this paper we also show that the IND-sAS-CCA-Or security implies selective collusion resistance. Note that in [22] selective collusion resistance is also called as selective master key security.…”

Section: Our Contributionsmentioning

confidence: 99%

“…Mizuno and Doi [24] proposed a hybrid PRE scheme (in general) where the scheme can bridge ABE and IBE in the sense that ciphertexts generated in the context of ABE can be converted to the ones which can be decrypted in the IBE setting. Luo et al [22] proposed a CP-ABPRE scheme which supports AND gates on multivalued and negative attributes. The aforementioned CP-ABPRE schemes, however, are only secure against CPA and supports AND gates over attributes.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A Ciphertext-Policy Attribute-Based Proxy Re-encryption with Chosen-Ciphertext Security

Liang

Fang

Susilo

et al. 2013

2013 5th International Conference on Intelligent Networking and Collaborative Systems

111

View full text Add to dashboard Cite

Abstract. Ciphertext-Policy Attribute-Based Proxy Re-Encryption (CP-ABPRE) extends the traditional Proxy Re-Encryption (PRE) by allowing a semi-trusted proxy to transform a ciphertext under an access policy to the one with the same plaintext under another access policy (i.e.attribute-based re-encryption). The proxy, however, learns nothing about the underlying plaintext. CP-ABPRE has many real world applications, such as fine-grained access control in cloud storage systems and medical records sharing among different hospitals. Previous CP-ABPRE schemes leave how to be secure against chosen-ciphertext attacks (CCA) as an open problem. This paper, for the first time, proposes a new CP-ABPRE to tackle the problem. The new scheme supports attribute-based re-encryption with any monotonic access structures. Despite our scheme is constructed in the random oracle model, it can be proved CCA secure under the decisional q-parallel bilinear Diffie-Hellman exponent assumption.

show abstract

“…Generally speaking, an ABPRE scheme has an authority, a sender, a user called a delegator who needs to delegate his/her decryption ability to someone else, a proxy who helps the delegator to generate a reencrypted ciphertext, and some receivers as participants. Recently, due to their widespread use in the realistic scenes, widespread attention was paid to ABPRE schemes by researchers and some excellent ABPRE schemes have been proposed [6][7][8][9][10][11][12].…”

Section: Introductionmentioning

confidence: 99%

Efficient and Adaptively Secure Attribute-Based Proxy Reencryption Scheme

Pang

2016

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Ciphertext-Policy Attribute-Based Proxy Reencryption (CP-ABPRE) has found many practical applications in the real world, because it extends the traditional Proxy Reencryption (PRE) and allows a semitrusted proxy to transform a ciphertext under an access policy to the one with the same plaintext under another access policy. The existing CP-ABPRE schemes were proven secure only in the selective security model, a limited model, which is an unnatural constraint on the attacker. The scheme proved in this model can only be called selectively secure one. However, from a security perspective, the adaptively secure CP-ABPRE scheme is more desirable. In this paper, an adaptively secure CP-ABPRE scheme is proposed, which is based on Waters' dual system encryption technology. The proposed scheme is constructed in composite order bilinear groups and proven secure under the complexity assumptions of the subgroup decision problem for 3 primes (3P-SDP). Analyses show that our proposal provides higher computational efficiency compared with the existing schemes.

show abstract

Ciphertext Policy Attribute-Based Proxy Re-encryption

Cited by 91 publications

References 19 publications

An efficient traceable access control scheme with reliable key delegation in mobile cloud computing

An efficient traceable access control scheme with reliable key delegation in mobile cloud computing

A Ciphertext-Policy Attribute-Based Proxy Re-encryption with Chosen-Ciphertext Security

Efficient and Adaptively Secure Attribute-Based Proxy Reencryption Scheme

Contact Info

Product

Resources

About