Traceable comparison attribute encryption method based on multiple authorization centers
A technology of attribute encryption and authorization center, applied in the field of cryptography, can solve problems such as large computing overhead, high overhead, and single-point performance bottlenecks, so as to speed up identity verification and secret key generation, reduce burden, and avoid single-point performance bottlenecks Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0102] This embodiment provides a traceable comparison attribute encryption method based on multiple authorization centers, such as figure 1 As shown, in the following system model, five entities are mainly involved: Central Authorization Center (Central Authority, CA), Attribute Authorization Center (Attribute Authorities, AAs), user (data user, DU), data owner (data owner , DO) and cloud service provider (cloud service provider, CSP).
[0103] CA: CA is the key generation management center of the system. Generate unique identifiers and certificates for AAs and DUs. And after receiving the intermediate key from the AA to verify the DU, generate the final key for the DU. In addition to this, CAs can also track down malicious AAs that generate intermediate keys for suspicious DUs.
[0104] AA: Each AA has sufficient storage and computing power to independently verify any user. AA will verify its certificate according to the attributes submitted by DU, and generate the corre...
Embodiment 2
[0154] Such as figure 2 As shown, the structure of the access policy model in this embodiment is an access policy tree.
[0155] In the access policy of CP-ABE / KP-ABE, there are always some attributes expressed as a range value, for example: "{age>18}". Ranged values of properties like this are not comparable using Boolean functions. Because the result of comparing "{age=20}" and "{age>18}" with the Boolean function is inconsistent. Unless the range value is changed to a union, such as: "{age=19}"V"{age=20}"V...V"{age=100}". But this method will increase linearly as the data increases.
[0156] Our scheme adopts 0-encoding and 1-encoding methods for the attributes of this range of values. We assume an n-bit binary number x.
[0157] x=x 1 x 2 ...x n ∈{0,1} n
[0158] 0 encoding: convert x to a set if x i (i≤n) is equal to 0, and x i Change to 1, and then use the number of the first i digits as an element.
[0159] x x 0 ={x 1 x 2 ...x i-1 1|x i =0,1≤i≤n} ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


