CN106549758B - Support the encryption method based on attribute of non-monotonic access structure - Google Patents
Support the encryption method based on attribute of non-monotonic access structure Download PDFInfo
- Publication number
- CN106549758B CN106549758B CN201611130086.5A CN201611130086A CN106549758B CN 106549758 B CN106549758 B CN 106549758B CN 201611130086 A CN201611130086 A CN 201611130086A CN 106549758 B CN106549758 B CN 106549758B
- Authority
- CN
- China
- Prior art keywords
- attribute
- node
- access structure
- leaf
- structure tree
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
- H04L9/3066—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy involving algebraic varieties, e.g. elliptic or hyper-elliptic curves
- H04L9/3073—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy involving algebraic varieties, e.g. elliptic or hyper-elliptic curves involving pairings, e.g. identity based encryption [IBE], bilinear mappings or bilinear pairings, e.g. Weil or Tate pairing
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Physics (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Physics & Mathematics (AREA)
- Pure & Applied Mathematics (AREA)
- Algebra (AREA)
- Computing Systems (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Storage Device Security (AREA)
Abstract
The invention discloses a kind of encryption methods based on attribute for supporting non-monotonic access structure, including initialize, generate private key for user, encryption and decryption.The encryption method based on attribute provided by the invention for supporting non-monotonic access structure all encodes the attribute in need for carrying out inverse of institute in access strategy, formation encoded attributes.It is all the attribute of inverse occur in non-monotonic access structure tree, all substituted with encoded attributes.In the private key subitem of user, not only there is the corresponding private key subitem of logical attribute, there are also the key subitems of encoded attributes.When private key distributes, generation is different from the private key subitem of logical attribute, and the private key subitem of encoded attributes needs dynamic generation according to decryption in decryption phase.The present invention provides the encryption method based on attribute, supports non-monotonic access structure, and will not reduce the safety of Encryption Algorithm.
Description
Technical field
The present invention relates to file ciphering technology fields, and in particular to it is a kind of support non-monotonic access structure based on attribute
Encryption method.
Background technique
Due to the advantage with primary encryption, more people sharing, as a kind of Cryptograph Sharing algorithm, the encryption based on attribute
(CP-ABE, Cipher Policy Attribute Based Encryption) algorithm receives significant attention.However, existing can
The CP-ABE algorithm of implementation nearly all only supports dull access structure.Only only a few supports the side of non-monotonic access structure
Case, since excessively complexity often only can not application implementation with theory significance.It can not support non-monotonic access structure, it is meant that
Access strategy or access logical expression can not support NOT logic operation.And in many practical applications, NOT logic operation is must
Indispensable.Non-monotonic access structure is not supported, seriously limits the application range of scheme.
Summary of the invention
To be solved by this invention is the problem of existing Encryption Algorithm based on attribute does not support non-monotonic access structure.
The present invention is achieved through the following technical solutions:
A kind of encryption method based on attribute for supporting non-monotonic access structure, comprising:
Initialization: setting security parameter d；Authorized organization selects a rank for the Bilinear Groups G of Big prime p0And G1, remember G0
Generation member be g, corresponding bilinear map be e:G0×G0→G1；Logical attribute collection needed for definition system is combined into A={ a1,
a2,…,an, the corresponding encoded attributes collection of logical attribute set A needed for system is combined intoDefine a hash function H:{ 0,1 }*→G0；
Random selectionWherein,For the collection constituted in the residue class set of Big prime p with Big prime p coprime element
It closes；By system public key informationIt is sent to cloud service
Device and openly, data owner's secret save main private key MK={ gα,β1,β2}；
Generate private key for user: user U is given in definitioniThe logical attribute collection of distribution is combined intoCorresponding encoded attributes set
ForRandom selectionFor each element aj∈ w, random selectionGenerate private key
Encryption: data owner constructs the access that all leaf nodes all represent logical attribute according to access logical expression
Structure tree T'；It transform access structure tree T' as access structure tree T that leaf node represents logical attribute or encoded attributes；To visit
Ask each leaf node assignment of structure tree TWherein, LT'Indicate the set of the leaf node of access structure tree T'；It generates
The shared cryptograph of plaintext M is Wherein, att () is used to ask the corresponding attribute of leaf node, NOTTFor institute in access structure tree T
The set for thering is non-attribute corresponding node to constitute, Ql(0) polynomial constant term, Q are corresponded to for leaf node lxIt (0) is leaf node x
Corresponding polynomial constant term；
Decryption:
For logical attribute leaf node x,
For encoded attributes leaf node x,
For NOT node x,Its
In, z is the child nodes of NOT node x, wherein Qz(0)=Qx(0)；
The non-leaf nodes x for being AND for operator,
Wherein, i=index (z), s'x={ index (z): z ∈ sx}
Wherein, sxFor operator be AND non-leaf nodes x child nodes set,
Index (z) is seniority among brothers and sisters serial number of the leaf node z in the brotgher of node, and parent (z) is the father node of leaf node z, Qx(0)
Polynomial constant term is corresponded to for non-leaf nodes x；
Ciphertext data M is as follows:
Optionally, data owner constructs the visit that all leaf nodes all represent logical attribute according to access logical expression
Ask that structure tree T' includes:
In access structure tree T', each leaf node represents an attribute in attribute set, threshold value 1；
In access structure tree T', each non-leaf nodes plays thresholding.
Optionally, it transform access structure tree T' as access structure tree that leaf node represents logical attribute or encoded attributes
T includes:
Scan the leaf node of access structure tree T', it is determined whether there are non-attributes；
If corresponding leaf node is non-attribute, leaf node encoded attributes node is substituted.
Optionally, the coding mode of encoded attributes node are as follows: the corresponding attribute value of attribute of the entitled B of attribute can arrange and number
For n, 2k-1≤n≤2k, k is positive integer, successively carries out coding using all values of the k bit to B and forms coding category
Property, encoded attributes are respectively designated as B from low level to a high position1、B2、…、Bk。
It optionally, is each leaf node assignment of access structure tree TInclude:
The non-leaf nodes x for being AND for each operator in access structure tree T randomly chooses a polynomial of one indeterminate function
Qx(x)；
Random selectionEnabling the corresponding privacy sharing number of the root node of access structure tree T is Qr(0)=s；
For arbitrary node y and his father's node operator is AND, Qy(0)=Qparent(y)(index (y)), wherein
Index (y) is seniority among brothers and sisters serial number of the arbitrary node y in the brotgher of node；
For arbitrary node y and his father's node operator is OR, Qy(0)=Qparent(y)(0)。
Compared with prior art, the present invention having the following advantages and benefits:
The encryption method based on attribute provided by the invention for supporting non-monotonic access structure, can be arranged denumerable using attribute value
The characteristics of attribute value is encoded, formed encoded attributes, logic-based attribute and encoded attributes are encrypted.This method is to visit
Ask in strategy the attribute (referred to as non-attribute) in need for carrying out inverse all encoded, form encoded attributes.In non-list
It visits and investigate and asks in structure tree, it is all the attribute of inverse occur, all substituted with encoded attributes.In the private key subitem of user
In, not only there is the corresponding private key subitem of logical attribute, there are also the key subitems of encoded attributes.Exist with the private key subitem of logical attribute
Difference is generated when private key distributes, the private key subitem of encoded attributes needs dynamic generation according to decryption in decryption phase.The present invention
Encryption method based on attribute is provided, supports non-monotonic access structure, and the safety of Encryption Algorithm will not be reduced.
Detailed description of the invention
Attached drawing described herein is used to provide to further understand the embodiment of the present invention, constitutes one of the application
Point, do not constitute the restriction to the embodiment of the present invention.In the accompanying drawings:
Fig. 1 is the structural schematic diagram of logic-based attribute access structure tree；
Fig. 2 is the structural schematic diagram of logic-based attribute and encoded attributes access structure tree.
Specific embodiment
To make the objectives, technical solutions, and advantages of the present invention clearer, below with reference to embodiment and attached drawing, to this
Invention is described in further detail, and exemplary embodiment of the invention and its explanation for explaining only the invention, are not made
For limitation of the invention.
Embodiment
In using Encryption Algorithm based on attribute of the access structure tree table up to access strategy, Cryptograph Sharing is by will be secret
It is realized in close number sharing to the leaf node of tree.It is worth noting that, each leaf node has and only and represents a category
Property value.If representing in the access logical expression of access strategy and the non-of some attribute occur, hereinafter referred to as non-attribute, that
There will be the non-attribute leaf node for representing multiple attribute values in the access structure tree formed by the expression formula.The node
It can not be matched with any single attribute, therefore corresponding ciphertext subitem can not be formed.Solving the problems, such as that this direct thinking is should
Attribute value use become the attribute value it is non-all other attribute value substitution, the relationship of these attribute values be all logic or.However, belonging to
The more value of property makes this method and infeasible, and in the case where attribute has 1000 values, the non-of any attribute value is all needed
It is substituted with 999 attribute values.Because attribute value is more, it is meant that the memory space of access structure tree and ciphertext needs is got over
Greatly, it is longer to encrypt and decrypt the time spent.For this problem, inventor consider with to attribute value carry out binary coding with
Reduce the quantity of non-attribute value.
If the corresponding attribute value of attribute of the entitled B of attribute can arrange and number is n, if 2k-1≤n≤2k, it is possible to
Coding is successively carried out with all values of the k bit to B and forms encoded attributes, and encoded attributes are ordered respectively from low level to a high position
Entitled B1、B2、…、Bk, k is positive integer.For example, there are 15 classes in a grade, because of 24-1≤15≤24, so representing the category of class
The encoded attributes name of property class is respectively class1, class2, class3 and class4.The corresponding volume of attribute class=11
Code attribute is respectively as follows: class1=1, class2=1, class3=0 and class4=1, is abbreviated as class=
Class4class3class2class1=1011.
After the above coding method, the non-of attribute is asked just to become simple.If attribute B=Bk…B2B1, then,Due to BiThe value of (1≤i≤k) is 0 or 1, often
A non-attribute！BiLeaf node all corresponds to an attribute value, can calculate corresponding ciphertext subitem.Attribute class=11's is non-
That is class ≠ 11, corresponding encoded attributes are as follows: class=！class4∪！class3∪！class2∪！Class1=1011.
The structural schematic diagram of logic-based attribute access structure tree is as shown in Figure 1, be changed into logic-based attribute and encoded attributes access
The structural schematic diagram of structure tree is as shown in Figure 2.Obviously, when attribute value reaches as many as 1000, any non-attribute all only not
Cross corresponding 10 encoded attributes values and 10 corresponding leaf nodes.
Based on above-mentioned analysis, the present invention will constitute the essential attribute of composite attribute in private key for user generation and cryptogram computation
It is bound, proposes a kind of encryption method based on attribute for supporting multivalue distribution and combinations of attributes, including initialize, generate use
Four family private key, encryption and decryption steps.
Initialization: setting security parameter d；Authorized organization selects a rank for the Bilinear Groups G of Big prime p0And G1, remember G0
Generation member be g, corresponding bilinear map be e:G0×G0→G1；Logical attribute collection needed for definition system is combined into A={ a1,
a2,…,an, the corresponding encoded attributes collection of logical attribute set A needed for system is combined intoDefine a hash function H:{ 0,1 }*→G0；
Random selectionWherein,For the collection constituted in the residue class set of Big prime p with Big prime p coprime element
It closes；By system public key informationIt is sent to cloud service
Device and openly, data owner's secret save main private key MK={ gα,β1,β2}.；
Generate private key for user: user U is given in definitioniThe logical attribute collection of distribution is combined intoCorresponding encoded attributes set
ForRandom selectionFor each element aj∈ w, random selectionGenerate private key
Encryption: data owner constructs the access that all leaf nodes all represent logical attribute according to access logical expression
Structure tree T'；It transform access structure tree T' as access structure tree T that leaf node represents logical attribute or encoded attributes；To visit
Ask each leaf node assignment of structure tree TWherein, LT'Indicate the set of the leaf node of access structure tree T'；It generates
The shared cryptograph of plaintext M is Wherein, att () is used to ask the corresponding attribute of leaf node, NOTTFor institute in access structure tree T
The set for thering is non-attribute corresponding node to constitute, Ql(0) polynomial constant term, Q are corresponded to for leaf node lxIt (0) is leaf node x
Corresponding polynomial constant term.
Specifically, for convenience of privacy sharing is carried out, access logical expression is indicated with access structure tree T'.It is tied in access
In paper mulberry T', each leaf node represents an attribute in attribute space, threshold value 1, and each non-leaf nodes rises
Thresholding effect.If using num respectivelyxAnd kxThe child's number and threshold value for indicating non-leaf nodes x, then must have 0 < kx≤
numx.When the thresholding of non-leaf nodes is prescribed a time limit for AND gate, threshold value kx=numx；When the thresholding of non-leaf nodes is OR,
Threshold value kx=1.
Scan the leaf node of access structure tree T', it is determined whether there are non-attributes.It is if certain leaf node is corresponding
Non- attribute substitutes the corresponding encoded attributes node of the leaf node.
If the root node of access structure tree T is r, TxIndicate that root node is the subtree of x, it is clear that have: T=Tr.If property setMeet access control tree Tx, it is denoted as Tx(γ)=1.Calculating can be carried out by following mode recurrence: as x is
Non-leaf nodes calculates T for all child nodes x' of the non-leaf nodesx'(γ), and if only if at least kxThe T of a childx'
When (γ) return value is all 1, Tx(γ)=1；If x is leaf node, when the attribute of leaf node x belongs to γ, Tx
(γ)=1.
For each leaf node assignment of access structure tree TIt is according to carrying out from top to bottom.It specifically, is access knot
The non-leaf nodes x that each operator is AND in paper mulberry T randomly chooses a polynomial of one indeterminate function Qx(x).Random selectionEnabling the corresponding privacy sharing number of the root node of access structure tree T is Qr(0)=s.For arbitrary node y and its father node
Operator is AND, Qy(0)=Qparent(y)(index (y)), wherein index (y) is row of the arbitrary node y in the brotgher of node
Row serial number (is numbered) by sequence from left to right；For arbitrary node y and his father's node operator is OR, Qy(0)=
Qparent(y)(0)。
Decryption:
For logical attribute leaf node x, aj=att (x),
For encoded attributes leaf node x,If UkMeet the coding of access structure tree T
Attribute (if there is multiple encoded attributes meet a non-attribute, only taking one of them) collection is combined into S', UkBy private key subitem
It is sent to authorized organization's request temporary private subitem and mapping number.Authorized organization's random selectionFor each element aj∈
S', random selectionGenerate following temporary private subitem:Mapping number of authorized organization's calculation code attribute to logical attribute:
Then temporary private subitem and mapping number are sent back into Uk, UkAccording to same logical attribute leaf node decipherment algorithm one
The algorithm of sample decrypts encoded attributes leaf node.For encoded attributes leaf node x, decrypted result are as follows:
For NOT node x,Its
In, z is the child nodes of NOT node x, wherein Qz(0)=Qx(0)；
The non-leaf nodes x for being AND for operator,
Wherein, i=index (z), s'x={ index (z): z ∈ sx}
Wherein, sxFor operator be AND non-leaf nodes x child nodes set,
Index (z) is seniority among brothers and sisters serial number of the leaf node z in the brotgher of node, and parent (z) is the father node of leaf node z, Qx(0)
Polynomial constant term is corresponded to for non-leaf nodes x；
Ciphertext data M is as follows:
Above-described specific embodiment has carried out further the purpose of the present invention, technical scheme and beneficial effects
It is described in detail, it should be understood that being not intended to limit the present invention the foregoing is merely a specific embodiment of the invention
Protection scope, all within the spirits and principles of the present invention, any modification, equivalent substitution, improvement and etc. done should all include
Within protection scope of the present invention.
Claims (2)
1. a kind of encryption method based on attribute for supporting non-monotonic access structure characterized by comprising
Initialization: setting security parameter d；Authorized organization selects a rank for the Bilinear Groups G of Big prime p0And G1, remember G0Life
Cheng Yuanwei g, corresponding bilinear map are e:G0×G0→G1；Logical attribute collection needed for definition system is combined into A={ a1,
a2,…,an, the corresponding encoded attributes collection of logical attribute set A needed for system is combined intoDefine a hash function H:{ 0,1 }*→G0；
α is randomly choosed,Wherein,For the collection constituted in the residue class set of Big prime p with Big prime p coprime element
It closes；By system public key informationIt is sent to cloud service
Device and openly, data owner's secret save main private key MK={ gα,β1,β2}；
Generate private key for user: user U is given in definitioniThe logical attribute collection of distribution is combined intoCorresponding encoded attributes collection is combined intoRandom selectionFor each element aj∈ w, random selectionGenerate private key
Encryption: data owner constructs the access structure that all leaf nodes all represent logical attribute according to access logical expression
Set T'；It transform access structure tree T' as access structure tree T that leaf node represents logical attribute or encoded attributes；For access knot
The each leaf node assignment of paper mulberry TWherein, LT'Indicate the set of the leaf node of access structure tree T'；Generate plaintext M
Shared cryptograph be Wherein, att () is used to ask the corresponding attribute of leaf node, NOTTFor institute in access structure tree T
The set for thering is non-attribute corresponding node to constitute, Ql(0) polynomial constant term, Q are corresponded to for leaf node lxIt (0) is leaf node x
Corresponding polynomial constant term；
Decryption:
For logical attribute leaf node x,
For encoded attributes leaf node x,
For NOT node x,Wherein, z
For the child nodes of NOT node x, wherein Qz(0)=Qx(0)；
The non-leaf nodes x for being AND for operator,
Wherein, i=index (z), s'x={ index (z): z ∈ sx}
Wherein, sxFor operator be AND non-leaf nodes x child nodes set,The seniority among brothers and sisters serial number for being leaf node z in the brotgher of node, parent (z) are leaf
The father node of node z, Qx(0) polynomial constant term is corresponded to for non-leaf nodes x；
Ciphertext data M is as follows:
Data owner constructs the access structure tree T' that all leaf nodes all represent logical attribute according to access logical expression
Include:
In access structure tree T', each leaf node represents an attribute in attribute set, threshold value 1；
In access structure tree T', each non-leaf nodes plays thresholding；
It transform access structure tree T' as leaf node and represents the access structure tree T of logical attribute or encoded attributes and include:
Scan the leaf node of access structure tree T', it is determined whether there are non-attributes；
If corresponding leaf node is non-attribute, leaf node encoded attributes node is substituted；
The coding mode of encoded attributes node are as follows: the corresponding attribute value of attribute of the entitled B of attribute can arrange and number be n, 2k-1≤n
≤2k, k is positive integer, successively carries out coding using all values of the k bit to B and forms encoded attributes, encoded attributes
B is respectively designated as from low level to a high position1、B2、…、Bk。
2. the encryption method based on attribute according to claim 1 for supporting non-monotonic access structure, which is characterized in that be
The each leaf node assignment of access structure tree TInclude:
The non-leaf nodes x for being AND for each operator in access structure tree T randomly chooses a polynomial of one indeterminate function Qx
(x)；
Random selectionEnabling the corresponding privacy sharing number of the root node of access structure tree T is Qr(0)=s；
For arbitrary node y and his father's node operator is AND, Qy(0)=Qparent(y)(index (y)), wherein index (y)
The seniority among brothers and sisters serial number for being arbitrary node y in the brotgher of node；
For arbitrary node y and his father's node operator is OR, Qy(0)=Qparent(y)(0)。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611130086.5A CN106549758B (en) | 2016-12-09 | 2016-12-09 | Support the encryption method based on attribute of non-monotonic access structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611130086.5A CN106549758B (en) | 2016-12-09 | 2016-12-09 | Support the encryption method based on attribute of non-monotonic access structure |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106549758A CN106549758A (en) | 2017-03-29 |
| CN106549758B true CN106549758B (en) | 2019-07-30 |
Family
ID=58397226
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611130086.5A Active CN106549758B (en) | 2016-12-09 | 2016-12-09 | Support the encryption method based on attribute of non-monotonic access structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106549758B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11316662B2 (en) * | 2018-07-30 | 2022-04-26 | Koninklijke Philips N.V. | Method and apparatus for policy hiding on ciphertext-policy attribute-based encryption |
| CN113489591B (en) * | 2021-06-04 | 2023-09-12 | 杭州师范大学 | Traceable comparison attribute encryption method based on multiple authorization centers |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20140033573A (en) * | 2012-09-03 | 2014-03-19 | 경희대학교 산학협력단 | Data delegation method for public cloud storage service and data access method for the delegated data |
| KR20140062745A (en) * | 2012-11-15 | 2014-05-26 | 고려대학교 산학협력단 | System of attribute-based encryption and method thereof |
| CN105897709A (en) * | 2016-04-01 | 2016-08-24 | 西安电子科技大学 | User attribute encryption and decryption method of non-monotonic access structure in distributed network |
| CN105978895A (en) * | 2016-06-28 | 2016-09-28 | 电子科技大学 | Attribute-based encryption scheme supporting non-monotonic access structure and fine-granularity cancellation |
| CN105991278A (en) * | 2016-07-11 | 2016-10-05 | 河北省科学院应用数学研究所 | Ciphertext access control method based on CP-ABE (Ciphertext-Policy Attribute-Based Encryption) |
| CN106131139A (en) * | 2016-06-23 | 2016-11-16 | 暨南大学 | The encryption of the floating data of a kind of cloud relational database and querying method |
-
2016
- 2016-12-09 CN CN201611130086.5A patent/CN106549758B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20140033573A (en) * | 2012-09-03 | 2014-03-19 | 경희대학교 산학협력단 | Data delegation method for public cloud storage service and data access method for the delegated data |
| KR20140062745A (en) * | 2012-11-15 | 2014-05-26 | 고려대학교 산학협력단 | System of attribute-based encryption and method thereof |
| CN105897709A (en) * | 2016-04-01 | 2016-08-24 | 西安电子科技大学 | User attribute encryption and decryption method of non-monotonic access structure in distributed network |
| CN106131139A (en) * | 2016-06-23 | 2016-11-16 | 暨南大学 | The encryption of the floating data of a kind of cloud relational database and querying method |
| CN105978895A (en) * | 2016-06-28 | 2016-09-28 | 电子科技大学 | Attribute-based encryption scheme supporting non-monotonic access structure and fine-granularity cancellation |
| CN105991278A (en) * | 2016-07-11 | 2016-10-05 | 河北省科学院应用数学研究所 | Ciphertext access control method based on CP-ABE (Ciphertext-Policy Attribute-Based Encryption) |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106549758A (en) | 2017-03-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106127075B (en) | Encryption method can search for based on secret protection under a kind of cloud storage environment | |
| CN104363215B (en) | A kind of encryption method and system based on attribute | |
| CN105100083B (en) | A kind of secret protection and support user's revocation based on encryption attribute method and system | |
| CN106375346B (en) | Data guard method based on condition broadcast agent re-encryption under a kind of cloud environment | |
| CN103701833B (en) | A kind of ciphertext access control method and system based on cloud computing platform | |
| CN109981641A (en) | A kind of safe distribution subscription system and distribution subscription method based on block chain technology | |
| CN105071937B (en) | Ciphertext policy ABE base encryption method with the revocation of efficient attribute | |
| CN106506155B (en) | Cryptograph Sharing method under publicly-owned cloud environment | |
| Zaghloul et al. | P-MOD: Secure privilege-based multilevel organizational data-sharing in cloud computing | |
| CN111143471B (en) | Ciphertext retrieval method based on blockchain | |
| CN107070660A (en) | A kind of design Storage method of block chain encrypted radio-frequency chip | |
| CN103986574A (en) | Hierarchical identity-based broadcast encryption method | |
| CN105635135B (en) | A kind of encryption system and access control method based on property set and relationship predicate | |
| Swathy et al. | Providing advanced security mechanism for scalable data sharing in cloud storage | |
| JP2016526851A (en) | System for sharing encryption keys | |
| CN110390203B (en) | Strategy hidden attribute-based encryption method capable of verifying decryption authority | |
| CN104135473A (en) | A method for realizing identity-based broadcast encryption by ciphertext-policy attribute-based encryption | |
| CN106161428A (en) | A kind of ciphertext can the encryption attribute scheme of comparison of equalization | |
| CN110086615A (en) | A kind of more authorized party's ciphertext policy ABE base encryption methods of distribution that medium is obscured | |
| Hao et al. | Efficient attribute-based access control with authorized search in cloud storage | |
| CN104993929B (en) | A kind of attribute-based encryption system that system property is supported to extend and method | |
| CN106549758B (en) | Support the encryption method based on attribute of non-monotonic access structure | |
| CN106209354A (en) | A kind of support attribute hide can verify that attribute base encrypt outsourcing scheme | |
| CN105790929A (en) | High-efficient access control method based on rule redundancy elimination in encryption environment | |
| CN107360252A (en) | A kind of Data Access Security method that isomery cloud domain authorizes |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |