CN107484161A - A kind of efficient information push based on mobile self-grouping network and safe sharing method - Google Patents
A kind of efficient information push based on mobile self-grouping network and safe sharing method Download PDFInfo
- Publication number
- CN107484161A CN107484161A CN201710606319.2A CN201710606319A CN107484161A CN 107484161 A CN107484161 A CN 107484161A CN 201710606319 A CN201710606319 A CN 201710606319A CN 107484161 A CN107484161 A CN 107484161A
- Authority
- CN
- China
- Prior art keywords
- information
- user
- key
- snapshot
- publisher
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/02—Protecting privacy or anonymity, e.g. protecting personally identifiable information [PII]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources
-
- 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/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/08—Access security
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of efficient information push based on mobile self-grouping network and safe share system and method, solve the problems, such as that information sharing lacks security, actual effect and access control in existing mobile self-grouping network.System includes insincere third party Internet Service Provider, key generation centre, agent side, information publisher, shares user.Key generation centre generates the decrypted private key and public key of user, is sent to agent side, information publisher by network, shares user；Agent side pushes messages to the user of access rights；Information publisher formulates access control policy, and information is compressed, produces snapshot and encryption；Share user snapshot, information are decrypted and decompressed, obtain prime information.The present invention is based on attribute encryption technology, the shared information in mobile self-grouping network can be compressed, encrypted and efficiently be pushed, and ensures high efficiency, security, the confidentiality of Information Sharing in mobile social networking, realizes effective access control.
Description
Technical field
The present invention relates to a kind of field of information security technology, more particularly, to one kind based on attribute encryption technology, fine granularity
The efficient cryptographic of information is with sharing in the mobile self-grouping network of access control.
Background technology
Nowadays, mobile ad hoc networks turn into the important component that we produce, lived, Internet of Things, mobile Internet
Network etc. revolutionizes the information interchange mode between object.These mobile self-grouping networks provide various between node
Interaction mechanism, thus caused security risk also have been to be concerned by more and more people.One of major issue is how
The privacy of nodal information issue is protected, ensures the access control of information, prevents information leakage, even if the service provider of network
Its content can not be obtained.
In the prior art, Randy Baden et al. were published in 2009《ACMSIGCOMM
ComputerCommunication Review》Paper《Persona:an online social network with
user-defined privacy》Middle support public-key encryption and the encryption based on attribute；Amin Tootoonchian et al.
It was published in 2009《Proceedings of the 5th International Conference onEmerging
Networking Experiments and Technologies》Paper《Lockr:betterprivacy for social
networks》In, content is separated with function, this causes user may decide that wherein to store their information.These
Scheme focuses on the fine access control of data, but do not account under mobile network how at the same ensure the efficient push of message.
The content of the invention
The present invention mainly solves mobile self-grouping network in the prior art, and the data sharing between user lacks safety
Property, the problem of access control is not realized effectively, there is provided a kind of shifting based on attribute encryption technology and fine-granularity access control
The encryption of data and sharing method in dynamic ad-hoc network.
The above-mentioned technical problem of the present invention is mainly what is be addressed by following technical proposals：
1. a kind of efficient information push based on mobile self-grouping network and safe sharing method, it is characterised in that：Including such as
Lower five parts：Insincere third party Internet Service Provider, key generation centre, agent side, information publisher, share user；
Wherein,
Key generation centre：For generating the mechanism of public key and private key；
Agent side：It is quick to judge to share whether user possesses access rights, and push messages to access rights
Share user；
Information publisher：Access control policy is formulated according to demand, and information is compressed, produces snapshot and encryption, and
Ciphertext is uploaded to insincere third party Internet Service Provider；
Share user：Snapshot, information are decrypted and decompressed, obtains information original text.
2. a kind of efficient information push based on mobile self-grouping network and safe sharing method, using in claim 1
System, it is characterized in that comprising the following steps：
S1. system is initialized, and generates public key PK and master key MK；
S2. key generation centre generates the decrypted private key SK and transition key TK of the user according to the attribute of user；
S3. information publisher is handled using the Lossless Compression of self-adapting dictionary shared picture, video, audio-frequency information m,
Information PS after being compressed, and a snapshot Snapshot is preserved, information publisher is using AES symmetric encipherment algorithms to compression
Information PS afterwards is encrypted, and the access structure of set information, and AES key and snapshot Snapshot are carried out with access structure
Encryption, is uploaded to insincere third party Internet Service Provider；
S4. never trusted third party Internet Service Provider downloads ciphertext to agent side, judges the access rights for sharing user
Whether meet the access control policy of ciphertext, snapshot Snapshot is pushed to if meeting and shares user；
S5. when sharing user click snapshot Snapshot, then information is decrypted, decompressed, obtain prime information.
3. a kind of efficient information push based on mobile self-grouping network according to claim 2 and the safety side of sharing
Method, it is characterized in that initialization procedure includes in the step S1：
S11. key generation centre operation bilinearity parameter generators produce the Bilinear Groups G that two ranks are prime number p1And GT,
Wherein e:G1×G1→GTFor Bilinear Pairing computing；
S12. from group G1Middle random selection | U | individual element obtains generating first h1,…,hU；
S13. random number α is selected1,α2,So that α=(α1+α2) mod p,For p-1 factorial method prime number groups；
S14. system public key PK and master key MK are obtained,
PK=(g, e (g, g)α,ga,h1,…,hU),
MK=gα
Wherein e (g, g)αThe alpha index computing of Bilinear Pairing is represented, g group is G1Generation member, gaRefer to generate first g α
Number computing.
4. a kind of efficient information push based on mobile self-grouping network according to claim 2 and the safety side of sharing
Method, it is characterized in that private key for user SK and transition key TK process is generated in the step S2 to be included：
S21. in user's registration, key generation centre is that the user distributes globally unique ID；
S22. key generation centre selects random number t according to master key MK, the attribute set S of user and the ID of user
∈Zp, generate the private key of user：
S23. the conversion private key TK of key generation centre generation user：Transition key is transmitted to agent side；
5. a kind of efficient information push based on mobile self-grouping network according to claim 2 and the safety side of sharing
Method, information publisher are given out information m, and message is compressed, the information PS after compression, snapshot Snapshot are encrypted,
And the process for being uploaded to insincere third party Internet Service Provider includes：
S31. information publisher randomly generates AES key SecKey；
S32. the information PS after compression is encrypted information publisher using AES key SecKey, obtains information ciphertext
CT1, while produce snapshot Snapshot；
S33. information publisher defines the access control policy (M, ρ) of message, and wherein M is the linear privacy sharing of l rows n row
Matrix, for all i=1,2 ... l every a line, matrix M the i-th row is identified as ρ (i) function, ρ be one from
1 ..., and l } it is mapped to the function of participant set；
S34. random vector is selectedFor matrix M every a line, from i=1 to i=
L, calculateWherein MiHomography M the i-th row vector, s be information publisher shared information, y2,…,ynFor
ZpThe random number of middle selection,For ZpN random number of middle selection；
S35. information publisher selects random number r according to public key PK, access control policy (M, ρ)1…rl∈Zp, to AES
Key SecKey and snapshot Snapshop encrypt to obtain ciphertext CT, with m ' represent AES key SecKey and snapshot
Snapshop,
S36. CT1, CT are uploaded to insincere third party Internet Service Provider by information publisher together.
6. a kind of efficient information push based on mobile self-grouping network according to claim 2 and the safety side of sharing
Method, it is characterized in that agent side judges the access rights for sharing user, carrying out the process of message push includes：
S41. never trusted third party's ad-hoc network service provider gets the ciphertext CT of user, agent side root to agent side
According to the transition key of user, judge to share whether user has permission to access the information by solving following equation to CT,
∑i∈IMiwi=(1,0 ..., 0)
Wherein, MiRepresenting matrix M the i-th row vector, { wi∈Zp}i∈IFor constant.If there is one group of solution { wi∈Zp}i∈I,
Then represent that this shares user's permission to access, then push messages to and share user.
7. a kind of efficient information push based on mobile self-grouping network according to claim 2 and the safety side of sharing
Method, it is characterized in that share user in step S7 includes to the process that information is decrypted：
S51. share user and ciphertext CT1, CT is never downloaded at trusted third party Internet Service Provider；
S52. share user and utilize the private key SK of oneself, ciphertext CT is calculated as below,
Wherein L is the t exponent arithmetics for generating first g, Kρ(i)For the generation member h corresponding to the attribute of function ρ (i) mappingsρ(i)'s
T exponent arithmetics.
To e (g, g)αsIt further can be calculated m '：M '=C/e (g, g)αs, including AES key SecKey and fast
According to Snapshot；
S53. share user information CT1 is decrypted using AES key SecKey, the message PS after being compressed；
S54. share user to decompress the message after compression using self-adapting dictionary compress mode, obtain former letter
Breath.
Therefore, the present invention devises a method for being applied to mobile self-grouping network Information Sharing, and the program can be point
Enjoy information and carry out efficiently push and the safe flexible access control shared, carried out for user to its sharing information.Present invention tool
It is easily achieved, privacy of user protectiveness is strong, the advantages that authority flexible control information.
Brief description of the drawings
Accompanying drawing 1 is a kind of structural frames diagram of the present invention.
Embodiment
1. a kind of efficient information push based on mobile self-grouping network and safe sharing method, it is characterised in that：Including such as
Lower five parts：Insincere third party Internet Service Provider, key generation centre, agent side, information publisher, share user；
Wherein,
Key generation centre：For generating the mechanism of public key and private key；
Agent side：It is quick to judge to share whether user possesses access rights, and push messages to access rights
Share user；
Information publisher：Access control policy is formulated according to demand, and information is compressed, produces snapshot and encryption, and
Ciphertext is uploaded to insincere third party Internet Service Provider；
Share user：Snapshot, information are decrypted and decompressed, obtains information original text.
2. a kind of efficient information push based on mobile self-grouping network and safe sharing method, using in claim 1
System, it is characterized in that comprising the following steps：
S1. system is initialized, and generates public key PK and master key MK；
S2. key generation centre generates the decrypted private key SK and transition key TK of the user according to the attribute of user；
S3. information publisher is handled using the Lossless Compression of self-adapting dictionary shared picture, video, audio-frequency information m,
Information PS after being compressed, and a snapshot Snapshot is preserved, information publisher is using AES symmetric encipherment algorithms to compression
Information PS afterwards is encrypted, and the access structure of set information, and AES key and snapshot Snapshot are carried out with access structure
Encryption, is uploaded to insincere third party Internet Service Provider；
S4. never trusted third party Internet Service Provider downloads ciphertext to agent side, judges the access rights for sharing user
Whether meet the access control policy of ciphertext, snapshot Snapshot is pushed to if meeting and shares user；
S5. when sharing user click snapshot Snapshot, then information is decrypted, decompressed, obtain prime information.
3. a kind of efficient information push based on mobile self-grouping network according to claim 2 and the safety side of sharing
Method, it is characterized in that initialization procedure includes in the step S1：
S11. key generation centre operation bilinearity parameter generators produce the Bilinear Groups G that two ranks are prime number p1And GT,
Wherein e:G1×G1→GTFor Bilinear Pairing computing；
S12. from group G1Middle random selection | U | individual element obtains generating first h1,…,hU；
S13. random number α is selected1,α2,So that α=(α1+α2) mod p,For p-1 factorial method prime number groups；
S14. system public key PK and master key MK are obtained,
PK=(g, e (g, g)α,ga,h1,…,hU),
MK=gα
Wherein e (g, g)αThe alpha index computing of Bilinear Pairing is represented, g group is G1Generation member, gaRefer to generate first g α
Number computing.
4. a kind of efficient information push based on mobile self-grouping network according to claim 2 and the safety side of sharing
Method, it is characterized in that private key for user SK and transition key TK process is generated in the step S2 to be included：
S21. in user's registration, key generation centre is that the user distributes globally unique ID；
S22. key generation centre selects random number t according to master key MK, the attribute set S of user and the ID of user
∈Zp, generate the private key of user：
S23. the conversion private key TK of key generation centre generation user：Transition key is transmitted to agent side；Assuming that
Three users A, B, C, ID A, B, C, its private key and transition key are respectively SKA、TKA, SKB、TKB, SKC、TKC；
5. a kind of efficient information push based on mobile self-grouping network according to claim 2 and the safety side of sharing
Method, information publisher A are given out information m, and message is compressed, the information PS after compression, snapshot Snapshot are encrypted,
And the process for being uploaded to insincere third party Internet Service Provider includes：
S31. information publisher randomly generates AES key SecKey；
S32. the information PS after compression is encrypted information publisher using AES key SecKey, obtains information ciphertext
CT1, while produce snapshot Snapshot；
S33. information publisher A defines the access control policy (M, ρ) of message, includes B attribute, and wherein M is l rows n row
Linear privacy sharing matrix, for all i=1,2 ... l every a line, matrix M the i-th row is identified as ρ (i) function,
ρ is one and is mapped to the function of participant set from { 1 ..., l }；
S34. random vector is selectedFor matrix M every a line, from i=1 to i=
L, calculateWherein MiHomography M the i-th row vector, s be information publisher shared information, y2,…,ynFor
ZpThe random number of middle selection,For ZpN random number of middle selection；
S35. information publisher A selects random number r according to public key PK, access control policy (M, ρ)1…rl∈Zp, to AES
Key SecKey and snapshot Snapshop encrypt to obtain ciphertext CT, with m ' represent AES key SecKey and snapshot
Snapshop,
S36. CT1, CT are uploaded to insincere third party Internet Service Provider by information publisher together.
6. a kind of efficient information push based on mobile self-grouping network according to claim 2 and the safety side of sharing
Method, it is characterized in that agent side judges the access rights for sharing user, carrying out the process of message push includes：
S41. never trusted third party Internet Service Provider gets the ciphertext CT of user to agent side, agent side according to
The transition key at family, judge to share whether user has permission to access the information by solving following equation to CT,
∑i∈IMiwi=(1,0 ..., 0)
Wherein, MiRepresenting matrix M the i-th row vector, { wi∈Zp}i∈IFor constant.If there is one group of solution { wi∈Zp}i∈I,
Then represent that this shares user's permission to access, then push messages to and share user, agent side B transition key, judge B pairs
The ciphertext CT that A shares has access rights, and message is pushed into B, and C does not have access rights.
7. a kind of efficient information push based on mobile self-grouping network according to claim 2 and the safety side of sharing
Method, it is characterized in that share user in step S7 includes to the process that information is decrypted：
S51. share user B and ciphertext CT1, CT is never downloaded at trusted third party Internet Service Provider；
S52. share user B and utilize the private key SK of oneself, ciphertext CT is calculated as below,
Wherein L is the t exponent arithmetics for generating first g, Kρ(i)For the generation member h corresponding to the attribute of function ρ (i) mappingsρ(i)'s
T exponent arithmetics.
To e (g, g)αsIt further can be calculated m '：M '=C/e (g, g)αs, including AES key SecKey and fast
According to Snapshot；
S53. share user B information CT1 is decrypted using AES key SecKey, the message PS after being compressed；
S54. share user B to decompress the message after compression using self-adapting dictionary compress mode, obtain former letter
Breath.
Claims (7)
1. a kind of efficient information push based on mobile self-grouping network and safe sharing method, it is characterised in that：Including following five
Part：Insincere third party Internet Service Provider, key generation centre, agent side, information publisher, share user；
Wherein,
Key generation centre：For generating the mechanism of public key and private key；
Agent side：It is quick to judge to share whether user possesses access rights, and push messages to sharing with access rights
User；
Information publisher：Access control policy is formulated according to demand, and information is compressed, produces snapshot and encryption, and will be close
Text is uploaded to insincere third party Internet Service Provider；
Share user：Snapshot, information are decrypted and decompressed, obtains information original text.
2. a kind of efficient information push based on mobile network and safe sharing method, using the system in claim 1, it is special
Sign is to comprise the following steps：
S1. system is initialized, and generates public key PK and master key MK；
S2. key generation centre generates the decrypted private key SK and transition key TK of the user according to the attribute of user；
S3. information publisher is handled using the Lossless Compression of self-adapting dictionary shared picture, video, audio-frequency information m, is obtained
Information PS after compression, and a snapshot Snapshot is preserved, after information publisher uses AES symmetric encipherment algorithms to compression
Information PS is encrypted, and the access structure of set information, and AES key and snapshot Snapshot are added with access structure
It is close, it is uploaded to insincere third party Internet Service Provider；
S4. agent side never trusted third party Internet Service Provider download ciphertext, judge share user access rights whether
Meet the access control policy of ciphertext, snapshot Snapshot is pushed to if meeting and shares user；
S5. when sharing user click snapshot Snapshot, then information is decrypted, decompressed, obtain prime information.
3. a kind of efficient information push based on mobile self-grouping network according to claim 2 and safe sharing method, its
It is characterized in the step S1 that initialization procedure includes：
S11. key generation centre operation bilinearity parameter generators produce the Bilinear Groups G that two ranks are prime number p1And GT, wherein
e:G1×G1→GTFor Bilinear Pairing computing；
S12. from group G1Middle random selection | U | individual element obtains generating first h1,…,hU；
S13. random number is selectedSo that α=(α1+α2) mod p,For p-1 factorial method prime number groups；
S14. system public key PK and master key MK are obtained,
PK=(g, e (g, g)α,ga,h1,…,hU),
MK=gα
Wherein e (g, g)αThe alpha index computing of Bilinear Pairing is represented, g group is G1Generation member, gaTo generate first g alpha index fortune
Calculate.
4. a kind of efficient information push based on mobile self-grouping network according to claim 2 and safe sharing method, its
The process for being characterized in generating private key for user SK and transition key TK in the step S2 includes：
S21. in user's registration, key generation centre is that the user distributes globally unique ID；
S22. key generation centre selects random number t ∈ Z according to master key MK, the attribute set S of user and the ID of userp,
Generate the private key of user：
S23. the conversion private key TK of key generation centre generation user：Transition key is transmitted to agent side.
5. a kind of efficient information push based on mobile self-grouping network according to claim 2 and safe sharing method, letter
Breath publisher is given out information m, and message is compressed, the information PS after compression, snapshot Snapshot are encrypted, and uploaded
Process to insincere third party Internet Service Provider includes：
S31. information publisher randomly generates AES key SecKey；
S32. the information PS after compression is encrypted information publisher using AES key SecKey, obtains information ciphertext CT1,
Produce snapshot Snapshot simultaneously；
S33. information publisher defines the access control policy (M, ρ) of message, and wherein M is the linear privacy sharing square of l rows n row
Battle array, for all i=1,2 ... l every a line, the of matrix MRow is identified as ρ (i) function, ρ be one from 1 ...,
L } it is mapped to the function of participant set；
S34. random vector is selectedFor matrix M every a line, from i=1 to i=l, meter
CalculateWherein MiHomography M the i-th row vector, s be information publisher shared information, y2,…,ynFor ZpIn
The random number of selection,For ZpN random number of middle selection；
S35. information publisher selects random number r according to public key PK, access control policy (M, ρ)1…rl∈Zp, to the close of AES
Key SecKey and snapshot Snapshop is encrypted to obtain ciphertext CT, and AES key SecKey and snapshot Snapshop are represented with m ',
S36. CT1, CT are uploaded to insincere third party Internet Service Provider by information publisher together.
6. a kind of efficient information push based on mobile self-grouping network according to claim 2 and safe sharing method, its
It is characterized in that agent side judges the access rights for sharing user, carrying out the process of message push includes：
S41. never trusted third party Internet Service Provider gets the ciphertext CT of user to agent side, and agent side is according to user's
Transition key, judge to share whether user has permission to access the information by solving following equation to CT,
∑i∈IMiwi=(1,0 ..., 0)
Wherein, MiRepresenting matrix M the i-th row vector, { wi∈Zp}i∈IFor constant.If there is one group of solution { wi∈Zp}i∈I, then table
Show that this shares user's permission to access, then push messages to and share user.
7. a kind of efficient information push based on mobile self-grouping network according to claim 2 and safe sharing method, its
It is characterized in that share user in step S7 includes to the process that information is decrypted：
S51. share user and ciphertext CT1, CT is never downloaded at trusted third party Internet Service Provider；
S52. share user and utilize the private key SK of oneself, ciphertext CT is calculated as below,
Wherein L is the t exponent arithmetics for generating first g, Kρ(i)For the generation member h corresponding to the attribute of function ρ (i) mappingsρ(i)T refer to
Number computing.
To e (g, g)αsIt further can be calculated m '：M '=C/e (g, g)αs, including AES key SecKey and snapshot
Snapshot；
S53. share user information CT1 is decrypted using AES key SecKey, the message PS after being compressed；
S54. share user to decompress the message after compression using self-adapting dictionary compress mode, obtain prime information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710606319.2A CN107484161B (en) | 2017-07-24 | 2017-07-24 | A kind of efficient information push based on mobile self-grouping network and safe sharing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710606319.2A CN107484161B (en) | 2017-07-24 | 2017-07-24 | A kind of efficient information push based on mobile self-grouping network and safe sharing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107484161A true CN107484161A (en) | 2017-12-15 |
| CN107484161B CN107484161B (en) | 2019-05-24 |
Family
ID=60595930
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710606319.2A Active CN107484161B (en) | 2017-07-24 | 2017-07-24 | A kind of efficient information push based on mobile self-grouping network and safe sharing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107484161B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108712379A (en) * | 2018-04-08 | 2018-10-26 | 北京奇艺世纪科技有限公司 | Data push method and device |
| CN113225245A (en) * | 2021-04-30 | 2021-08-06 | 深圳沐奇科技有限公司 | Information interaction method for social media platform |
| US11799634B2 (en) | 2020-09-30 | 2023-10-24 | Qatar Foundation For Education, Science And Community Development | Mesh network for resource-constrained devices |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101132273A (en) * | 2006-08-24 | 2008-02-27 | 北京大唐高鸿软件技术有限公司 | Safe transmission method for text transport protocol message |
| US20130179679A1 (en) * | 2012-01-06 | 2013-07-11 | Ioannis Broustis | Methods And Apparatuses For Secure Information Sharing In Social Networks Using Randomly-Generated Keys |
| CN103281400A (en) * | 2013-06-18 | 2013-09-04 | 清华大学 | Data segmenting, coding and recovering method used for cloud storage gateway |
| CN104022868A (en) * | 2014-02-18 | 2014-09-03 | 杭州师范大学 | Outsourcing decryption method of attribute-based encryption based on ciphertext policy |
| CN104461785A (en) * | 2014-12-15 | 2015-03-25 | 中电长城网际系统应用有限公司 | Data backup method, data recovery method and device of virtual machine and physic machine |
| CN105897709A (en) * | 2016-04-01 | 2016-08-24 | 西安电子科技大学 | User attribute encryption and decryption method of non-monotonic access structure in distributed network |
| CN106341236A (en) * | 2016-09-09 | 2017-01-18 | 深圳大学 | Access control method facing cloud storage service platform and system thereof |
-
2017
- 2017-07-24 CN CN201710606319.2A patent/CN107484161B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101132273A (en) * | 2006-08-24 | 2008-02-27 | 北京大唐高鸿软件技术有限公司 | Safe transmission method for text transport protocol message |
| US20130179679A1 (en) * | 2012-01-06 | 2013-07-11 | Ioannis Broustis | Methods And Apparatuses For Secure Information Sharing In Social Networks Using Randomly-Generated Keys |
| CN103281400A (en) * | 2013-06-18 | 2013-09-04 | 清华大学 | Data segmenting, coding and recovering method used for cloud storage gateway |
| CN104022868A (en) * | 2014-02-18 | 2014-09-03 | 杭州师范大学 | Outsourcing decryption method of attribute-based encryption based on ciphertext policy |
| CN104461785A (en) * | 2014-12-15 | 2015-03-25 | 中电长城网际系统应用有限公司 | Data backup method, data recovery method and device of virtual machine and physic machine |
| CN105897709A (en) * | 2016-04-01 | 2016-08-24 | 西安电子科技大学 | User attribute encryption and decryption method of non-monotonic access structure in distributed network |
| CN106341236A (en) * | 2016-09-09 | 2017-01-18 | 深圳大学 | Access control method facing cloud storage service platform and system thereof |
Non-Patent Citations (1)
| Title |
|---|
| 马华等: "支持属性撤销和解密外包的属性基加密方案", 《西安电子科技大学学报》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108712379A (en) * | 2018-04-08 | 2018-10-26 | 北京奇艺世纪科技有限公司 | Data push method and device |
| CN108712379B (en) * | 2018-04-08 | 2021-05-25 | 北京奇艺世纪科技有限公司 | Data pushing method and device |
| US11799634B2 (en) | 2020-09-30 | 2023-10-24 | Qatar Foundation For Education, Science And Community Development | Mesh network for resource-constrained devices |
| CN113225245A (en) * | 2021-04-30 | 2021-08-06 | 深圳沐奇科技有限公司 | Information interaction method for social media platform |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107484161B (en) | 2019-05-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Xu et al. | Secure fine-grained access control and data sharing for dynamic groups in the cloud | |
| Almaiah et al. | A new hybrid text encryption approach over mobile ad hoc network | |
| CN101807991B (en) | Ciphertext policy attribute-based encryption system and method | |
| US11128454B2 (en) | Quantum safe cryptography and advanced encryption and key exchange (AEKE) method for symmetric key encryption/exchange | |
| Abusukhon et al. | New direction of cryptography: A review on text-to-image encryption algorithms based on RGB color value | |
| CN107483505A (en) | The method and system that a kind of privacy of user in Video chat is protected | |
| CN105376261A (en) | Encryption method and system for instant communication message | |
| CN108462575A (en) | Upload data ciphering method based on no trusted party thresholding Hybrid Encryption | |
| CN107484161B (en) | A kind of efficient information push based on mobile self-grouping network and safe sharing method | |
| Kaur et al. | A random selective block encryption technique for secure image cryptography using blowfish algorithm | |
| US20230208615A1 (en) | Online-Streamer Image Model File Transmission in Co-Hosting During Livestreaming | |
| Reshma et al. | Pairing-free CP-ABE based cryptography combined with steganography for multimedia applications | |
| US11411720B2 (en) | Key distribution system, terminal device, key distribution method, and program | |
| Zhang et al. | An efficient image encryption scheme for industrial Internet-of-Things devices | |
| Somaiya et al. | Implementation and evaluation of EMAES–A hybrid encryption algorithm for sharing multimedia files with more security and speed | |
| Rachmawati et al. | A combination of vigenere algorithm and one time pad algorithm in the three-pass protocol | |
| CN108768923A (en) | A kind of real-time encrypted method of chat of the Encryption Algorithm based on Quantum Reversible Logic circuit | |
| CN110321722B (en) | DNA sequence similarity safe calculation method and system | |
| CN107294972A (en) | The broad sense multi-receiver anonymity label decryption method of identity-based | |
| Shivaputra et al. | A Naïve Visual Cryptographic Algorithm for the Transfer of Compressed Medical Images | |
| Kate¹ et al. | Data sharing in cloud storage with key-aggregate cryptosystem. | |
| Guo et al. | A novel (n, t, n) secret image sharing scheme without a trusted third party | |
| Nagaraju et al. | Key-cipher policy attribute-based encryption mechanism for access control of multimedia data in cloud storages | |
| Bilakanti et al. | Secure computation over cloud using fully homomorphic encryption | |
| kadhim Bermani et al. | Efficient cryptography techniques for image encryption in cloud storage |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20180704 Address after: 100031 West Chang'an Avenue, Xicheng District, Xicheng District, Beijing Applicant after: State Grid Corporation of China Applicant after: Nanjing Nari Co., Ltd. Applicant after: East China Normal University Applicant after: State Grid Shandong Electric Power Company Address before: 100761 West Chang'an Avenue, Xicheng District, Xicheng District, Beijing Applicant before: State Grid Corporation of China Applicant before: Nanjing Nari Co., Ltd. Applicant before: East China Normal University |
|
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 100031 West Chang'an Avenue, Xicheng District, Xicheng District, Beijing Applicant after: State Grid Corporation of China Applicant after: NARI Group Co. Ltd. Applicant after: East China Normal University Applicant after: State Grid Shandong Electric Power Company Address before: 100031 West Chang'an Avenue, Xicheng District, Xicheng District, Beijing Applicant before: State Grid Corporation of China Applicant before: Nanjing Nari Co., Ltd. Applicant before: East China Normal University Applicant before: State Grid Shandong Electric Power Company |
|
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |