Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security 2017
DOI: 10.1145/3052973.3052987
|View full text |Cite
|
Sign up to set email alerts
|

A Ciphertext-Policy Attribute-based Encryption Scheme With Optimized Ciphertext Size And Fast Decryption

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 42 publications
(20 citation statements)
references
References 25 publications
0
19
0
Order By: Relevance
“…In addition, the reliability of the converted ciphertext returned from the cloud server is not verified. To achieve practicability, feasibility, and verifiability in WBANs, we build a lightweight fine-grained keyword search system based on the scheme [23], which supports flexible access control and single keyword with lightweight and verifiable decryption.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…In addition, the reliability of the converted ciphertext returned from the cloud server is not verified. To achieve practicability, feasibility, and verifiability in WBANs, we build a lightweight fine-grained keyword search system based on the scheme [23], which supports flexible access control and single keyword with lightweight and verifiable decryption.…”
Section: Related Workmentioning
confidence: 99%
“…On input an attribute set of a user, the public parameter , and the system master key , this algorithm creates the secret key for the user as follows: This algorithm first picks , ∈ Z and then computes the secret key for the user as = ( 0 = ( − − )/ , 1 = , 2 = , 3 = , { = ℎ } ∈D ). Note that user just requires to keep 1 secret and the rest of other secret key could be published to the public domain [23].…”
Section: ( mentioning
confidence: 99%
“…Secret-key Public-key Signing Verifying [3] 1|G| 1|G| + 1| | 2|G| + + 3 3P + 1H [4] 1|G|+ 1| | 2| | 2|G| 2 + 2 ( + 3)exp + 2H [5] ( + 1)|G| 1|G|+ 1| | 2|G| 4 exp + 3 H 2 exp + 3P (3 + 1)H Ours 3|G|+ 1|G| 3|G|+ 1| | 3|G|+ (n + 3)|G| (2 + 9)exp + (2 + 1)H ( + 1)exp + 3P+(2 + 1)H time. Second, using direct approach [14,15], which leads to quite efficient resulted schemes (constant-size of both public parameters and signature, as well as efficient computing time); however these schemes are only secure under strong assumptions (generalization of the Diffie-Hellman exponent assumption, GDDHE assumption), although GDDHE assumption introduced by Boneh and Boyen at Eurocrypt'05 [16] now has been accepted widely by researchers [17][18][19][20][21][22]. Aggregate Signature.…”
Section: Signaturementioning
confidence: 99%
“…In [4], Li et al presented a personal health record (PHR) secure sharing scheme in cloud computing. Subsequently, various constructions of ABE schemes were presented in [9,[23][24][25][26][27][28][29].…”
Section: Introductionmentioning
confidence: 99%