CN111767581B - Data encryption and encapsulation working method for block chain data security - Google Patents

Data encryption and encapsulation working method for block chain data security Download PDF

Info

Publication number
CN111767581B
CN111767581B CN202010575053.1A CN202010575053A CN111767581B CN 111767581 B CN111767581 B CN 111767581B CN 202010575053 A CN202010575053 A CN 202010575053A CN 111767581 B CN111767581 B CN 111767581B
Authority
CN
China
Prior art keywords
encryption
information
key
level
ciphertext
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
Application number
CN202010575053.1A
Other languages
Chinese (zh)
Other versions
CN111767581A (en
Inventor
郭付国
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China payment (Shenzhen) Technology Service Co.,Ltd.
Original Assignee
China Payment Shenzhen Technology Service Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by China Payment Shenzhen Technology Service Co ltd filed Critical China Payment Shenzhen Technology Service Co ltd
Priority to CN202010575053.1A priority Critical patent/CN111767581B/en
Publication of CN111767581A publication Critical patent/CN111767581A/en
Application granted granted Critical
Publication of CN111767581B publication Critical patent/CN111767581B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/602—Providing cryptographic facilities or services
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • G06F21/6227—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database where protection concerns the structure of data, e.g. records, types, queries
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures

Abstract

The invention provides a data encryption and encapsulation working method for block chain data security, which comprises the following steps: acquiring data content of the link points of the block, and carrying out encryption and encapsulation on a key; in the encryption packaging process, a hash function HX is set as follows: gmHX·PHX·BHXWherein gmHxFor initial value of key of HX function, PHXAs a variation of the chaotic equation, BHXFor quantizing the encryption weighting parameters, a random vector (lambda) is formed from the given elements of the variation1，α2，β2)∈U3，λ1For the first encryption threshold value, alpha2For the second level of ciphering threshold, beta2And the second-stage encryption state vector is used for judging the information in the encryption process, so that the safety of the encrypted data is ensured.

Description

Data encryption and encapsulation working method for block chain data security
Technical Field
The invention relates to the field of block chain encryption, in particular to a data encryption and encapsulation working method for block chain data security.
Background
Since the generation of the block chain, decentralized, irremodifiable, synchronous and intelligent distributed management are the greatest technical advantages, and the distributed advantage is that data tampering becomes a bubble shadow, but data security needs to be considered at each data node, so that data security is guaranteed to be unbearable, and the effect of encrypting and packaging data in the prior art is not ideal, so that a person skilled in the art needs to solve corresponding technical problems.
Disclosure of Invention
The invention aims to at least solve the technical problems in the prior art, and particularly innovatively provides a data encryption and encapsulation working method for block chain data security.
In order to achieve the above object, the present invention provides a data encryption and encapsulation method for blockchain data security, which includes the following steps:
acquiring data content of the link points of the block, and carrying out encryption and encapsulation on a key; setting the hash function HX to gm in the encryption packaging processHX·PHX·BHXWherein gmHXFor initial value of key of HX function, PHXAs a variation of the chaotic equation, BHXIn order to quantify the encryption weighting parameters,
forming a random vector (lambda) from the given elements of the variance1,α2,β2)∈U3，λ1For the first encryption threshold value, alpha2For the second level of ciphering threshold, beta2And the second-stage encryption state vector is used for judging the information in the encryption process, so that the safety of the encrypted data is ensured.
Preferably, the performing the key encryption package includes:
calculating the variable quantity of the original information chaotic equation according to the input system parameters,
Figure GDA0003020060890000021
wherein eta1For first-level encryption state variables, T1Is the quantization parameter of the first-stage encryption information, j is the encryption weighted value, omega is the encryption random coefficient, m1For the first level of encryption key encapsulation order,
Figure GDA0003020060890000022
is a first level encryption control parameter.
Preferably, the method further comprises the following steps: when the intelligent terminal receives the identity code authentication request of the second information interaction terminal, the threshold value lambda of the first-level encryption is input1And a second level encryption threshold value alpha2And executing the key frame retrieval of the first-stage encryption and the second-stage encryption ciphertext by the intelligent terminal: according to the access condition of the random vector in the ciphertext, if the access condition does not meet the condition, the retrieval is failed, otherwise, whether the ciphertext key frames are consistent or not is judged, if so, a judgment value 1 is output, and the key frames are successfully retrieved by the intelligent terminal; otherwise, outputting a judgment value of 0 to indicate that the retrieval is failed;
preferably, the method further comprises the following steps:
after the retrieval is successful, assuming that n is a positive integer variable, mapping the attribute from the linear matrix S belonging to the matrix of (1, n) to be a prime number Q, inputting a system parameter P, and selecting a random private key pk belonging to YkWherein Y iskIs a group of integers of order k,
according to the hash function HX and the encryption identification K: (g)1,g2,...,gi)imodk；i∈(1,2,3,4,5)，giSetting ciphertext for generating node of prime number Q on integer group
Figure GDA0003020060890000023
M is a matrix function, Z is an encrypted chaotic random phase value, rmidGenerating a key for the chaotic cipher text in the authentication information to verify the encrypted equation as
Figure GDA0003020060890000024
A1Access to the key frame ciphertext for first level encryption, B2Accessing key frame ciphertext, μ, for second level encryption1,2The authentication parameter is a double-stage encryption parameter and is multiplied by a correction threshold value H1Therefore, information judgment is carried out on the encryption process, and the safety of the encrypted data is ensured.
In summary, due to the adoption of the technical scheme, the invention has the beneficial effects that:
the identification information is added in the authentication process, and after the encryption key is used for encapsulation, the matching degree of information among all nodes of the block chain is improved, the anti-decryption property and the impact resistance of the encryption process are further improved, the information safety of the information interaction terminal is improved through the multi-thread combined matrix encryption process, and the method has high use value on data safety among networks.
Additional aspects and advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.
Drawings
The above and/or additional aspects and advantages of the present invention will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:
FIG. 1 is a schematic diagram of the operation of the present invention;
FIG. 2 is a characteristic flow diagram of the present invention;
FIG. 3 is a schematic of the encryption of the present invention;
fig. 4 is a flow chart of the present invention.
Detailed Description
The embodiments of the present invention will be described in detail below, and the embodiments described below with reference to the accompanying drawings are exemplary only for the purpose of illustrating the present invention and are not to be construed as limiting the present invention.
As shown in fig. 1 to 4, the working method of the present invention includes the following steps: s1, establishing an encryption channel for each node in the block chain network, and setting a first information interaction end and a second information interaction end for each encryption channel, wherein the first information interaction end is used for carrying out instruction distribution on encryption information, and the second information interaction end is used for receiving the encryption information and recording a random number containing specific identification information in the encryption information;
s1-1, in the process of carrying out block chain data encryption authentication, sending an information code through a first information interaction terminal, wherein the information code comprises a random number sent by a second information interaction terminal, and analyzing an instruction of sending the information code of the first information interaction terminal according to the random number sent by the second information interaction terminal according to the reference relation of the first information interaction terminal and the second information interaction terminal for the random number; the method comprises the steps that the encrypted information type and the state variable of a first information interaction terminal containing a random number are extracted and output to a second information interaction terminal for authentication operation; obtaining a random number instruction of the second information interaction terminal through an addressing rule, determining whether the first information interaction terminal with the random number instruction and the second information interaction terminal can be authenticated and matched according to a random number matching condition,
s1-2, triggering the identity code at the second information interaction terminal, carrying out authentication identification after the identity code matches and corresponds to the identification information in the information code, if the identity code does not match and corresponds to the identification information in the information code, not carrying out authentication identification,
s1-3, calculating a plurality of block chain link points needing encryption authentication, and registering addresses for the block chain link points needing encryption authentication; calling the data of the block chain storage area to acquire the number of the block chain nodes needing to encrypt the data by using the registered address; analyzing the authentication information in the encryption information definition into data types identified by the block chains, and synchronously writing the data types into each block chain node;
as shown in fig. 3, S2, the second information interaction end after the authentication of the encrypted information opens the encryption channel, performs data calling and data mining,
s2-1, the second information interaction end authenticated by the encrypted information verifies the received first local authentication information MES1 by using a first KEY KEY1, a block link point first register address ADD1 and a second state timestamp T1; if the local authentication is passed, executing first decryption switching information CONVERSE1 of a first KEY KEY1, listing information content required to be decrypted by the second information interaction end according to the block link node first register address ADD1 and the first state timestamp T1, and confirming identity information (A) of the second information interaction end according to the first decryption switching information CONVERSE11) Whether the decryption switch is successful or not,
s2-2, the second information interaction end authenticated by the encrypted information verifies the received second local authentication information MES2 by using a second KEY KEY2, a block link point second register address ADD2 and a second state timestamp T1; if the local authentication is passed, second decryption switching information CONVERSE2 of a second KEY KEY2 is executed, information content required to be decrypted by a second information interaction terminal is listed according to a second register address ADD2 and a second state timestamp T2 of the block chain node, and file information (A) of the second information interaction terminal is confirmed according to the second decryption switching information CONVERSE2 (A)2) Whether the decryption switch is successful or not,
s2-3, the second information interaction end authenticated by the encrypted information verifies the received third local authentication information MES3 by using a third KEY KEY3, a block link point third register address ADD3 and a third state timestamp T3; if the local authentication is passed, third decryption switching information CONVERSE3 of a third KEY KEY3 is executed, information content required to be decrypted by the second information interaction terminal is listed according to a third register address ADD3 and a third state timestamp T3 of the block chain node, and attribute information (A) of the second information interaction terminal is confirmed according to the third decryption switching information CONVERSE3 (A)3) If the decryption switching is successful, sequentially packaging and combining the identity, the file and the attribute into label group information and simultaneously generating plaintext information A';
s2-4, for the second information interaction end of the next block chain node, generating, encapsulating and combining into new label group information and generating plaintext information B' at the same time,
s2-5, for the next lowerThe second information interaction end of one block chain node generates, encapsulates and combines the same into a new label group information and a plaintext information C ', and then combines the operations A', B 'and C' through any block chain node in the encryption operation to form a combined encryption information group S1And keeping continuous updating by utilizing Fourier transform; for the SNProcessing the group encryption information group to obtain N groups of results obtained by Fourier transform functions, outputting the found public area joint encryption information group output value through confusion operation, and returning the content of the joint encryption information group to the guide area for address positioning;
s2-6, performing time locking on the output value of the public area joint encryption information group through the reaction time, keeping the reaction time of the existing level, checking an interception address bar, performing script description on the area positioned by the address, finding the keyword of the output value of the public area joint encryption information group according to the model information of the basic script, and performing encryption output;
and S3, after encryption output, selecting random numbers to update encryption parameters through switching authentication, generating local parameters for the main KEY of the intelligent terminal through Hash operation when the information received by the second information interaction terminal is forwarded to the intelligent terminal, updating the authentication KEY KEY by using the identity parameters of the main KEY, and performing encryption and encapsulation of the KEY.
S3-1, setting the hash function HX gm in the encryption packaging processHX·PHX·BHXWherein gmHXFor initial value of key of HX function, PHXAs a variation of the chaotic equation, BHXIn order to quantify the encryption weighting parameters,
calculating the variable quantity of the original information chaotic equation according to the input system parameters,
Figure GDA0003020060890000051
wherein eta1For first-level encryption state variables, T1Is the quantization parameter of the first-stage encryption information, j is the encryption weighted value, omega is the encryption random coefficient, m1For the first level of encryption key encapsulation order,
Figure GDA0003020060890000052
for the first level of encryption control parameters,
s3-2, forming a random vector (lambda) according to the given elements of the variation1,α2,β2)∈U3，λ1For the first encryption threshold value, alpha2For the second level of ciphering threshold, beta2In order to encrypt the state vector for the second level,
when the intelligent terminal receives the identity code authentication request of the second information interaction terminal, the threshold value lambda of the first-level encryption is input1And a second level encryption threshold value alpha2And executing the key frame retrieval of the first-stage encryption and the second-stage encryption ciphertext by the intelligent terminal: according to the access condition of the random vector in the ciphertext, if the access condition does not meet the condition, the retrieval is failed, otherwise, whether the ciphertext key frames are consistent or not is judged, if so, a judgment value 1 is output, and the key frames are successfully retrieved by the intelligent terminal; otherwise, outputting a judgment value of 0 to indicate that the retrieval is failed;
s3-3, after the retrieval is successful, assuming that n is a positive integer variable, mapping the attribute from the linear matrix S belonging to the matrix of (1, n) to be a prime number Q with a large enough attribute, inputting a system parameter P, and selecting a random private key pk belonging to the matrix YkWherein Y iskIs a group of integers of order k,
according to the hash function HX and the encryption identification K: (g)1,g2,...,gi)imodk；i∈(1,2,3,4,5)，giSetting ciphertext for generating node of prime number Q on integer group
Figure GDA0003020060890000061
M is a matrix function, Z is an encrypted chaotic random phase value, rmidGenerating a key for the chaotic cipher text in the authentication information to verify the encrypted equation as
Figure GDA0003020060890000062
A1For the first level of encrypted access key frame ciphertext, B2 for the second level of encrypted access key frame ciphertext, μ1,2The authentication parameter is a double-stage encryption parameter and is multiplied by a correction threshold value H1Therefore, information judgment is carried out on the encryption process, and the safety of the encrypted data is ensured.
As shown in fig. 2, after the first-stage encryption and the second-stage encryption, the example graph is the first-stage encryption node through a circle, the triangle is the second-stage encryption node, and the controllability and the security of the key are ensured by arranging the ciphertext and then advancing from disorder to order and from order to disorder.
While embodiments of the invention have been shown and described, it will be understood by those of ordinary skill in the art that: various changes, modifications, substitutions and alterations can be made to the embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the claims and their equivalents.

Claims (1)

1. A data encryption and encapsulation working method for block chain data security is characterized by comprising the following steps:
acquiring data content of the link points of the block, and carrying out encryption and encapsulation on a key; setting the hash function HX to gm in the encryption packaging processHX·PHX·BHXWherein gmHXFor initial value of key of HX function, PHXAs a variation of the chaotic equation, BHXIn order to quantify the encryption weighting parameters,
calculating the variable quantity of the original information chaotic equation according to the input system parameters,
Figure FDA0003085182190000011
wherein eta1For first-level encryption state variables, T1Is the quantization parameter of the first-stage encryption information, j is the encryption weighted value, omega is the encryption random coefficient, m1For the first level of encryption key encapsulation order,
Figure FDA0003085182190000012
the first level encryption control parameter;
forming a random vector (lambda) from the given elements of the variance1,α2,β2)∈U3，λ1For the first encryption threshold value, alpha2For the second level of ciphering threshold, beta2In order to encrypt the state vector for the second level,
when the intelligent terminal receives the identity code authentication request of the second information interaction terminal, the threshold value lambda of the first-level encryption is input1And a second level encryption threshold value alpha2And executing the key frame retrieval of the first-stage encryption and the second-stage encryption ciphertext by the intelligent terminal: according to the access condition of the random vector in the ciphertext, if the access condition does not meet the condition, the retrieval is failed, otherwise, whether the ciphertext key frames are consistent or not is judged, if so, a judgment value 1 is output, and the key frames are successfully retrieved by the intelligent terminal; otherwise, outputting a judgment value of 0 to indicate that the retrieval is failed;
after the retrieval is successful, assuming that n is a positive integer variable, mapping prime number Q from linear matrix S e (1, n), inputting system parameter P, and selecting a random private key pk e YkWherein Y iskIs a group of integers of order k,
according to the hash function HX and the encryption identification K: (g)1,g2,...,gi)imod k；i∈(1,2,3,4,5)，giSetting ciphertext for generating node of prime number Q on integer group
Figure FDA0003085182190000013
M is a matrix function, Z is an encrypted chaotic random phase value, rmidGenerating a key for the chaotic cipher text in the authentication information to verify the encrypted equation as
Figure FDA0003085182190000021
A1For the first level of encrypted access key frame ciphertext, B2 for the second level of encrypted access key frame ciphertext, μ1,2The authentication parameter is a double-stage encryption parameter and is multiplied by a correction threshold value H1Therefore, information judgment is carried out on the encryption process, and the safety of the encrypted data is ensured.
CN202010575053.1A 2020-06-22 2020-06-22 Data encryption and encapsulation working method for block chain data security Active CN111767581B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010575053.1A CN111767581B (en) 2020-06-22 2020-06-22 Data encryption and encapsulation working method for block chain data security

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010575053.1A CN111767581B (en) 2020-06-22 2020-06-22 Data encryption and encapsulation working method for block chain data security

