CN115134081A - Data associated information verification method, device, equipment and storage medium - Google Patents
Data associated information verification method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN115134081A CN115134081A CN202211064634.4A CN202211064634A CN115134081A CN 115134081 A CN115134081 A CN 115134081A CN 202211064634 A CN202211064634 A CN 202211064634A CN 115134081 A CN115134081 A CN 115134081A
- Authority
- CN
- China
- Prior art keywords
- information
- data information
- data
- ciphertext
- polynomial ring
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/002—Countermeasures against attacks on cryptographic mechanisms
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
- H04L9/3093—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy involving Lattices or polynomial equations, e.g. NTRU scheme
-
- 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/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3218—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using proof of knowledge, e.g. Fiat-Shamir, GQ, Schnorr, ornon-interactive zero-knowledge proofs
- H04L9/3221—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using proof of knowledge, e.g. Fiat-Shamir, GQ, Schnorr, ornon-interactive zero-knowledge proofs interactive zero-knowledge proofs
-
- 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/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/56—Financial cryptography, e.g. electronic payment or e-cash
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Algebra (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Mathematical Physics (AREA)
- Pure & Applied Mathematics (AREA)
- Computing Systems (AREA)
- Theoretical Computer Science (AREA)
- Storage Device Security (AREA)
Abstract
The application provides a data associated information verification method, a device, equipment and a storage medium, and relates to the technical field of financial cryptography. The method comprises the following steps: acquiring first data information and second data information; the first data information and the second data information represent the same parameter information; mapping the first data information according to a preset mapping relation table to obtain first polynomial ring data information, and mapping the second data information to obtain second polynomial ring data information; the preset mapping relation table represents the relevance between the data information and the polynomial ring data information; and verifying data association information between the first data information and the second data information according to the first polynomial ring data information and the second polynomial ring data information. By adopting the technical scheme, the problem of consistency of the two data provided by the data provider can be verified under the condition that the specific amount of the original data is not known.
Description
Technical Field
The present application relates to the field of financial cryptography, and in particular, to a method, an apparatus, a device, and a storage medium for verifying data association information.
Background
With the development of quantum computers, serious threats can be generated to modern financial password security algorithms, and under the background, quantum security resistance has become a non-negligible subject in the financial field. In the financial field, it often appears that different companies need to demonstrate the correctness of their data information to third parties so that the third parties can serve the company. For example, the first party company needs to prove to the bank that the amounts of the two contracts it holds are the same to loan through the bank, but the amounts of the first party company's contracts are not known to the bank, but must verify to the bank that the amounts of the two contracts are consistent.
However, the above problems are not solved in the current methods.
Therefore, a data association information verification method is needed, which has quantum security resistance and can verify consistency of two pieces of data provided by a data provider without knowing a specific amount of original data.
Disclosure of Invention
The application provides a data association information verification method, a device, equipment and a storage medium, which are used for solving the problem that the consistency of two pieces of data provided by a data provider can be verified under the condition that the specific amount of original data is not known.
In a first aspect, the present application provides a data association information verification method, where the method includes:
acquiring first data information and second data information; wherein the first data information and the second data information represent the same parameter information;
mapping the first data information to obtain first polynomial ring data information according to a preset mapping relation table, and mapping the second data information to obtain second polynomial ring data information; the preset mapping relation table represents the relevance between the data information and the polynomial ring data information;
and verifying data association information between the first data information and the second data information according to the first polynomial ring data information and the second polynomial ring data information.
In one example, verifying data association information between the first data information and the second data information from the first polynomial ring data information and the second polynomial ring data information includes:
generating first ciphertext information according to the first polynomial ring data information;
generating second ciphertext information according to the second polynomial ring data information;
and verifying data association information between the first data information and the second data information according to the first ciphertext information and the second ciphertext information.
In one example, generating first ciphertext information from the first polynomial ring data information includes:
generating the first ciphertext information according to the first key information and the first polynomial ring data information; wherein the first key information is generated from the first data information.
In one example, the first ciphertext information further includes common parameter information; the public parameter information is polynomial ring data information.
In one example, the first key information includes: first public key information and first private key information.
In one example, generating second ciphertext information from the second polynomial ring data information includes:
generating second ciphertext information according to second key information and the second polynomial ring data information; wherein the second key information is generated from the second data information.
In one example, verifying data association information between the first data information and the second data information according to the first ciphertext information and the second ciphertext information includes:
and calculating the difference value between the numerical value in the first ciphertext information and the numerical value in the second ciphertext information, and determining data association information between the numerical value in the first ciphertext information and the numerical value in the second ciphertext information according to the difference value.
In one example, the method further comprises: and uploading the first ciphertext information and the second ciphertext information to a sharing platform.
In a second aspect, the present application provides a data association information verification method, including:
acquiring first ciphertext information and second ciphertext information from a sharing platform; the first ciphertext information represents the encryption information of the first data information; the second ciphertext information represents encryption information of second data information;
and verifying data association information between the first data information and the second data information according to the first ciphertext information and the second ciphertext information.
In a third aspect, the present application provides a data association information verification apparatus, including:
an acquisition unit configured to acquire first data information and second data information; wherein the first data information and the second data information represent the same parameter information;
the mapping unit is used for mapping the first data information according to a preset mapping relation table to obtain first polynomial ring data information, and mapping the second data information to obtain second polynomial ring data information; the preset mapping relation table represents the relevance between the data information and the polynomial ring data information;
and the verification unit is used for verifying data association information between the first data information and the second data information according to the first polynomial ring data information and the second polynomial ring data information.
In a fourth aspect, the present application provides a data association information verification apparatus, including:
the acquisition unit is used for acquiring the first ciphertext information and the second ciphertext information from the sharing platform; the first ciphertext information represents the encryption information of the first data information; the second ciphertext information represents encryption information of second data information;
and the verification unit is used for verifying data association information between the first data information and the second data information according to the first ciphertext information and the second ciphertext information.
In a fifth aspect, the present application provides an electronic device, comprising: a processor, and a memory communicatively coupled to the processor;
the memory stores computer execution instructions;
the processor executes computer-executable instructions stored by the memory to implement the method of the first or second aspect.
In a sixth aspect, the present application provides a computer-readable storage medium having stored thereon computer-executable instructions for implementing the method according to the first or second aspect when executed by a processor.
In a seventh aspect, the present application provides a computer program product comprising a computer program that, when executed by a processor, implements the method according to the first or second aspect.
According to the data association information verification method, device, equipment and storage medium, first data information and second data information are obtained; the first data information and the second data information represent the same parameter information; mapping the first data information to obtain first polynomial ring data information according to a preset mapping relation table, and mapping the second data information to obtain second polynomial ring data information; the preset mapping relation table represents the relevance between the data information and the polynomial ring data information; and verifying data association information between the first data information and the second data information according to the first polynomial ring data information and the second polynomial ring data information.
By adopting the technical scheme, the problem of consistency of the two data provided by the data provider can be verified under the condition that the specific amount of the original data is not known.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and together with the description, serve to explain the principles of the application.
Fig. 1 is a schematic flowchart of a data association information verification method according to an embodiment of the present application;
fig. 2 is a schematic flowchart of a data association information verification method according to a second embodiment of the present application;
fig. 3 is a schematic flowchart of a data association information verification method according to a third embodiment of the present application;
fig. 4 is a schematic diagram of a data association information verification apparatus according to the fourth embodiment of the present application;
fig. 5 is a schematic diagram of a data association information verification apparatus according to a fifth embodiment of the present application;
fig. 6 is a schematic diagram of a data related information verification apparatus according to a sixth embodiment of the present application;
FIG. 7 is a block diagram illustrating an electronic device in accordance with an example embodiment.
With the above figures, there are shown specific embodiments of the present application, which will be described in more detail below. The drawings and written description are not intended to limit the scope of the inventive concepts in any manner, but rather to illustrate the concepts of the application by those skilled in the art with reference to specific embodiments.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary examples do not represent all implementations consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the application, as detailed in the appended claims.
The data association information verification method provided by the application aims to solve the technical problems in the prior art.
The following describes the technical solutions of the present application and how to solve the above technical problems with specific embodiments. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments. Embodiments of the present application will be described below with reference to the accompanying drawings.
Fig. 1 is a schematic flowchart of a data association information verification method according to an embodiment of the present application. The first embodiment comprises the following steps:
s101, acquiring first data information and second data information; wherein the first data information and the second data information represent the same parameter information.
In one example, the first data information and the second data information may be data information provided by the same party in different periods, or may be data information provided by different parties. For example, the first data information is a copy of contract data information a provided by company a and signed with company B in 2020, the time of uploading the contract data information to the sharing platform is 2020, the second data information is a copy of contract data information a provided by company a and signed with company B in 2020, and the time of uploading the contract data information to the sharing platform is 2022. The first data information can also be a copy of contract data information A provided by company A and signed with company B in 2020, the time of uploading the contract data information to the sharing platform is 2020, the second data information is a copy of contract data information A provided by company B and signed with company A in 2020, and the time of uploading the contract data information to the sharing platform is 2020. If the first data information is money amount information, the second data information is money amount information, and if the first data information is date information, the second data information is date information.
S102, mapping the first data information to obtain first polynomial ring data information according to a preset mapping relation table, and mapping the second data information to obtain second polynomial ring data information; the preset mapping relation table represents the relevance between the data information and the polynomial ring data information.
In one example, the preset mapping relation table is a relation table between data information and polynomial ring data information, where the polynomial ring data information is generalization information of a polynomial in elementary mathematics, and a polynomial ring on one ring R is a ring composed of polynomials with coefficients in R, and an algebraic operation therein is defined by multiplication and addition of the polynomials. In the domain-theoretic language, when R is a commutative ring, the polynomial ring can be characterized as a free object in the commutative R-algebraic domain. In this embodiment, the polynomial ring data information may be solved by the following formula:
the first data information is mapped to the formula to obtain first polynomial ring data information, and the second data information is mapped to the formula to obtain second polynomial ring data information, where a specific algorithm for mapping to a polynomial ring may not be limited.
S103, verifying data association information between the first data information and the second data information according to the first polynomial ring data information and the second polynomial ring data information.
In one example, with the first polynomial ring data information and the second polynomial ring data information, the correlation between the first data information and the second data information can be established and obtained through a zero-knowledge proof process.
Further, in cryptography, zero knowledge proof is a method by which one party can prove itself to the other party without communicating any information other than the knowledge of the value x.
According to the data association information verification method, device, equipment and storage medium, first data information and second data information are obtained; the first data information and the second data information represent the same parameter information; mapping the first data information to obtain first polynomial ring data information according to a preset mapping relation table, and mapping the second data information to obtain second polynomial ring data information; the preset mapping relation table represents the relevance between the data information and the polynomial ring data information; and verifying data association information between the first data information and the second data information according to the first polynomial ring data information and the second polynomial ring data information. By adopting the technical scheme, the problem that the consistency of the two pieces of data provided by the data provider can be verified under the condition that the specific amount of the original data is unknown can be solved.
Fig. 2 is a schematic flowchart of a data association information verification method according to a second embodiment of the present application. The second embodiment comprises the following steps:
s201, acquiring first data information and second data information; wherein the first data information and the second data information represent the same parameter information.
For example, this step may refer to step S101 described above, and is not described again.
S202, mapping the first data information according to a preset mapping relation table to obtain first polynomial ring data information, and mapping the second data information to obtain second polynomial ring data information; the preset mapping relation table represents the relevance between the data information and the polynomial ring data information.
For example, this step may refer to step S102, which is not described again.
And S203, generating first ciphertext information according to the first polynomial ring data information.
In this embodiment, the first ciphertext information is data information obtained by encrypting the first data information. Specifically, generating the first ciphertext information according to the first polynomial ring data information includes: generating first ciphertext information according to the first key information and the first polynomial ring data information; wherein the first key information is generated from the first data information.
In one example, the first ciphertext information may be generated from first key information and first polynomial ring data information, wherein the first key information comprises: first public key information and first private key information. Setting the first public key information to t1, the first private key information to s1 and e1, the first ciphertext information to c1, and the first data information to m1, the first ciphertext information c1 may be represented As c1= t1+ m1, where t1= As1+ e1, and a is represented As public parameter information, where the public parameter information is also polynomial ring data information. Further, the first private key information is generated as follows:
（s1，e1）←S η l *S η k where s1 and e1 are polynomial random number vectors with s1 being in dimension l, e1 being in dimension k, and the infinite norms of all elements in s1 and e1 being in the infinite norm
Within.
In this embodiment, the generation process of the public parameter information is as follows:
A←R q k*l the polynomial ring data information is generated as follows:
the common parameter information a is a k × l polynomial random number matrix. Further, each element in the common parameter information a is a satisfy
Wherein each coefficient on each polynomial belongs to Z q [X]The number of (2).
In this embodiment, in order to ensure that the generated first ciphertext information has the quantum-resistant security property, a random number may be generated, and the random number generation source having the quantum-resistant property is used to generate the random number, and the quantum-resistant random number generation source itself is not limited, and may be a quantum-resistant financial data encryption machine, or a quantum-resistant random number chip generator.
And S204, generating second ciphertext information according to the second polynomial ring data information.
In one example, generating the second ciphertext information from the second polynomial ring data information includes:
generating second ciphertext information according to the second key information and the second polynomial ring data information; wherein the second key information is generated from the second data information.
In this embodiment, the second ciphertext information is data information obtained by encrypting the second data information. Specifically, generating the second ciphertext information according to the second polynomial ring data information includes: generating second ciphertext information according to the second key information and the second polynomial ring data information; wherein the second key information is generated from the second data information.
In one example, the second ciphertext information may be generated from second key information and second polynomial ring data information, wherein the second key information comprises: second public key information and second private key information. Setting the second public key information to t2, the second private key information to s2 and e2, the second ciphertext information to c2, and the second data information to m2, the second ciphertext information c2 may be represented As c2= t2+ m2, where t2= As2+ e2, and a is represented As public parameter information, where the public parameter information is also polynomial ring data information. Further, the second private key information is generated as follows:
（s2，e2）←S η l *S η k where s2 and e2 are polynomial random number vectors with s2 being in dimension l, e2 being in dimension k, and the infinite norms of all elements in s2 and e2 being in the infinite norm
Within.
Further, the second ciphertext information c2= As2+ e2+ m 2. Correspondingly, the process of obtaining the second data information through the second ciphertext information is as follows:
since e2 is one
Small noise within range, and m2 belongs to
So that when
Much less than q, the second data information m2 can be recovered from e2+ m 2.
In this embodiment, each data message is correspondingly encrypted to obtain a corresponding ciphertext message.
S205, calculating a difference value between the numerical value in the first ciphertext message and the numerical value in the second ciphertext message, and determining data association information between the numerical value in the first ciphertext message and the numerical value in the second ciphertext message according to the difference value.
In an example, after the first ciphertext information and the second ciphertext information are obtained, a difference between a value in the first ciphertext information and a value in the second ciphertext information is calculated, which may be specifically calculated by the following formula:
if m1= m2, then
And c at the moment is taken as a new public key, the private key of the public key is (s 1-s2, e1-e 2), and the private key is taken as a digital signature to complete zero knowledge proof.
Further, the air conditioner is provided with a fan,upon determination of the private key (s 1-s2, e1-e 2) a digital signature may be provided, and the only way to obtain the private key is m1= m2, if
Then a polynomial vector s has to be found such that:
the digital signature can be forged by the above formula, but s is an infinite norm
Small vectors within, so
For convenience of presentation, let (s 1-s2, e1-e 2) = (s, e), and combine M1 and M2 as a digitally signed message M = M1| | M2, thereby providing a digital signature, the signature protocol is as follows:
whileZ：=
do；
w 1 =HighBits(A y， 2λ 2 )；
the above process is described as follows:
1）
generating a random number vector y with dimension I, wherein any one component in the vector y is
Within the interval of (a).
2）w 1 =HighBits(A y, 2λ 2 ): from the calculated vector A y To extract high-order information, here we assume the security parameters
Is an exponential power of 2, then in this equation, it is equivalent to that for A y Cut off every element of low
One bit, only the number of high-order bits is reserved.
3) 
: for the products obtained in the above step
Performing hash operation together with a message M for signature, marking the result of the hash as c, and constraining the hash result (we regard c as the efficient of subsequent calculation) in order to ensure the high efficiency of the subsequent calculationIs a binary data) in which the number of +1, -1 does not exceed an upper bound
。
4)
Multiplying c by the private key component s and adding the result to the random number vector y to obtain a new vector z. Where (z, c) is calculated as the result of the digital signature.
However, in order to ensure the correctness and safety of the whole protocol, the vector z should also satisfy the following condition:
the first condition is as follows:
if the infinite norm of z is greater than or equal to
If the digital signature fails, returning to the step 1) to repeat the calculation process; here, λ 1 Is the upper bound of the elements in the random number vector y,
is the upper bound of any element in the result of the two multiplications cs and ce, since the private key component s,
having the same upper bound
The upper bound after multiplication by c is also the same.
And a second condition:
first, vector A is calculated y Subtract ce and take the result
Low bit within range; if the result is greater than or equal to
And if the calculation has potential safety hazard, returning to the step 1) to repeat the calculation process.
If the condition one and the condition two are both satisfied, the operation is reasonable, and the final digital signature result is (z, c).
Description of the drawings: the security parameters used in the above calculation process:
the balance between the safety and efficiency of the calculation can be obtained by adjusting these safety parameters, and in this embodiment, no constraint is imposed on the specific values of these parameters.
S206, uploading the first ciphertext information and the second ciphertext information to a sharing platform.
In this embodiment, the shared platform may be a platform of a block chain, or may be a server accessible by multiple parties. And uploading the first ciphertext information and the second ciphertext information to a sharing platform for downloading and using by other parties.
According to the data association information verification method, first data information and second data information are obtained, the first data information is mapped according to a preset mapping relation table to obtain first polynomial ring data information, the second data information is mapped to obtain second polynomial ring data information, first ciphertext information is generated according to the first polynomial ring data information, second ciphertext information is generated according to the second polynomial ring data information, the difference value between the numerical value in the first ciphertext information and the numerical value in the second ciphertext information is calculated, the data association information between the first ciphertext information and the second ciphertext information is determined through the difference value, and the first ciphertext information and the second ciphertext information are uploaded to a sharing platform. By adopting the technical scheme, the LWE is used as a password primitive, and aiming at the encrypted ciphertext data of the LWE, the quantum-resistant safety characteristic of the LWE problem is utilized to construct a zero-knowledge proof that two ciphertexts are equal, so that the whole process has the quantum-resistant safety characteristic.
Fig. 3 is a schematic flowchart of a data association information verification method according to a third embodiment of the present application. The third embodiment comprises the following steps:
s301, acquiring first ciphertext information and second ciphertext information from a sharing platform; the first ciphertext information represents the encryption information of the first data information; the second ciphertext information may represent the encryption information of the second data information.
In one example, the first ciphertext information and the second ciphertext information may be obtained from the shared platform, and a value in the first ciphertext information and a value in the second ciphertext information may be set to be equal, and the zero knowledge proof may be used to prove that
。
S302, verifying data association information between the first data information and the second data information according to the first ciphertext information and the second ciphertext information.
In this embodiment, the data association information between the first data information and the second data information may be verified according to the following protocol:
the above process is described as follows:
1) and (3) calculating: az-ct, and
for value range, any element in the new Az-ct vector is reserved
The calculation result of the step is given as:
。
2) checking whether the infinite norm of z satisfies the constraint condition:
。
3) computing
And comparing the hash value with the received digital signature c, if
If the hash value of the signature is equal to the digital signature, the signature verification is passed, otherwise, the signature verification fails.
According to the data association information verification method, the first ciphertext information and the second ciphertext information are obtained from the sharing platform, and the data association information between the first data information and the second data information is verified according to the first ciphertext information and the second ciphertext information. By adopting the technical scheme, the problem of consistency of the two data provided by the data provider can be verified under the condition that the specific amount of the original data is not known.
Fig. 4 is a schematic diagram of a data association information verification apparatus according to the fourth embodiment of the present application. The apparatus 40 according to the fourth embodiment includes:
an acquisition unit 401 configured to acquire first data information and second data information; wherein the first data information and the second data information represent the same parameter information.
A mapping unit 402, configured to map the first data information according to a preset mapping relationship table to obtain first polynomial ring data information, and map the second data information to obtain second polynomial ring data information; the preset mapping relation table represents the relevance between the data information and the polynomial ring data information.
A verifying unit 403, configured to verify data association information between the first data information and the second data information according to the first polynomial ring data information and the second polynomial ring data information.
It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working process of the above-described apparatus may refer to the corresponding process in the foregoing method embodiment, and is not described herein again.
Fig. 5 is a schematic diagram of a data association information verification apparatus according to a fifth embodiment of the present application. The apparatus 50 of the fifth embodiment, comprising:
an obtaining unit 501, configured to obtain first data information and second data information; wherein the first data information and the second data information represent the same parameter information.
A mapping unit 502, configured to map the first data information according to a preset mapping relationship table to obtain first polynomial ring data information, and map the second data information to obtain second polynomial ring data information; the preset mapping relation table represents the relevance between the data information and the polynomial ring data information.
A verifying unit 503, configured to verify data association information between the first data information and the second data information according to the first polynomial ring data information and the second polynomial ring data information.
In one example, the verification unit 503 includes:
a first generating module 5031, configured to generate first ciphertext information according to the first polynomial ring data information.
A second generating module 5032, configured to generate second ciphertext information according to the second polynomial ring data information.
The verifying module 5033 is configured to verify data association information between the first data information and the second data information according to the first ciphertext information and the second ciphertext information.
In one example, the first generation module 5031 is specifically configured to:
generating first ciphertext information according to the first key information and the first polynomial ring data information; wherein the first key information is generated from the first data information.
In one example, the first ciphertext information further comprises the common parameter information; the public parameter information is polynomial ring data information.
In one example, the first key information includes: first public key information and first private key information.
In one example, the second generating module 5032 is specifically configured to:
generating second ciphertext information according to the second key information and the second polynomial ring data information; wherein the second key information is generated from the second data information.
In one example, the verification module 5033 comprises:
the calculating sub-module 50331 is configured to calculate a difference between the value in the first ciphertext message and the value in the second ciphertext message, and determine data association information therebetween by using the difference.
In one example, the apparatus further comprises:
an uploading unit 504, configured to upload the first ciphertext information and the second ciphertext information to the sharing platform.
It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working process of the above-described apparatus may refer to the corresponding process in the foregoing method embodiment, and is not described herein again.
Fig. 6 is a schematic diagram of a data related information verification apparatus according to a sixth embodiment of the present application. The apparatus 60 according to the sixth embodiment includes:
an obtaining unit 601, configured to obtain first ciphertext information and second ciphertext information from a shared platform; the first ciphertext information represents the encryption information of the first data information; the second ciphertext information represents the encryption information of the second data information;
the verifying unit 602 is configured to verify data association information between the first data information and the second data information according to the first ciphertext information and the second ciphertext information.
It can be clearly understood by those skilled in the art that, for convenience and simplicity of description, the specific working process of the above-described device may refer to the corresponding process in the foregoing method embodiment, and details are not described herein again.
FIG. 7 is a block diagram illustrating an electronic device, which may be a mobile phone, a computer, a digital broadcast terminal, a messaging device, a game console, a tablet device, a medical device, an exercise device, a personal digital assistant, and the like, in accordance with an exemplary embodiment.
The apparatus 700 may include one or more of the following components: a processing component 702, a memory 704, a power component 706, a multimedia component 708, an audio component 710, an input/output (I/O) interface 712, a sensor component 714, and a communication component 716.
The processing component 702 generally controls overall operation of the device 700, such as operations associated with display, telephone calls, data communications, camera operations, and recording operations. The processing component 702 may include one or more processors 720 to execute instructions to perform all or a portion of the steps of the methods described above. Further, processing component 702 may include one or more modules that facilitate interaction between processing component 702 and other components. For example, the processing component 702 may include a multimedia module to facilitate interaction between the multimedia component 708 and the processing component 702.
The memory 704 is configured to store various types of data to support operations at the apparatus 700. Examples of such data include instructions for any application or method operating on device 700, contact data, phonebook data, messages, pictures, videos, and so forth. The memory 704 may be implemented by any type or combination of volatile or non-volatile memory devices such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disks.
The power supply component 706 provides power to the various components of the device 700. The power components 706 may include a power management system, one or more power supplies, and other components associated with generating, managing, and distributing power for the device 700.
The multimedia component 708 includes a screen that provides an output interface between the device 700 and a user. In some embodiments, the screen may include a Liquid Crystal Display (LCD) and a Touch Panel (TP). If the screen includes a touch panel, the screen may be implemented as a touch screen to receive an input signal from a user. The touch panel includes one or more touch sensors to sense touch, slide, and gestures on the touch panel. The touch sensor may not only sense the boundary of a touch or slide action, but also detect the duration and pressure associated with the touch or slide operation. In some embodiments, the multimedia component 708 includes a front facing camera and/or a rear facing camera. The front camera and/or the rear camera may receive external multimedia data when the device 700 is in an operation mode, such as a photographing mode or a video mode. Each front camera and rear camera may be a fixed optical lens system or have a focal length and optical zoom capability.
The audio component 710 is configured to output and/or input audio signals. For example, audio component 710 includes a Microphone (MIC) configured to receive external audio signals when apparatus 700 is in an operational mode, such as a call mode, a recording mode, and a voice recognition mode. The received audio signal may further be stored in the memory 704 or transmitted via the communication component 716. In some embodiments, audio component 710 also includes a speaker for outputting audio signals.
The I/O interface 712 provides an interface between the processing component 702 and peripheral interface modules, which may be keyboards, click wheels, buttons, etc. These buttons may include, but are not limited to: a home button, a volume button, a start button, and a lock button.
The sensor assembly 714 includes one or more sensors for providing status assessment of various aspects of the apparatus 700. For example, sensor assembly 714 may detect an open/closed state of device 700, the relative positioning of components, such as a display and keypad of device 700, sensor assembly 714 may also detect a change in position of device 700 or a component of device 700, the presence or absence of user contact with device 700, orientation or acceleration/deceleration of device 700, and a change in temperature of device 700. The sensor assembly 714 may include a proximity sensor configured to detect the presence of a nearby object without any physical contact. The sensor assembly 714 may also include a light sensor, such as a CMOS or CCD image sensor, for use in imaging applications. In some embodiments, the sensor assembly 714 may also include an acceleration sensor, a gyroscope sensor, a magnetic sensor, a pressure sensor, or a temperature sensor.
The communication component 716 is configured to facilitate wired or wireless communication between the apparatus 700 and other devices. The apparatus 700 may access a wireless network based on a communication standard, such as WiFi, 2G or 3G, or a combination thereof. In an exemplary embodiment, the communication component 716 receives a broadcast signal or broadcast related information from an external broadcast management system via a broadcast channel. In an exemplary embodiment, the communication component 716 further includes a Near Field Communication (NFC) module to facilitate short-range communications. For example, the NFC module may be implemented based on Radio Frequency Identification (RFID) technology, infrared data association (IrDA) technology, Ultra Wideband (UWB) technology, Bluetooth (BT) technology, and other technologies.
In an exemplary embodiment, the apparatus 700 may be implemented by one or more Application Specific Integrated Circuits (ASICs), Digital Signal Processors (DSPs), Digital Signal Processing Devices (DSPDs), Programmable Logic Devices (PLDs), Field Programmable Gate Arrays (FPGAs), controllers, micro-controllers, microprocessors or other electronic components for performing the above-described methods.
In an exemplary embodiment, a non-transitory computer readable storage medium comprising instructions, such as the memory 704 comprising instructions, executable by the processor 720 of the device 700 to perform the above-described method is also provided. For example, the non-transitory computer readable storage medium may be a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.
A non-transitory computer-readable storage medium, wherein instructions of the storage medium, when executed by a processor of an electronic device, enable the electronic device to perform a data association information verification method of the electronic device.
The application also discloses a computer program product comprising a computer program which, when executed by a processor, implements the method as described in the embodiments.
In the technical scheme of the application, the collection, storage, use, processing, transmission, provision, disclosure and other processing of the related information such as financial data or user data and the like all accord with the regulations of related laws and regulations and do not violate the good custom of the public order.
Various implementations of the systems and techniques described here above may be realized in digital electronic circuitry, integrated circuitry, Field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), system on a chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.
Program code for implementing the methods of the present application may be written in any combination of one or more programming languages. These program code may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the program code, when executed by the processor or controller, causes the functions/acts specified in the flowchart and/or block diagram to be performed. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package partly on the machine and partly on a remote machine or entirely on the remote machine or electronic device.
In the context of this application, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic, speech, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data electronic device), or that includes a middleware component (e.g., an application electronic device), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), Wide Area Networks (WANs), and the Internet.
The computer system may include a client and an electronic device. The client and the electronic device are generally remote from each other and typically interact through a communication network. The relationship of client and electronic device arises by virtue of computer programs running on the respective computers and having a client-electronic device relationship to each other. The electronic device may be a cloud electronic device, which is also called a cloud computing electronic device or a cloud host, and is a host product in a cloud computing service system, so as to solve the defects of high management difficulty and low service extensibility in a conventional physical host and VPS service ("Virtual Private Server", or "VPS" for short). The electronic device may also be a distributed system of electronic devices or an electronic device incorporating a blockchain. It should be understood that various forms of the flows shown above may be used, with steps reordered, added, or deleted. For example, the steps described in the present application may be executed in parallel, sequentially, or in different orders, as long as the desired results of the technical solutions disclosed in the present application can be achieved, and the present invention is not limited herein.
Other embodiments of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the application being indicated by the following claims.
It will be understood that the present application is not limited to the precise arrangements that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the application is limited only by the appended claims.
Claims (14)
1. A data association information verification method is characterized by comprising the following steps:
acquiring first data information and second data information; wherein the first data information and the second data information represent the same parameter information; the first data information and the second data information are data information provided by different parties;
mapping the first data information according to a preset mapping relation table to obtain first polynomial ring data information, and mapping the second data information to obtain second polynomial ring data information; the preset mapping relation table represents the relevance between the data information and the polynomial ring data information;
and verifying data association information between the first data information and the second data information according to the first polynomial ring data information and the second polynomial ring data information.
2. The method of claim 1, wherein verifying data association information between the first data information and the second data information based on the first polynomial ring data information and the second polynomial ring data information comprises:
generating first ciphertext information according to the first polynomial ring data information;
generating second ciphertext information according to the second polynomial ring data information;
and verifying data association information between the first data information and the second data information according to the first ciphertext information and the second ciphertext information.
3. The method of claim 2, wherein generating first ciphertext information from the first polynomial ring data information comprises:
generating the first ciphertext information according to the first key information and the first polynomial ring data information; wherein the first key information is generated from the first data information.
4. The method of claim 3, wherein the first ciphertext information further comprises common parameter information; the public parameter information is polynomial ring data information.
5. The method of claim 3, wherein the first key information comprises: first public key information and first private key information.
6. The method of claim 2, wherein generating second ciphertext information from the second polynomial ring data information comprises:
generating second ciphertext information according to second key information and the second polynomial ring data information; wherein the second key information is generated from the second data information.
7. The method of claim 2, wherein verifying the data association information between the first data information and the second data information according to the first ciphertext information and the second ciphertext information comprises:
and calculating the difference value between the numerical value in the first ciphertext information and the numerical value in the second ciphertext information, and determining data association information between the numerical value in the first ciphertext information and the numerical value in the second ciphertext information according to the difference value.
8. The method of claim 2, further comprising: and uploading the first ciphertext information and the second ciphertext information to a sharing platform.
9. A data association information verification method is characterized by comprising the following steps:
acquiring first ciphertext information and second ciphertext information from a sharing platform; the first ciphertext information represents the encryption information of the first data information; the second ciphertext information represents encryption information of second data information; the first data information and the second data information are data information provided by different parties;
and verifying data association information between the first data information and the second data information according to the first ciphertext information and the second ciphertext information.
10. An apparatus for verifying data association information, the apparatus comprising:
an acquisition unit configured to acquire first data information and second data information; wherein the first data information and the second data information represent the same parameter information; the first data information and the second data information are data information provided by different parties;
the mapping unit is used for mapping the first data information according to a preset mapping relation table to obtain first polynomial ring data information, and mapping the second data information to obtain second polynomial ring data information; the preset mapping relation table represents the relevance between the data information and the polynomial ring data information;
and the verification unit is used for verifying data association information between the first data information and the second data information according to the first polynomial ring data information and the second polynomial ring data information.
11. An apparatus for verifying data association information, the apparatus comprising:
the acquisition unit is used for acquiring the first ciphertext information and the second ciphertext information from the sharing platform; the first ciphertext information represents the encryption information of the first data information; the second ciphertext information represents encryption information of second data information; the first data information and the second data information are data information provided by different parties;
and the verification unit is used for verifying data association information between the first data information and the second data information according to the first ciphertext information and the second ciphertext information.
12. An electronic device, comprising: a processor, and a memory communicatively coupled to the processor;
the memory stores computer-executable instructions;
the processor executes computer-executable instructions stored by the memory to implement the method of any one of claims 1-8 or claim 9.
13. A computer-readable storage medium having computer-executable instructions stored therein, which when executed by a processor, are configured to implement the method of any one of claims 1-8 or claim 9.
14. A computer program product comprising a computer program which, when executed by a processor, carries out the method of any one of claims 1 to 8 or claim 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211064634.4A CN115134081B (en) | 2022-09-01 | 2022-09-01 | Data association information verification method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211064634.4A CN115134081B (en) | 2022-09-01 | 2022-09-01 | Data association information verification method, device, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115134081A true CN115134081A (en) | 2022-09-30 |
| CN115134081B CN115134081B (en) | 2022-12-06 |
Family
ID=83387679
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211064634.4A Active CN115134081B (en) | 2022-09-01 | 2022-09-01 | Data association information verification method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115134081B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080069344A1 (en) * | 2006-08-30 | 2008-03-20 | Samsung Electronics Co., Ltd. | Method and apparatus for key agreement between devices using polynomial ring |
| US20170147835A1 (en) * | 2015-11-25 | 2017-05-25 | International Business Machines Corporation | Efficient two party oblivious transfer using a leveled fully homomorphic encryption |
| US20170366349A1 (en) * | 2016-06-16 | 2017-12-21 | International Business Machines Corporation | Proofs of Plaintext Knowledge and Group Signatures Incorporating Same |
| US20180343127A1 (en) * | 2017-05-08 | 2018-11-29 | Amazon Technologies, Inc. | Communication protocol using implicit certificates |
| CN111464499A (en) * | 2020-03-06 | 2020-07-28 | 深圳壹账通智能科技有限公司 | Electronic warehouse receipt tracing method and device, computer equipment and storage medium |
| CN112818370A (en) * | 2021-02-20 | 2021-05-18 | 深圳百纳维科技有限公司 | Information verification method, device, electronic equipment, system and medium |
| WO2021228239A1 (en) * | 2020-05-15 | 2021-11-18 | 支付宝(杭州)信息技术有限公司 | Asset type consistency evidence generation method and system, transaction method and system, and transaction verification method and system |
-
2022
- 2022-09-01 CN CN202211064634.4A patent/CN115134081B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080069344A1 (en) * | 2006-08-30 | 2008-03-20 | Samsung Electronics Co., Ltd. | Method and apparatus for key agreement between devices using polynomial ring |
| US20170147835A1 (en) * | 2015-11-25 | 2017-05-25 | International Business Machines Corporation | Efficient two party oblivious transfer using a leveled fully homomorphic encryption |
| US20170366349A1 (en) * | 2016-06-16 | 2017-12-21 | International Business Machines Corporation | Proofs of Plaintext Knowledge and Group Signatures Incorporating Same |
| US20180343127A1 (en) * | 2017-05-08 | 2018-11-29 | Amazon Technologies, Inc. | Communication protocol using implicit certificates |
| CN111464499A (en) * | 2020-03-06 | 2020-07-28 | 深圳壹账通智能科技有限公司 | Electronic warehouse receipt tracing method and device, computer equipment and storage medium |
| WO2021228239A1 (en) * | 2020-05-15 | 2021-11-18 | 支付宝(杭州)信息技术有限公司 | Asset type consistency evidence generation method and system, transaction method and system, and transaction verification method and system |
| CN112818370A (en) * | 2021-02-20 | 2021-05-18 | 深圳百纳维科技有限公司 | Information verification method, device, electronic equipment, system and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115134081B (en) | 2022-12-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111989891B (en) | Data processing method, related device and block chain system | |
| JP2020515885A (en) | Blockchain data protection based on universal account model and homomorphic encryption | |
| CN103488922B (en) | A kind of method and apparatus for providing identifying code | |
| CN114978512B (en) | Privacy intersection method and device and readable storage medium | |
| CN113315631B (en) | Data processing method and device and data processing device | |
| CN114301594B (en) | Inadvertent transmission method, multi-party secure computing platform and device for inadvertent transmission | |
| CN112667674B (en) | Data processing method and device and data processing device | |
| CN107579952A (en) | File transmitting method, message processing method and system and storage medium | |
| CN112003696A (en) | SM9 key generation method, system, electronic equipment, device and storage medium | |
| CN114840568B (en) | Ciphertext sorting method and device and ciphertext sorting device | |
| CN112487415B (en) | Method and device for detecting security of computing task | |
| CN113868505A (en) | Data processing method and device, electronic equipment, server and storage medium | |
| CN117319086B (en) | System, method, electronic device and storage medium for inadvertent transmission | |
| CN114666048A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN112163046A (en) | Block chain-based equipment data storage method, device and system | |
| CN115134081B (en) | Data association information verification method, device, equipment and storage medium | |
| CN112464257A (en) | Data detection method and device for data detection | |
| CN114885038B (en) | Encryption protocol conversion method, result acquisition node and privacy calculation node | |
| CN114584284B (en) | Homomorphic encryption operation method and device and electronic equipment | |
| CN115996140A (en) | Access content acquisition method, device, equipment and storage medium | |
| CN117155570B (en) | Ciphertext replacement method, storage medium and electronic device | |
| CN112580064A (en) | Data processing method and device and data processing device | |
| CN112214751A (en) | Verification code generation method and device | |
| CN112685765B (en) | Data quality evaluation method and device for data quality evaluation | |
| CN112016928B (en) | Payment method and device and payment device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |