CN109298938A - Insincere cloud center batch resource sharing method based on XOR operation and chaos - Google Patents
Insincere cloud center batch resource sharing method based on XOR operation and chaos Download PDFInfo
- Publication number
- CN109298938A CN109298938A CN201811104578.6A CN201811104578A CN109298938A CN 109298938 A CN109298938 A CN 109298938A CN 201811104578 A CN201811104578 A CN 201811104578A CN 109298938 A CN109298938 A CN 109298938A
- Authority
- CN
- China
- Prior art keywords
- key
- resource
- customer end
- cloud center
- encryption
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
-
- 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/001—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using chaotic signals
-
- 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/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0819—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
- H04L9/083—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s) involving central third party, e.g. key distribution center [KDC] or trusted third party [TTP]
Abstract
The present invention discloses the insincere cloud center batch resource sharing method based on XOR operation and chaos；This method customer end A encrypts resource Si with initial key k1i, and encrypted resource is then uploaded to cloud center；As customer end A one target cipher key k2 of creation, process key is calculated according to initial key and target cipher key k2；Customer end A uses asymmetric-key encryption algorithm, obtains encrypted key PBK；Process key and PBK are sent to cloud center by customer end A；The one resource-sharing list of cloud central record；Cloud center query resource shares list, the corresponding key PBK of bulk resources is sent to customer end B, after customer end B obtains PBK and encryption resource from cloud center, obtains target cipher key k2 with the private key decryption PBK of oneself, it is decrypted with target cipher key k2, the shared resource after being decrypted.Algorithm complexity is high when the present invention solves encryption resource sharing, the big problem of client's end pressure.
Description
Technical field
The present invention is a kind of encryption resource sharing method of insincere cloud, more particularly to based on XOR operation and chaos
Insincere cloud center batch resource sharing method, belongs to cloud security field.
Background technique
The code key of encryption need to be informed that, by participator, with becoming more by sharing personnel amount, code key is leaked out by resource sharing
Possibility is gone to increase, the people for being provided simultaneously with the code key has the ability of modification original text, and safety is insufficient.
Comparing reasonable way is that a unique symmetric key Key is only used to the encryption of original document, on server
Only a encryption resource.When needing to share resource, clothes are uploaded to after being encrypted with the public key of target side to document key Key
Business device, target side are decrypted after obtaining with the private key of itself, and the key of document can be obtained.Although this method ensure that cloud center without
Method obtains former resource content, but there are two risks for which.Although being first people that you believe by participator, with being divided
It enjoys people and becomes more, the risk of key Key leakage is bigger, and many times Key Exposure is not blabber wish itself, but unexpected
Cause or by hacker attack.In addition, indicating the energy for not only being had by participator and checking plaintext after initial key is shared away
Power, and have the ability of modification source material, it is only necessary to it is allowed after being encrypted with the modified plaintext of same key pair in cloud
The former encryption resource of central server covering.
In addition, if bulk resources shared, the corresponding decruption key of a resource also results in key management
Difficulty increases.
Summary of the invention
Present invention aims to overcome that problem of the existing technology, provide it is a kind of reduce key management difficulty based on
The insincere cloud center batch resource sharing method of XOR operation and chaos realizes that entire process medium cloud center of sharing can not obtain
Cleartext information, by participator without the ability of modification original text although it can check cleartext information, resource sharing is to different
People does not need client and participates in the process specifically encrypted.
The object of the invention is achieved through the following technical solutions:
Insincere cloud center batch resource sharing method based on XOR operation and chaos, comprising the following steps:
S1: setting customer end A has m resource [S1, S2, S3..., Sm] to need to share, and corresponding initial key is respectively
[k11, k12, k13..., k1m], wherein resource Si indicates the resource individually shared, i=1,2 ... m, and m is batch quantity analysis resource
Number, m >=1；
S2: customer end A calls chaos exclusive or encryption and decryption function ChaoticXorEncDec to carry out batch operation, respectively with just
Beginning, key k1i encrypted resource Si, obtained encrypted resource e1, m=ChaoticXorEncDec (Si, k1i), then
Encrypted resource [e11, e12, e13 ..., e1m] is uploaded into cloud center；
S3: when the customer end A needs encrypted bulk resources [e1, e2, e3 ..., em] being shared with customer end B
When, create a target cipher key k2, according to initial key k1i and target cipher key k2 be calculated process key [k31, k32,
k33...,k3m]；
S4: customer end A uses asymmetric-key encryption algorithm, is carried out with the public key of the customer end B to target cipher key k2
Encryption obtains encrypted key PBK；[k31, k32, k33..., k3m] and PBK are sent to cloud center by the customer end A；
S5: one resource-sharing list share_list, resource-sharing list share_list of cloud central record every row is protected
Deposited resource, client and corresponding key and process key, format be a four-tuple ([e1, e2, e3 ..., em], B, PBK,
[k31,k32,k33...,k3m])；
S6: the customer end B initiates the request of downloading bulk resources [e11, e12, e13 ..., e1m] to cloud center；
S7: cloud center responds the customer end B downloading request by following steps:
S7.1 cloud center query resource shares list share_list, by bulk resources [e11, e12, e13 ..., e1m]
Corresponding key PBK is sent to customer end B；
Chaos encryption and decryption function ChaoticXorEncDec is called at S7.2 cloud center, according to process key k3i to resource e1i
It is encrypted, obtains e2i=ChaoticXorEncDec (e1i, k3i)；
Bulk resources [e11, e12, e13 ..., e1m] are sent to the customer end B by S7.3 cloud center；k2
S8: after the customer end B obtains PBK and encryption resource [e21, e22, e23 ..., e2m] from cloud center, oneself is used
Private key decryption PBK obtain target cipher key k2, the customer end B calls chaos encryption and decryption function ChaoticXorEncDec, uses
Encryption resource [e21, e22, e23 ..., e2m] is decrypted in target cipher key k2, the shared resource S1, i=after being decrypted
ChaoticXorEncDec(e2,k2)。
To further realize the object of the invention, it is preferable that the calculating side initial key k1, target cipher key k2, process key k3
Method is as follows:
S9: random to generate three random numbers u, x, n, wherein the value range of u is 3.5699456 <u≤4, the value model of x
Enclose are as follows: 0<x<1, n be integer and n>=1；
S10: generating initial key k1, and k1 is a four-tuple (M1, u, x, n), and wherein M1 is the length generated at random
The binary bits string that degree is n, u, x, n are according to obtained by step S8；
S11: generating target cipher key k2, and k2 is a four-tuple (M2, u, x, n), and wherein M2 is the length generated at random
Degree is the binary bits string of 2n byte, and u, x, n is according to obtained by step S8；
S12: generating process key k3, k3 are a four-tuples (M3, u, x, n), and wherein M3 is that step S9, S10 is resulting
Binary bits string M1, M2 exclusive or as a result, M3=M2 ⊕ M1, u, x, n are according to obtained by step S8, ⊕ is bit exclusive or.
Preferably, steps are as follows for chaos exclusive or encryption and decryption function ChaoticXorEncDec calculating:
1) input of ChaoticXorEncDec function is Data and key, wherein Data is a numerical value array, is represented
The resource that need to be encrypted or need to decrypt, key are a four-tuples (M, u, x, n), wherein M, u, x, the value of n and the step S10,
Four-tuple described in S11, S12 corresponds；
If 2) length of data is not the integral multiple of n, to the end data filling 0, the overall length of resource after being filled
Degree is Len；
3) grouping the number of iterations t, t=Len/n are calculated；
4) x '=x is enabled；M '=M
5) grouping (D1, D2 ... Dt) that t length is n is divided resources into, following behaviour is executed to each grouping Di
Make:
6) value of x ' is updated, x ' calculation formula is x '=u*x ' (1-x ')；
7) seed by x ' as pseudorandom number generator generates a random positive integer k, wherein 0≤k < n；
8) M '=M ' < < k；Wherein: < < for bit ring shift left；
9) Di ' is calculated, wherein the calculation formula of Di ' are as follows: Di '=M ' ⊕ Di；Wherein: ⊕ is bit exclusive or；
10) return (D1 ', D2 ' ... Dt ').
Preferably, m described in step S1 is arbitrary integer in 2-5.
Compared with prior art, the invention has the advantages that and technical effect:
(1) the entire process medium cloud center of sharing of the present invention can not obtain cleartext information, by participator although can check bright
Literary information is still without the ability of modification original text.
(2) resource sharing of the present invention gives different people, does not need client and participates in the process specifically encrypted.
(3) batch mode of the present invention is only with the corresponding target cipher key of multiple encryption keys with regard to achievable multiple resources point
It enjoys, rather than stand-alone mode is simply used for multiple times and generates multiple target cipher keys, reduce key management difficulty.
(4) present invention introduces the Logistic mould of chaology when constructing encryption and decryption function ChaoticXorEncDec
Type reduces and carries out a possibility that conjecture cracks according to word frequency.
Detailed description of the invention
Fig. 1 is bulk resources sharing model flow chart of the present invention.
Specific embodiment
For a better understanding of the invention, the present invention is further illustrated with reference to the accompanying drawings and examples, but this hair
Bright way of example is unlimited so.
Embodiment
Customer end A, which passes through, shares bulk resources with customer end B using based on exclusive or Encryption Algorithm and chaology algorithm, should
Bulk resources are respectively character string " ab " and character string " cd ".
Insincere cloud center batch resource sharing method based on XOR operation and chaos, comprising the following steps:
One, customer end A encrypts bulk resources [S1,S2], and upload to cloud center
The string resource of sharing is mapped as numerical value array S by customer end A1={ 0x61,0x62 }, S2=0x63,
0x64 }, mapping method is the ascii code for taking character string, and switchs to 16 systems；
1.1: customer end A is respectively bulk resources [S1,S2] corresponding initial key is generated as [k11,k12], k11=(M=
0x8b3c, u=3.5699457, x=0.5, n=16), k12=(M=0x497f, u=3.5699457, x=0.5, n=16),
Wherein u, x, n are random number, and the value range of u is 3.5699456 <u≤4, the value range of x are as follows: 0 < x < 1, n are integer, are taken
Value range is the Bit String that n >=1, M is a position n generated at random；
1.2 customer end As call chaos encryption and decryption function ChaoticXorEncDec, are passed to initial key k11To shared resource
s1It is encrypted, obtains encryption resource e11=ChaoticXorEncDec (S1,k11), ChaoticXorEncDec function it is specific
Calculating process is as follows:
1.2.1: resource S to be encrypted1={ 0x61,0x62 }, S1Length be 16bit be n=16 integral multiple, do not have to
Carry out end filling.
1.2.2: calculating grouping the number of iterations t=16/16=1
1.2.3: enabling x '=x=0.5
1.2.4: by S1It is divided into the grouping (D1={ 0x61,0x62 }) that t=1 length is 16bit, to each grouping
DiIt proceeds as follows:
(1): updating the value of x ', x '=u*x ' * (1-x ')=0.892486425.
(2): the seed by x ' as pseudorandom number generator generates random positive integer k=12, to k11.M circulation is left
K are moved, M '=0xc8b3 is obtained.
(3): calculating D1',
1.2.5: encrypted resource e11={ D1'={ 0xa9,0xd1 }.
1.3 is similar with step (1.2), and customer end A calls chaos encryption and decryption function ChaoticXorEncDec, is passed to initial
Key k12To resource S2It is encrypted, obtains encryption resource e12=ChaoticXorEncDec (S2,k12)={ 0x97,0xf3 }:
1.4 customer end As are by encrypted resource [e11,e12] upload to cloud center；
Two, customer end A shares encrypted bulk resources [e11,e12] give customer end B
2.1 wish when customer end A by bulk resources [e11,e12] when being shared with customer end B, create a target cipher key k2:
k2=(M=0x3765, u=3.5699457, x=0.5, n=16), wherein M is the bit of 16 bit generated at random
String, u, x, n value range is as step 1.1；
2.2 customer end As are encryption resource e11 generating process key k31, k31=(M=0xbc59, u=3.5699457, x
=0.5, n=16), wherein
2.3 are same as above, and customer end A is encryption resource e12Generating process key k32, k32=(M=0x7e1a, u=
3.5699457 x=0.5, n=16), wherein
2.3: customer end A uses asymmetric-key encryption algorithm, with the public key of customer end B to target cipher key k2It is encrypted
Obtain PBK.
2.4: customer end A is by process key [k31,k32] and encryption target cipher key PBK be sent to cloud center；
2.5: registering a four-tuple { ([e in resource-sharing list share_list in cloud center11,e12],B,PBK,[k31,
k32]) record；
Three, customer end B applies for downloading batch shared resource [e to cloud center11,e12]；
3.1: cloud center receives customer end B downloading batch shared resource [e11,e12] request after, according to application download
Customer end B and batch shared resource [e11,e12] the shared list share_list of query resource, obtain batch shared resource
[e11,e12] corresponding encrypted target cipher key PBK and [k31,k32]。
3.2: encrypted target cipher key PBK is sent to customer end B by cloud center；
3.3: chaos encryption and decryption function ChaoticXorEncDec is called at cloud center, is passed to k31And e11It is encrypted, specifically
Process is as follows:
3.3.1: resource e to be encrypted11={ 0xa9,0xd1 }, e11Length be 16bit be n=16 integral multiple, no
With carrying out end filling.
3.3.2: calculating grouping the number of iterations t=16/16=1
3.3.3: enabling x '=x=0.5
3.3.4: by e11It is divided into the grouping (D that t=1 length is 16bit1={ 0xa9,0xd1 }), to each grouping
DiIt proceeds as follows:
(1): updating the value of x ', x '=u*x ' * (1-x ')=0.892486425.
(2): the seed by x ' as pseudorandom number generator generates random positive integer k=12, to k31.M circulation is left
K are moved, M '=0x9bc5 is obtained；
(3): calculating D1',
3.3.5: encrypted resource e21={ D1'={ 0x32,0x14 }.
3.4 is similar with step (3.3), and customer end A calls chaos encryption and decryption function ChaoticXorEncDec, is passed to initial
Key k32To resource e12It is encrypted, obtains encryption resource e22=ChaoticXorEncDec (e12,k32)={ 0x30,
0x12 }:
3.5: cloud center is by encrypted batch shared resource [e21,e22] it is sent to B
Four, customer end B target cipher key k2Decrypt the encryption bulk resources [e of downloading21,e22], obtain shared resource [S1,
S2]。
4.1: customer end B obtains PBK and encryption resource [e from cloud center21,e22] after, it is obtained with the private key decryption PBK of oneself
To target cipher key k2；
4.2: client call chaos encryption and decryption function ChaoticXorEncDec, it is passed to k2And e21It is decrypted, specifically
Process is as follows:
4.2.1: resource e to be encrypted21={ 0x32,0x14 }, e21Length be 16bit be n=16 integral multiple, no
With carrying out end filling.
4.2.2: calculating grouping the number of iterations t=16/16=1
4.2.3: enabling x '=x=0.5
4.2.4: by e21It is divided into the grouping (D1={ 0x32,0x14 }) that t=1 length is 16bit, to each grouping
DiIt proceeds as follows:
(1): updating the value of x ', x '=u*x ' * (1-x ')=0.892486425.
(2): the seed by x ' as pseudorandom number generator generates random positive integer k=12, to k21.M circulation is left
K are moved, M '=0x5376 is obtained；
(3): calculating D1',
4.2.5: the resource S after decryption1={ D1'={ 0x61,0x62 }.
4.3 is similar with step (4.2), and customer end A calls chaos encryption and decryption function ChaoticXorEncDec, is passed to initial
Key k2To resource e22It is encrypted, obtains encryption resource S2=ChaoticXorEncDec (e22,k2)={ 0x63,0x64 }:
4.4 customer end Bs are by the batch shared resource [S after decryption11,S12]=[{ 0x61,0x62 }, { 0x63,0x64 }] weight
New mappings are character string, and numerical value is mapped as ascii code, thus shared resource " ab " and " cd " after being decrypted.
Cleartext information can not be obtained by the entire process medium cloud center of sharing of the visible present invention of embodiment, although it can by participator
To check cleartext information but without the ability of modification original text.
Resource sharing of the present invention gives different people, does not need client and participates in the process specifically encrypted.
Batch mode of the present invention only corresponds to a target cipher key with regard to achievable multiple resource sharings with multiple encryption keys, and
It is not that stand-alone mode is simply used for multiple times to generate multiple target cipher keys, reduces key management difficulty.
The present invention introduces the Logistic model of chaology when constructing encryption and decryption function ChaoticXorEncDec,
It reduces and a possibility that conjecture cracks is carried out according to word frequency.
Industry technical staff is it should be appreciated that the present invention should not be limited by the examples.It is all in the spirit and principles in the present invention
Within any modification for being made, equivalent replacement and improve etc., should all be included in the protection scope of the present invention.
Claims (4)
1. the insincere cloud center batch resource sharing method based on XOR operation and chaos, it is characterised in that including following step
It is rapid:
S1: setting customer end A has m resource [S1, S2, S3..., Sm] to need to share, corresponding initial key be respectively [k11,
K12, k13..., k1m], wherein resource Si indicates the resource individually shared, i=1,2 ... m, and m is of batch quantity analysis resource
Number, m >=1；
S2: customer end A calls chaos exclusive or encryption and decryption function ChaoticXorEncDec to carry out batch operation, respectively with initial close
Key k1i encrypts resource Si, obtains encrypted resource e1, m=ChaoticXorEncDec (Si, k1i), then will add
Resource [e11, e12, e13 ..., e1m] after close uploads to cloud center；
S3: when the customer end A needs encrypted bulk resources [e1, e2, e3 ..., em] being shared with customer end B, wound
Build a target cipher key k2, according to initial key k1i and target cipher key k2 be calculated process key [k31, k32, k33...,
k3m]；
S4: customer end A uses asymmetric-key encryption algorithm, is encrypted with the public key of the customer end B to target cipher key k2
Obtain encrypted key PBK；[k31, k32, k33..., k3m] and PBK are sent to cloud center by the customer end A；
S5: one every row of resource-sharing list share_list, resource-sharing list share_list of cloud central record saves
Resource, client and corresponding key and process key, format be four-tuple ([e1, e2, e3 ..., em], B, PBK,
[k31,k32,k33...,k3m])；
S6: the customer end B initiates the request of downloading bulk resources [e11, e12, e13 ..., e1m] to cloud center；
S7: cloud center responds the customer end B downloading request by following steps:
S7.1 cloud center query resource shares list share_list, and bulk resources [e11, e12, e13 ..., e1m] is corresponding
Key PBK be sent to customer end B；
Chaos encryption and decryption function ChaoticXorEncDec is called at S7.2 cloud center, is carried out according to process key k3i to resource e1i
Encryption, obtains e2i=ChaoticXorEncDec (e1i, k3i)；
Bulk resources [e11, e12, e13 ..., e1m] are sent to the customer end B by S7.3 cloud center；k2
S8: after the customer end B obtains PBK and encryption resource [e21, e22, e23 ..., e2m] from cloud center, with the private of oneself
Key decryption PBK obtains target cipher key k2, and the customer end B calls chaos encryption and decryption function ChaoticXorEncDec, uses target
Encryption resource [e21, e22, e23 ..., e2m] is decrypted in key k2, the shared resource S1, i=after being decrypted
ChaoticXorEncDec(e2,k2)。
2. the insincere cloud center batch resource sharing method based on XOR operation and chaos as described in claim 1, special
Sign is: initial key k1, target cipher key k2, and process key k3 calculation method is as follows:
S9: random to generate three random numbers u, x, n, wherein the value range of u is 3.5699456 <u≤4, the value range of x
Are as follows: 0<x<1, n be integer and n>=1；
S10: initial key k1 is generated, k1 is a four-tuple (M1, u, x, n), and it is n that wherein M1, which is the length generated at random,
The binary bits string of position, u, x, n are according to obtained by step S8；
S11: target cipher key k2 is generated, k2 is a four-tuple (M2, u, x, n), and wherein M2 is that the length generated at random is
The binary bits string of 2n byte, u, x, n are according to obtained by step S8；
S12: generating process key k3, k3 are a four-tuples (M3, u, x, n), wherein M3 be step S9, S10 resulting two into
Bit String M1 processed, M2 exclusive or as a result, M3=M2 ⊕ M1, u, x, n are according to obtained by step S8, ⊕ is bit exclusive or.
3. the insincere cloud center batch resource sharing method based on XOR operation and chaos as described in claim 1, special
Sign is that steps are as follows for the chaos exclusive or encryption and decryption function ChaoticXorEncDec calculating:
1) input of ChaoticXorEncDec function is Data and key, wherein Data is a numerical value array, and representative need to add
Resource that is close or need to decrypting, key are a four-tuples (M, u, x, n), wherein M, u, x, the value of n and step S10, the S11,
Four-tuple described in S12 corresponds；
If 2) length of data is not the integral multiple of n, to the end data filling 0, the total length of resource is after being filled
Len；
3) grouping the number of iterations t, t=Len/n are calculated；
4) x '=x is enabled；M '=M
5) grouping (D1, D2 ... Dt) that t length is n is divided resources into, each grouping Di is performed the following operations:
6) value of x ' is updated, x ' calculation formula is x '=u*x ' (1-x ')；
7) seed by x ' as pseudorandom number generator generates a random positive integer k, wherein 0≤k < n；
8) M '=M ' < < k；Wherein: < < for bit ring shift left；
9) Di ' is calculated, wherein the calculation formula of Di ' are as follows: Di '=M ' ⊕ Di；Wherein: ⊕ is bit exclusive or；
10) return (D1 ', D2 ' ... Dt ').
4. the insincere cloud center batch resource sharing method based on XOR operation and chaos as described in claim 1, special
Sign is that m described in step S1 is arbitrary integer in 2-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811104578.6A CN109298938A (en) | 2018-09-21 | 2018-09-21 | Insincere cloud center batch resource sharing method based on XOR operation and chaos |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811104578.6A CN109298938A (en) | 2018-09-21 | 2018-09-21 | Insincere cloud center batch resource sharing method based on XOR operation and chaos |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109298938A true CN109298938A (en) | 2019-02-01 |
Family
ID=65163994
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811104578.6A Pending CN109298938A (en) | 2018-09-21 | 2018-09-21 | Insincere cloud center batch resource sharing method based on XOR operation and chaos |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109298938A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9432346B2 (en) * | 2011-07-02 | 2016-08-30 | David H. MADDEN | Protocol for controlling access to encryption keys |
| CN103427979B (en) * | 2013-06-09 | 2016-12-28 | 浙江工业大学 | A kind of Internet picture transparent safety transmission method based on chaos encryption |
| CN106408495A (en) * | 2015-11-06 | 2017-02-15 | 河南师范大学 | High PSNR fragile watermarking method based on chaos theory |
| CN107040363A (en) * | 2017-02-23 | 2017-08-11 | 广东工业大学 | Lightweight RFID ownership transfer method and system based on chaos encryption |
| CN107508667A (en) * | 2017-07-10 | 2017-12-22 | 中国人民解放军信息工程大学 | Ciphertext policy ABE base encryption method and its device of the fix duty without key escrow can be disclosed |
| CN108282327A (en) * | 2017-01-06 | 2018-07-13 | 重庆邮电大学 | A kind of OPC UA secret key exchange methods based on chaos rsa encryption |
-
2018
- 2018-09-21 CN CN201811104578.6A patent/CN109298938A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9432346B2 (en) * | 2011-07-02 | 2016-08-30 | David H. MADDEN | Protocol for controlling access to encryption keys |
| CN103427979B (en) * | 2013-06-09 | 2016-12-28 | 浙江工业大学 | A kind of Internet picture transparent safety transmission method based on chaos encryption |
| CN106408495A (en) * | 2015-11-06 | 2017-02-15 | 河南师范大学 | High PSNR fragile watermarking method based on chaos theory |
| CN108282327A (en) * | 2017-01-06 | 2018-07-13 | 重庆邮电大学 | A kind of OPC UA secret key exchange methods based on chaos rsa encryption |
| CN107040363A (en) * | 2017-02-23 | 2017-08-11 | 广东工业大学 | Lightweight RFID ownership transfer method and system based on chaos encryption |
| CN107508667A (en) * | 2017-07-10 | 2017-12-22 | 中国人民解放军信息工程大学 | Ciphertext policy ABE base encryption method and its device of the fix duty without key escrow can be disclosed |
Non-Patent Citations (1)
| Title |
|---|
| LAM I ,ET AL.,: "Tresorium: Cryptographic File System for Dynamic Groups over Untrusted Cloud Storage", 《INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING WORKSHOPS. IEEE COMPUTER SOCIETY, 2012》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111130757B (en) | Multi-cloud CP-ABE access control method based on block chain | |
| Noura et al. | DistLog: A distributed logging scheme for IoT forensics | |
| Thirumalai et al. | Secured E-mail system using base 128 encoding scheme | |
| US10733317B2 (en) | Searchable encryption processing system | |
| CN106131049A (en) | A kind of method of data transmission encryption and decryption | |
| Liu et al. | Same initial states attack in Yang et al.’s quantum private comparison protocol and the improvement | |
| CN110505062A (en) | A kind of Dynamic Oval curve cryptographic methods applied to alliance's chain | |
| Hussam | New lightweight hybrid encryption algorithm for cloud computing (LMGHA-128bit) by using new 5-D hyperchaos system | |
| CN102222188A (en) | Information system user password generation method | |
| CN103607273A (en) | Data file encryption and decryption method based on time limit control | |
| CN102223229A (en) | Method for safe transmission of data in public network | |
| CN109298938A (en) | Insincere cloud center batch resource sharing method based on XOR operation and chaos | |
| Qi et al. | Secure data deduplication with dynamic access control for mobile cloud storage | |
| JP2022094333A (en) | Computer implementation method of extended key wrapping, computer program product and system (key block extended wrapping) including computer readable storage medium with program instruction | |
| CN114510734A (en) | Data access control method, device and computer readable storage medium | |
| CN113326530A (en) | Key negotiation method suitable for sharing keys of two communication parties | |
| Saxena et al. | A new way to enhance efficiency & security by using symmetric cryptography | |
| Liu et al. | A parallel encryption algorithm for dual-core processor based on chaotic map | |
| Zhao et al. | Design of Improved DES Algorithm Based on Double Plaintext | |
| Tirmizi et al. | Developing an API for Block-Cipher Encryption powered by Supervised Learning | |
| Gao et al. | New image encryption algorithm based on hyperchaotic 3D-IHAL and a hybrid cryptosystem | |
| Parkar et al. | Performance level evaluation of cryptographic algorithms | |
| CN109104270A (en) | A kind of insincere cloud center resources sharing method based on Hill operation and chaos | |
| Wang et al. | Attack to an image encryption based on chaotic Logistic map | |
| Mandal et al. | Secure cryptographic algorithm using digital logic |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190201 |
|
| WD01 | Invention patent application deemed withdrawn after publication |