Publications (2)

Publication Number Publication Date
CN111767581A CN111767581A (en) 2020-10-13
CN111767581B true CN111767581B (en) 2021-08-27

Family

ID=72721476

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010575053.1A Active CN111767581B (en) 2020-06-22 2020-06-22 Data encryption and encapsulation working method for block chain data security

Country Status (1)

Country Link
CN (1) CN111767581B (en)

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102289425B (en) * 2011-04-28 2015-05-06 哈尔滨工业大学 Hash algorithm based on extensible precision chaos
CN102184205B (en) * 2011-04-28 2016-04-13 哈尔滨工业大学 Based on the Multi-Pattern Matching method of easily extensible precision chaos Hash
CN111294481B (en) * 2020-01-14 2021-06-22 河南大学 Image encryption method based on self-updating transformation, double random three-dimensional matrix scrambling and DNA calculation

Also Published As

Publication number Publication date
CN111767581A (en) 2020-10-13

Similar Documents

Publication Publication Date Title
CN111767557B (en) Data encryption working method based on block chain
CN109922077B (en) Identity authentication method and system based on block chain
Attasena et al. Secret sharing for cloud data security: a survey
CN111541551B (en) Threshold signature message processing method, system, storage medium and server
CN108390759A (en) Code encryption, decryption method, device, computer equipment and storage medium
CN111614621B (en) Internet of things communication method and system
CN112804356B (en) Block chain-based networking equipment supervision authentication method and system
CN113378148A (en) Internet of things equipment identity authentication system and method based on block chain
CN110457928B (en) Hospital-enterprise cooperation internet hospital data security guarantee method based on block chain
CN115348107A (en) Internet of things equipment secure login method and device, computer equipment and storage medium
CN110011959B (en) Data storage method, data query method and system
Chaeikar et al. Comparative analysis of Master-key and Interpretative Key Management (IKM) frameworks
CN111767581B (en) Data encryption and encapsulation working method for block chain data security
CN111740965B (en) Internet of things equipment authentication method based on physical unclonable equation
Pablos et al. Design and Implementation of a Post-Quantum Group Authenticated Key Exchange Protocol With the LibOQS Library: A Comparative Performance Analysis From Classic McEliece, Kyber, NTRU, and Saber
Shehab et al. Efficient hierarchical key generation and key diffusion for sensor networks
US20240089097A1 (en) Key update management system and key update management method
CN111294793A (en) Data privacy protection method for identity authentication in wireless sensor network
Jovanovic et al. Multi-stage fault attacks on block ciphers
Zou et al. Dynamic provable data possession based on ranked merkle hash tree
CN108390758A (en) User password processing method, device and internal control safety monitor system
CN112134879B (en) Authorization method based on block chain intelligent contract
CN114547649A (en) Database encryption method and system
CN113407928A (en) Multi-owner RFID authentication method based on block chain
Sirapaisan et al. Communication pattern based data authentication (CPDA) designed for big data processing in a multiple public cloud environment

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
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20210809

Address after: Room 405, podium building 12, Shenzhen Bay science and technology ecological park, No.18, South Keji Road, high tech community, Yuehai street, Nanshan District, Shenzhen, Guangdong 518000

Applicant after: China payment (Shenzhen) Technology Service Co.,Ltd.

Address before: 401120 21-4, building 3, No. 669, Renhe Longshou Road, new North District, Chongqing

Applicant before: Chongqing Yukang Pharmaceutical Technology Co.,Ltd.

GR01 Patent grant
GR01 Patent grant