2016 International Conference on Inventive Computation Technologies (ICICT) 2016
DOI: 10.1109/inventive.2016.7830099
|View full text |Cite
|
Sign up to set email alerts
|

Privacy preserving ciphertext policy attribute based encryption scheme with efficient and constant ciphertextsize

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 22 publications
0
5
0
Order By: Relevance
“…Tere has also been research on how to improve the efciency of CP-ABE schemes [17][18][19][20][21]27]. Emura et al [17] proposed a CP-ABE scheme with a constant ciphertext length to reduce the encryption and decryption time.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…Tere has also been research on how to improve the efciency of CP-ABE schemes [17][18][19][20][21]27]. Emura et al [17] proposed a CP-ABE scheme with a constant ciphertext length to reduce the encryption and decryption time.…”
Section: Related Workmentioning
confidence: 99%
“…Odelu et al [19] designed a provably secure CP-ABE scheme with constant-size keys and ciphertext based on the RSA "AND" gate access structure, which is suitable for the mobile cloud computing environment. Tamizharasi et al [20] proposed a CP-ABE scheme for privacy protection, which eliminates redundant attributes in the policy by constructing an assignable matrix, and reduces the ciphertext size to a constant that is independent of the number of attributes of the data user. Yang et al [21] proposed a completely secure CP-ABE scheme with constant-size ciphertext, whose decryption computation only requires three pairing operations and some multiplication operations, independent of the number of attributes involved.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…However, it is unable to preserve privacy in the access policy. In [31], the authors eliminated all redundant attributes in the access policy, and their approach significantly reduced computation overhead. With the same intention, the author of [32] proposed the 'testdecrypt-verify' approach to reduce the computation cost in their CP-ABE scheme.…”
Section: Related Workmentioning
confidence: 99%
“…Tamizharasi [16] has proposed a new CP-ABE scheme to improve the level of fine-grained access control properties. This scheme implements attribute access concepts and also user access concepts to solve the problem of fine-grained access control.…”
Section: Fine-grained Access Controlmentioning
confidence: 99%