CN110399735A - Encryption data size relation method of proof, device, equipment and storage medium - Google Patents
Encryption data size relation method of proof, device, equipment and storage medium Download PDFInfo
- Publication number
- CN110399735A CN110399735A CN201910542027.6A CN201910542027A CN110399735A CN 110399735 A CN110399735 A CN 110399735A CN 201910542027 A CN201910542027 A CN 201910542027A CN 110399735 A CN110399735 A CN 110399735A
- Authority
- CN
- China
- Prior art keywords
- data
- size relation
- encryption
- signature
- proof
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 50
- 238000003860 storage Methods 0.000 title claims abstract description 16
- 238000001629 sign test Methods 0.000 claims abstract description 68
- 238000012545 processing Methods 0.000 claims description 11
- 238000007781 pre-processing Methods 0.000 claims description 6
- 238000012795 verification Methods 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 13
- 241001269238 Data Species 0.000 description 9
- 238000004891 communication Methods 0.000 description 8
- 230000007613 environmental effect Effects 0.000 description 4
- 238000012360 testing method Methods 0.000 description 2
- 241000208340 Araliaceae Species 0.000 description 1
- 235000005035 Panax pseudoginseng ssp. pseudoginseng Nutrition 0.000 description 1
- 235000003140 Panax quinquefolius Nutrition 0.000 description 1
- 239000004744 fabric Substances 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 235000008434 ginseng Nutrition 0.000 description 1
- PCHJSUWPFVWCPO-UHFFFAOYSA-N gold Chemical compound [Au] PCHJSUWPFVWCPO-UHFFFAOYSA-N 0.000 description 1
- 239000010931 gold Substances 0.000 description 1
- 229910052737 gold Inorganic materials 0.000 description 1
- 229910001385 heavy metal Inorganic materials 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 238000002844 melting Methods 0.000 description 1
- 230000008018 melting Effects 0.000 description 1
- 238000011144 upstream manufacturing Methods 0.000 description 1
- 238000003466 welding Methods 0.000 description 1
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
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Storage Device Security (AREA)
Abstract
The present invention relates to block chain technical fields, disclose a kind of encryption data size relation method of proof, comprising the following steps: encrypt respectively to clear data a, b, obtain corresponding ciphertext data A, B, A=a*G+x1*H, B=b*G+x2*H；Calculate separately parameter message, c, y, wherein message=hash (string (A)+string (B)), c=a-b-1, y=x1-x2；It is input parameter with message, c, y, is signed by RangeProof algorithm to input parameter, generate signature signature；It is greater than or equal to 0 proof using signature as clear data c, signature, ciphertext data A and B are published on block chain, so that data requirements side carries out sign test by RangeProof algorithm, and the size relation of clear data a and b is determined based on sign test result.The invention also discloses a kind of encryption data size relations to prove device, equipment and computer readable storage medium.The present invention is guaranteeing data-privacy and while safety, realizes the size relation that clear data is corresponded to based on ciphertext data judging, the perfect manner of comparison of encryption data size relation.
Description
Technical field
The present invention relates to block chain technical field more particularly to a kind of encryption data size relation method of proof, device, set
Standby and computer readable storage medium.
Background technique
In block chain, since all data are all encryption storages, thus many troubles are also brought.Such as In
In actual business case, has and largely need to compare the scene that two encryption amount of money are greater than the relationship of being less than, such as: in supply chain gold
In melting, the order that core enterprise can be used in the manufacturer of upstream carries out loan application, and after bank receives application, it is necessary to energy
The loan application amount of money for enough judging manufacturer, less than the total amount of its order；For another example: in the environmental protection tests project of block chain
In, the environmental index (such as the heavy metals content discharged) that relevant enterprise needs to show oneself to Environmental Protection Agency is less than environmental protection
The index of office's definition.
The method of traditional two encryption data size relations of verifying is known by providing the zero of two encryption data differences
Know it is bright come indirect proof correspond to size relation between clear data, but traditional mode of proof can only prove two encryption datas
Being more than or equal between corresponding clear data is less than or equal to relationship, and can not directly prove the relationship of being more than or less than.
Summary of the invention
The main purpose of the present invention is to provide a kind of encryption data size relation method of proof, device, equipment and calculating
Machine readable storage medium storing program for executing, it is intended to which solving traditional mode of proof can not directly prove to be more than or less than relationship between two encryption datas
The technical issues of.
To achieve the above object, the present invention provides a kind of encryption data size relation method of proof, and the encryption data is big
Small relationship method of proof the following steps are included:
Clear data a, b are encrypted respectively, obtain corresponding ciphertext data A, B, wherein A=a*G+x1*H, B=b*G
+ x2*H, G, H indicate two points of the difference on the same elliptic curve, and a, b are positive integer, x1 and x2 indicate the blind factor and for
Machine number；
Calculate separately parameter message, c, y, wherein message=hash (string (A)+string (B)), parameter c
For plaintext and c=a-b-1, y=x1-x2；
It is input parameter with message, c, y, is signed by RangeProof algorithm to input parameter, generate signature
signature；
It is greater than or equal to 0 proof using signature as clear data c, signature, ciphertext data A and B is sent out
On cloth to block chain, so that data requirements side carries out sign test by RangeProof algorithm, and determined in plain text based on sign test result
The size relation of data a and b.
Optionally, the encryption data size relation method of proof further include:
Obtain the card of ciphertext data A, B and clear data c more than or equal to 0 that data providing is published on block chain
Bright signature；
Calculate separately parameter message, C, wherein message=hash (string (A)+string (B)), C=(A-
B-G)=(a-b-1) * G+ (x1-x2) * H=c*G+y*H, C is the ciphertext data of clear data c；
It is input parameter with message, C, signature, sign test is carried out to input parameter by RangeProof algorithm,
Obtain sign test result；
Based on sign test as a result, determining the size relation of clear data a and b, wherein if sign test result is to prove very,
Determine that clear data a is greater than b.
Optionally, before the step of being encrypted respectively to clear data a, b described, obtaining corresponding ciphertext data A, B,
Further include:
Obtain the original plaintext data for carrying out encryption data size relation proof；
Judge whether original plaintext data are positive integer；
If so, using original plaintext data as clear data a, b；
If it is not, then carrying out the processing of decimal point fixed point to original plaintext data, the clear data of positive integer is obtained, and will just
The clear data of integer is as clear data a, b.
Optionally, the original plaintext data obtained for carrying out encryption data size relation proof the step of it
Before, further includes:
Obtain original plaintext data n, h, the k for being subordinate to numberical range verifying for carrying out encryption data, wherein to be verified
Inequality relation is h < n < k；
Based on the size relation between numerical value n and numerical value h, k, inequality relation to be verified is split as n > h, k > n,
For carrying out the verifying of encryption data size relation to the corresponding encryption data of n, h and the corresponding encryption data of n, k respectively.
Further, to achieve the above object, the present invention also provides a kind of encryption data size relations to prove device, described
Encryption data size relation proves that device includes:
Encrypting module obtains corresponding ciphertext data A, B, wherein A=a* for encrypting respectively to clear data a, b
G+x1*H, B=b*G+x2*H, G, H indicate that two points of the difference on the same elliptic curve, a, b are positive integer, and x1 and x2 are indicated
The blind factor and be random number；
First parameter calculating module, for calculating separately parameter message, c, y, wherein message=hash
(string (A)+string (B)), parameter c are plaintext and c=a-b-1, y=x1-x2；
Signature generation module, for being input parameter with message, c, y, by RangeProof algorithm to input parameter
It signs, generates signature signature；
Release module, for being greater than or equal to 0 proof using signature as clear data c, by signature, close
Literary data A and B are published on block chain, so that data requirements side carries out sign test by RangeProof algorithm, and are based on sign test
As a result the size relation of clear data a and b are determined.
Optionally, the encryption data size relation proves device further include:
First obtains module, for obtaining ciphertext data A, B and plaintext number that data providing is published on block chain
It is greater than or equal to 0 proof signature according to c；
Second parameter calculating module, for calculating separately parameter message, C, wherein message=hash (string
(A)+string (B)), C=(A-B-G)=(a-b-1) * G+ (x1-x2) * H=c*G+y*H, C is the ciphertext number of clear data c
According to；
Signature verification module passes through RangeProof algorithm pair for being input parameter with message, C, signature
It inputs parameter and carries out sign test, obtain sign test result；Based on sign test as a result, determining the size relation of clear data a and b, wherein if
Sign test result is to prove very, then determines that clear data a is greater than b.
Optionally, the encryption data size relation proves device further include:
Second obtains module, for obtaining the original plaintext data for carrying out encryption data size relation proof；
Judgment module, for judging whether original plaintext data are positive integer；
First preprocessing module, if being positive integer for original plaintext data, using original plaintext data as plaintext number
According to a, b；If original plaintext data are non-positive integer, the processing of decimal point fixed point is carried out to original plaintext data, is obtained just whole
Several clear datas, and using the clear data of positive integer as clear data a, b.
Optionally, the encryption data size relation proves device further include:
Third obtain module, for obtains for carry out encryption data be subordinate to numberical range verify original plaintext data n,
H, k, wherein inequality relation to be verified is h < n < k；
Second preprocessing module, for based on the size relation between numerical value n and numerical value h, k, by inequality to be verified
Relationship is split as n > h, k > n, for encrypting respectively to the corresponding encryption data of n, h and the corresponding encryption data of n, k
The verifying of size of data relationship.
Further, to achieve the above object, the present invention also provides a kind of encryption data size relations to prove equipment, described
Encryption data size relation proves that equipment includes memory, processor and is stored on the memory and can be in the processing
The encryption data size relation prover run on device, the encryption data size relation prover are held by the processor
The step of encryption data size relation method of proof as described in any one of the above embodiments is realized when row.
Further, to achieve the above object, the present invention also provides a kind of computer readable storage medium, the computers
Encryption data size relation prover is stored on readable storage medium storing program for executing, the encryption data size relation prover is located
The step of reason device realizes encryption data size relation method of proof as described in any one of the above embodiments when executing.
In the present invention, it is assumed that the clear data for needing to carry out size relation comparison is a and b, and corresponding ciphertext data are A
And B, by calculating c=(a-b-1) and generating signature signature relevant to A, B, c by RangeProof algorithm, then
Signature, A and B are supplied to data requirements side and carry out sign test, if sign test passes through, illustrates that c is one and is more than or equal to 0
Number, that is to say, that: a-b-1 >=0 namely a-b >=1 > 0.The present invention submits to data requirements side by block chain node
Three parameters are ciphertext data A, B and signature signature, namely provide ciphertext data A, the B ginseng of clear data a, b
With the operation of size relation, because of the occurrence without revealing clear data a, b, therefore data-privacy safety ensure that
Meanwhile judgement to size relation between ciphertext data is realized, the manner of comparison of size relation between perfect encryption data.
Detailed description of the invention
Fig. 1 is the device hardware running environment that encryption data size relation of the present invention proves that apparatus embodiments scheme is related to
Structural schematic diagram；
Fig. 2 is the flow diagram of encryption data size relation method of proof first embodiment of the present invention；
Fig. 3 is the flow diagram of encryption data size relation method of proof second embodiment of the present invention；
Fig. 4 is the flow diagram of encryption data size relation method of proof 3rd embodiment of the present invention；
Fig. 5 is the functional block diagram that encryption data size relation of the present invention proves device first embodiment；
Fig. 6 is the functional block diagram that encryption data size relation of the present invention proves device second embodiment；
Fig. 7 is the functional block diagram that encryption data size relation of the present invention proves device 3rd embodiment；
Fig. 8 is the functional block diagram that encryption data size relation of the present invention proves device fourth embodiment.
The embodiments will be further described with reference to the accompanying drawings for the realization, the function and the advantages of the object of the present invention.
Specific embodiment
It should be appreciated that described herein, specific examples are only used to explain the present invention, is not intended to limit the present invention.
The present invention provides a kind of encryption data size relation proof equipment.
Referring to Fig.1, Fig. 1 is the device hardware fortune that encryption data size relation of the present invention proves that apparatus embodiments scheme is related to
The structural schematic diagram of row environment.
As shown in Figure 1, the encryption data size relation proves that equipment may include: processor 1001, such as CPU, communication
Bus 1002, user interface 1003, network interface 1004, memory 1005.Wherein, communication bus 1002 is for realizing these groups
Connection communication between part.User interface 1003 may include display screen (Display), input unit such as keyboard
(Keyboard), optional user interface 1003 can also include standard wireline interface and wireless interface.Network interface 1004 is optional
May include standard wireline interface and wireless interface (such as WI-FI interface).Memory 1005 can be high speed RAM memory,
It is also possible to stable memory (non-volatile memory), such as magnetic disk storage.Memory 1005 optionally may be used also
To be independently of the storage equipment of aforementioned processor 1001.
It will be understood by those skilled in the art that encryption data size relation shown in Fig. 1 proves the hardware configuration of equipment
The restriction for proving encryption data size relation equipment is not constituted, may include components more more or fewer than diagram, or
Combine certain components or different component layouts.
As shown in Figure 1, as may include operating system, net in a kind of memory 1005 of computer readable storage medium
Network communication module, Subscriber Interface Module SIM and encryption data size relation prover.Wherein, operating system is to manage and control
Encryption data size relation proves the program of equipment and software resource, supports network communication module, Subscriber Interface Module SIM, encryption number
According to the operation of size relation prover and other programs or software；Network communication module is for managing and controlling network interface
1004；Subscriber Interface Module SIM is for managing and controlling user interface 1003.
Encryption data size relation shown in Fig. 1 proves in device hardware structure that network interface 1004 is mainly used for connecting
Welding system backstage carries out data communication with system background；User interface 1003 is mainly used for connecting client (user terminal), with visitor
Family end carries out data communication；Encryption data size relation proves that equipment is called in memory 1005 by processor 1001 and stores
Encryption data size relation prover, and execute the operation of each embodiment of following encryption data size relation method of proof.
Device hardware structure is proved based on above-mentioned encryption data size relation, proposes encryption data size relation card of the present invention
Each embodiment of bright method.
It is the flow diagram of encryption data size relation method of proof first embodiment of the present invention referring to Fig. 2, Fig. 2.This
In embodiment, the encryption data size relation method of proof the following steps are included:
Step S110 respectively encrypts clear data a, b, obtains corresponding ciphertext data A, B, wherein A=a*G+
X1*H, B=b*G+x2*H, G, H indicate that two points of the difference on the same elliptic curve, a, b are positive integer, and x1 and x2 indicate blind
The factor and be random number；
In certain application scenarios, to guarantee the Information Security in data exchange process, it usually needs to clear data
It is encrypted, and encryption data cannot directly carry out size comparison.In the present embodiment, for convenient for encrypted ciphertext number
According to size comparison is carried out, it is therefore preferable that being encrypted based on elliptic curve encryption algorithm to clear data.For purposes of illustration only, this
Arbitrary two clear datas are indicated using a, b in embodiment, indicate two ciphertext data corresponding with a, b using A, B.
The size relation of clear data a and b both may be a > b, it is also possible to which b > a is to prove a > b, or prove b
> a, this is needed depending on the certification requirement of concrete application scene.Further, since a, b indicate arbitrary two clear datas,
Therefore, the method for proving a > b is given that is, giving the method for proving b > a.
Clear data a and b use ECC elliptic curve cryptography using the Perdesen Commitment format in cryptography
Algorithm is encrypted, and A=a*G+x1*H, B=b*G+x2*H are obtained, wherein G, H are the difference two of the same elliptic curve respectively
A, x1 and x2 indicate the blind factor and are random number, for guaranteeing that A and B are not cracked.
Step S120 calculates separately parameter message, c, y, wherein message=hash (string (A)+string
(B)), parameter c is plaintext and c=a-b-1, y=x1-x2；
In the present embodiment, if desired prove a > b, then need to only prove a-1 >=b namely a-b >=1 > 0, a-b-1 >
=0.Therefore, parameter c is introduced in the present embodiment, the proof of clear data a > b is converted to prove c >=0, namely need to provide
C is greater than or equal to 0 proof.
Therefore, before generating proof of the c more than or equal to 0, parameter message, c, y are calculated separately, wherein
Message indicates that the medium of RangeProof algorithm, particular content are message=hash (string (A)+string (B)),
Namely message is to carry out Hash operation cryptographic Hash generated to the character string of concatenated ciphertext data A and B.Message is
It is specific to be used to prevent from generating the artificial vacation proved for the message of signature, therefore message needs and participates in the data phase of operation
It closes.
Step S130 is input parameter with message, c, y, is signed by RangeProof algorithm to input parameter
Name generates signature signature；
In the present embodiment, to guarantee the safety of data, therefore encryption number is preferably realized by the way of zero-knowledge proof
According to the verifying of size relation.It is preferred that realizing zero-knowledge proof using RangeProof algorithm.For example, it is assumed that there is ciphertext A=a*G+
If desired x1*H provides the clear data a proof for being greater than or equal to 0, but cannot expose the value of a again simultaneously, then can be used
RangeProof algorithm can complete this work.
It is input parameter with message, c, y in the present embodiment, input parameter is signed by RangeProof algorithm
Name, and then export signature signature.Wherein, signature indicates the proof of " clear data c is greater than or equal to 0 ".
Step S140 is greater than or equal to 0 proof using signature as clear data c, by signature, ciphertext number
It is published on block chain according to A and B, so that data requirements side carries out sign test by RangeProof algorithm, and is based on sign test result
Determine the size relation of clear data a and b.
In the present embodiment, the signature to be signed by RangeProof algorithm is greater than as clear data c or
Signature is also submitted to data requirements while encryption data A, B is submitted to data requirements side by the proof equal to 0
Side, and then sign test is carried out to signature by data requirements side, and determine that the size of clear data a and b are closed based on sign test result
System.
In the present embodiment, data providing and data requirements side are all block chain nodes, and a block chain node both can be with
It is individually data providing or data requirements side, can also is data providing and data requirements side simultaneously.It is published to block chain
On data only after the sign test of other nodes on block chain, could be written in block chain or carry out at block chain business
Reason.
In the present embodiment, it is assumed that the clear data for needing to carry out size relation comparison is a and b, corresponding ciphertext data
For A and B, signature signature relevant to A, B, c is generated by calculating c=(a-b-1) and passing through RangeProof algorithm,
Then by signature, A and B be supplied to data requirements side carry out sign test, if sign test passes through, illustrate c >=0, that is,
Say a-b-1 >=0 namely a-b >=1 > 0.Specific implementation of the present embodiment for data requirements side to the sign test of signature
Journey is unlimited.
The present embodiment is ciphertext data A, B and signature by three parameters that block chain node submits to data requirements side
Signature, namely ciphertext data A, B of clear data a, b are provided to participate in the operation of size of data relationship, thus do not have
Have the occurrence of leakage clear data a, b, therefore while ensure that data-privacy safety, realize to ciphertext data it
Between size relation judgement, the manner of comparison of size relation between perfect encryption data.
It is the flow diagram of encryption data size relation method of proof second embodiment of the present invention referring to Fig. 3, Fig. 3.This
In embodiment, the encryption data size relation method of proof further include:
Step S210, obtain ciphertext data A, B that are published on block chain of data providing and clear data c be greater than or
Proof signature equal to 0；
In the present embodiment, node on block chain works as block either data providing, is also possible to data requirements side
When chain node is as data requirements side, the data being published on block chain to data providing is needed to carry out sign test.
In the present embodiment, data requirements side be specifically based on ciphertext data A, B that data providing is published on block chain with
And clear data c is greater than or equal to 0 proof signature, whether verifying signature signature is true.
Step S220, calculates separately parameter message, C, wherein message=hash (string (A)+string
(B)), C=(A-B-G)=(a-b-1) * G+ (x1-x2) * H=c*G+y*H, C is the ciphertext data of clear data c；
In the present embodiment, for convenient for signature progress sign test, it is therefore desirable to construct corresponding with clear data c
Ciphertext data C, C=(A-B-G)=(a-b-1) * G+ (x1-x2) * H=c*G+y*H.Each node uses identical ellipse on block chain
Circular curve Encryption Algorithm, encryption data C are encrypted using elliptic curve encryption algorithm identical with encryption data A, B, and
The message that data requirements side uses is identical as the message that data processing side uses.
Step S230 is input parameter with message, C, signature, by RangeProof algorithm to input parameter
Sign test is carried out, sign test result is obtained；
Step S240, based on sign test as a result, determining the size relation of clear data a and b, wherein if sign test result is as evidence
Bright is very, then to determine that clear data a is greater than b.
In the present embodiment, using RangeProof algorithm to signature carry out sign test, input parameter be message, C,
Signature, output result are true/false (being proved to be true or false), if sign test result is to prove very,
Determine that clear data a is greater than b, if sign test result is falsification, can not determine the size relation of clear data a and b.
In the present embodiment, sign test is carried out to signature signature by RangeProof algorithm, if sign test passes through,
Illustrate c >=0, that is to say, that a-b-1 >=0 namely a-b >=1 > 0, and then clear data a can be directly determined greater than b.
RangeProof algorithm is a kind of zero-knowledge proof algorithm, of the invention for ease of understanding, below to RangeProof
The specific implementation process of algorithm is illustrated:
(1) RangeProof signature process:
Input: message, a, x；
Output: sig；
It is convenient for statement, it selects a=(100000000)10=(0011331132010000)4To be illustrated.
Step 1: indicating a with 4 systems, so a mono- shares 16, be denoted as: a=(a15a14a13....a1a0)4=
(0011331132010000)4；
Step 2: successively to a15To a016 numbers are handled respectively in total；
Below with a13For be illustrated:
a13Have 4 kinds may: 0 × 413, 1 × 413, 2 × 413, 3 × 413It (can calculate: 413=67108864)；Wherein 1 ×
413It is only true data；Then this four several public private key pairs are constructed, method is:
Step 2.1: it calculates:
C2=1 × 67108864G+x2H
Step 2.2: it calculates:
C20=C2- 0G=x2H+413G；
C21=C2- 67108864G=x2G；
C22=C2- 134217728G=x2G-413G；
C23=C2- 201326592G=x2G -2*413G；
0 × 4 is constructed by step 2.213, 1 × 413, 2 × 413, 3 × 413This 4 several public private key pairs are respectively: (,
C20), (x2, C21), (, C22), (, C23)。
Illustrate: public private key pair format are as follows: (private key, public key), wherein private key uses expression is because private key nobody knows
Road, because H=xG, x indicate the blind factor and be any random number.
Step 2.3: it calculates:
Utilize (, C20), (x2, C21), (, C22), (, C23) to 0 × 413, 1 × 413, 2 × 413, 3 × 413This 4 numbers are done
Ring signatures, therefore utilize C20, x2, C22, C23Ring signatures are carried out, s2 is obtained
Illustrate: ring signatures meet such a property: for above, it is assumed that have 4 people in member's group, if member's group
In someone the private key (being assumed to be x2) of oneself is provided, and combine other people public key C20, C22, C23, can be generated and be signed with operation
Name Sig, and any one other people, as long as taking public key C20, C21, C22, C23, so that it may verify this Sig must be by this 4
Any one of individual people signs, but this people is who can not then know.
Step 2.4: similarly referring to step 2.1-2.4, same treatment is carried out to other all numbers respectively, is finally obtained:
C0, C1..., C15,
And: s0, s1 ..., s15；
Wherein, C=C0+C1+C2+...+C15；
Similarly, for blind factor x, also have: x=x1+x2+ ...+x15；
Finally by C0, C1... C14, s0, s1 ..., s15 are all exported included together as Sig.
(2) RangeProof verifies signature process:
Input: message, C, Sig；Wherein C=a*G+x*H；
Output: true or false；
Step 1:
Calculate C15=C-C0+C1+C2+...+C14；
Step 2.1: equally with a13For be illustrated:
a13Have 4 kinds may: 0 × 413, 1 × 413, 2 × 413, 3 × 413；
It calculates:
C20=C2- 0G=x2H+413G；
C21=C2- 67108864G=x2G；
C22=C2- 134217728G=x2G-413G；
C23=C2- 201326592G=x2G -2*413G；
Step 2.2: verifying ring signatures；
Use C20, C21,C22, C23Ring signatures sign test is carried out to s2, if sign test fails, returns to failure；
Step 2.3: and so on, sign test is all carried out to 16 numbers, all by then returning to true, if there is any one
A failure, then return to false.
Illustrate: RangeProof algorithm ensure that several a must be (a15a14a13....a1a0)4Such form, and then
It connects and ensure that this number must be 416Within the scope of, that is, 232Within the scope of.It therefore, can by RangeProof algorithm
It verifies number a and is greater than or equal to 0.
It is the flow diagram of encryption data size relation method of proof 3rd embodiment of the present invention referring to Fig. 4, Fig. 4.Base
In above method first embodiment, the present embodiment, before above-mentioned steps S110, further includes:
Step S10 obtains the original plaintext data for carrying out encryption data size relation proof；
Step S20 judges whether original plaintext data are positive integer；
Step S30, if so, using original plaintext data as clear data a, b；
Step S40 obtains the plaintext number of positive integer if it is not, then carrying out the processing of decimal point fixed point to original plaintext data
According to, and using the clear data of positive integer as clear data a, b.
In the present embodiment, when determining that the size relation between corresponding clear data is verified according to encryption data, due to being
Proofs by clear data a greater than b is converted to a-b >=1 > 0 proof, it is therefore desirable to guarantee clear data be all positive integer (times
1) difference between positive integer of anticipating is greater than or equal to.
Therefore, before encrypting to clear data, first judge whether original plaintext data are decimal, if so, right
Original plaintext data carry out the processing of decimal point fixed point, so that decimal is converted into integer.For example, clear data a=1.01, b
=2, then a and b are simultaneously amplified 100 times, a=101, b=200, to guarantee the clear data for generating ciphertext data A, B
A and b is integer.
Further, in one embodiment of encryption data size relation method of proof of the present invention, it may also be used for encrypted
The verifying of data membership numberical range, verification method specifically include:
(1) original plaintext data n, h, the k for being subordinate to numberical range verifying for carrying out encryption data are obtained, wherein to be tested
The inequality relation of card is h < n < k；
(2) based on the size relation between numerical value n and numerical value h, k, inequality relation to be verified is split as n > h, k
> n；
(3) by the way of in the first and second embodiment of the above method, respectively to the corresponding encryption data of n, h and n, k couple
The encryption data answered carries out the verifying of encryption data size relation, obtains the size relation of n and h, the size relation of n and k；
(4) size relation of size relation, n and k based on n and h, it is final to determine whether inequality relation h < n < k is true.
In the present embodiment, when progress encryption data is subordinate to numberical range verifying, some data membership can be will demonstrate that in one
It is converted in a numberical range and the data is subjected to size relation verifying with two endpoints of numberical range respectively, namely provided
(n-a) > 0 and the proof of (b-n) > 0, i.e., provable n are under the jurisdiction of between (a, b).
The verifying of the mathematical relationship of different data is split as the verifying of the size relation between multipair data by the present embodiment, because
And the application scenarios that different encryption datas are carried out with size relation verifying are further expanded.
The present invention also provides a kind of encryption data size relations to prove device.
It is the functional module signal that encryption data size relation of the present invention proves device first embodiment referring to Fig. 5, Fig. 5
Figure.In the present embodiment, the encryption data size relation proves that device includes:
Encrypting module 10 obtains corresponding ciphertext data A, B, wherein A=for encrypting respectively to clear data a, b
A*G+x1*H, B=b*G+x2*H, G, H indicate that two points of the difference on the same elliptic curve, a, b are positive integer, x1 and x2 table
Show the blind factor and is random number；
In certain application scenarios, to guarantee the Information Security in data exchange process, it usually needs to clear data
It is encrypted, and encryption data cannot directly carry out size comparison.In the present embodiment, for convenient for encrypted ciphertext number
According to size comparison is carried out, it is therefore preferable that being encrypted based on elliptic curve encryption algorithm to clear data.For purposes of illustration only, this
Arbitrary two clear datas are indicated using a, b in embodiment, indicate two ciphertext data corresponding with a, b using A, B.
The size relation of clear data a and b both may be a > b, it is also possible to which b > a is to prove a > b, or prove b
> a, this is needed depending on the certification requirement of concrete application scene.Further, since a, b indicate arbitrary two clear datas,
Therefore, the method for proving a > b is given that is, giving the method for proving b > a.
Clear data a and b use ECC elliptic curve cryptography using the Perdesen Commitment format in cryptography
Algorithm is encrypted, and A=a*G+x1*H, B=b*G+x2*H are obtained, wherein G, H are the difference two of the same elliptic curve respectively
A, x1 and x2 indicate the blind factor and are random number, for guaranteeing that A and B are not cracked.
First parameter calculating module 20, for calculating separately parameter message, c, y, wherein message=hash
(string (A)+string (B)), parameter c are plaintext and c=a-b-1, y=x1-x2；
In the present embodiment, if desired prove a > b, then need to only prove a-1 >=b namely a-b >=1 > 0, a-b-1 >
=0.Therefore, parameter c is introduced in the present embodiment, the proof of clear data a > b is converted to prove c >=0, namely need to provide
C is greater than or equal to 0 proof.
Therefore, before generating proof of the c more than or equal to 0, parameter message, c, y are calculated separately, wherein
Message indicates that the medium of RangeProof algorithm, particular content are message=hash (string (A)+string (B)),
Namely message is to carry out Hash operation cryptographic Hash generated to the character string of concatenated ciphertext data A and B.Message is
It is specific to be used to prevent from generating the artificial vacation proved for the message of signature, therefore message needs and participates in the data phase of operation
It closes.
Signature generation module 30 joins input by RangeProof algorithm for being input parameter with message, c, y
Number is signed, and signature signature is generated；
In the present embodiment, to guarantee the safety of data, therefore encryption number is preferably realized by the way of zero-knowledge proof
According to the verifying of size relation.It is preferred that realizing zero-knowledge proof using RangeProof algorithm.For example, it is assumed that there is ciphertext A=a*G+
If desired x1*H provides the clear data a proof for being greater than or equal to 0, but cannot expose the value of a again simultaneously, then can be used
RangeProof algorithm can complete this work.
It is input parameter with message, c, y in the present embodiment, input parameter is signed by RangeProof algorithm
Name, and then export signature signature.Wherein, signature indicates the proof of " clear data c is greater than or equal to 0 ".
Release module 40, for using signature as clear data c be greater than or equal to 0 proof, by signature,
Ciphertext data A and B are published on block chain, so that data requirements side carries out sign test by RangeProof algorithm, and are based on testing
Label result determines the size relation of clear data a and b.
In the present embodiment, the signature to be signed by RangeProof algorithm is greater than as clear data c or
Signature is also submitted to data requirements while encryption data A, B is submitted to data requirements side by the proof equal to 0
Side, and then sign test is carried out to signature by data requirements side, and determine that the size of clear data a and b are closed based on sign test result
System.
In the present embodiment, data providing and data requirements side are all block chain nodes, and a block chain node both can be with
It is individually data providing or data requirements side, can also is data providing and data requirements side simultaneously.It is published to block chain
On data only after the sign test of other nodes on block chain, could be written in block chain or carry out at block chain business
Reason.
In the present embodiment, it is assumed that the clear data for needing to carry out size relation comparison is a and b, corresponding ciphertext data
For A and B, signature signature relevant to A, B, c is generated by calculating c=(a-b-1) and passing through RangeProof algorithm,
Then by signature, A and B be supplied to data requirements side carry out sign test, if sign test passes through, illustrate c >=0, that is,
Say a-b-1 >=0 namely a-b >=1 > 0.Specific implementation of the present embodiment for data requirements side to the sign test of signature
Journey is unlimited.
The present embodiment is ciphertext data A, B and signature by three parameters that block chain node submits to data requirements side
Signature, namely ciphertext data A, B of clear data a, b are provided to participate in the operation of size of data relationship, thus do not have
Have the occurrence of leakage clear data a, b, therefore while ensure that data-privacy safety, realize to ciphertext data it
Between size relation judgement, the manner of comparison of size relation between perfect encryption data.
It is the functional module signal that encryption data size relation of the present invention proves device second embodiment referring to Fig. 6, Fig. 6
Figure.In the present embodiment, the encryption data size relation proves device further include:
First obtains module 50, for obtaining ciphertext data A, B and plaintext that data providing is published on block chain
Data c is greater than or equal to 0 proof signature；
In the present embodiment, node on block chain works as block either data providing, is also possible to data requirements side
When chain node is as data requirements side, the data being published on block chain to data providing is needed to carry out sign test.
In the present embodiment, data requirements side be specifically based on ciphertext data A, B that data providing is published on block chain with
And clear data c is greater than or equal to 0 proof signature, whether verifying signature signature is true.
Second parameter calculating module 60, for calculating separately parameter message, C, wherein message=hash
(string (A)+string (B)), C=(A-B-G)=(a-b-1) * G+ (x1-x2) * H=c*G+y*H, C is clear data c's
Ciphertext data；
In the present embodiment, for convenient for signature progress sign test, it is therefore desirable to construct corresponding with clear data c
Ciphertext data C, C=(A-B-G)=(a-b-1) * G+ (x1-x2) * H=c*G+y*H.Each node uses identical ellipse on block chain
Circular curve Encryption Algorithm, encryption data C are encrypted using elliptic curve encryption algorithm identical with encryption data A, B, and
The message that data requirements side uses is identical as the message that data processing side uses.
Signature verification module 70 passes through RangeProof algorithm for being input parameter with message, C, signature
Sign test is carried out to input parameter, obtains sign test result；Based on sign test as a result, determining the size relation of clear data a and b, wherein
If sign test result is to prove very, determine that clear data a is greater than b.
In the present embodiment, using RangeProof algorithm to signature carry out sign test, input parameter be message, C,
Signature, output result are true/false (being proved to be true or false), if sign test result is to prove very,
Determine that clear data a is greater than b, if sign test result is falsification, can not determine the size relation of clear data a and b.
In the present embodiment, sign test is carried out to signature signature by RangeProof algorithm, if sign test passes through,
Illustrate c >=0, that is to say, that a-b-1 >=0 namely a-b >=1 > 0, and then clear data a can be directly determined greater than b.
It is the functional module signal that encryption data size relation of the present invention proves device 3rd embodiment referring to Fig. 7, Fig. 7
Figure.In the present embodiment, the encryption data size relation proves device further include:
Second obtains module 80, for obtaining the original plaintext data for carrying out encryption data size relation proof；
Judgment module 90, for judging whether original plaintext data are positive integer；
First preprocessing module 100, if being positive integer for original plaintext data, using original plaintext data as in plain text
Data a, b；If original plaintext data are non-positive integer, the processing of decimal point fixed point is carried out to original plaintext data, is obtained just
The clear data of integer, and using the clear data of positive integer as clear data a, b.
In the present embodiment, when determining that the size relation between corresponding clear data is verified according to encryption data, due to being
Proofs by clear data a greater than b is converted to a-b >=1 > 0 proof, it is therefore desirable to guarantee clear data be all positive integer (times
1) difference between positive integer of anticipating is greater than or equal to.
Therefore, before encrypting to clear data, first judge whether original plaintext data are decimal, if so, right
Original plaintext data carry out the processing of decimal point fixed point, so that decimal is converted into integer.For example, clear data a=1.01, b
=2, then a and b are simultaneously amplified 100 times, a=101, b=200, to guarantee the clear data for generating ciphertext data A, B
A and b is integer.
It is the functional module signal that encryption data size relation of the present invention proves device fourth embodiment referring to Fig. 8, Fig. 8
Figure.In the present embodiment, the encryption data size relation proves device further include:
Third obtains module 110, for obtaining the original plaintext number for being subordinate to numberical range verifying for carrying out encryption data
According to n, h, k, wherein inequality relation to be verified is h < n < k；
Second preprocessing module 120, for based on the size relation between numerical value n and numerical value h, k, to be verified to be differed
Formula relationship is split as n > h, k > n, for adding respectively to the corresponding encryption data of n, h and the corresponding encryption data of n, k
The verifying of ciphertext data size relation.
In the present embodiment, when progress encryption data is subordinate to numberical range verifying, some data membership can be will demonstrate that in one
It is converted in a numberical range and the data is subjected to size relation verifying with two endpoints of numberical range respectively, namely provided
(n-a) > 0 and the proof of (b-n) > 0, i.e., provable n are under the jurisdiction of between (a, b).
The verifying of the mathematical relationship of different data is split as the verifying of the size relation between multipair data by the present embodiment, because
And the application scenarios that different encryption datas are carried out with size relation verifying are further expanded.
The present invention also provides a kind of computer readable storage mediums.
In the present embodiment, encryption data size relation prover, institute are stored on the computer readable storage medium
Realization when encryption data size relation prover is executed by processor is stated to add as described in any of the above-described embodiment of the method
The step of ciphertext data size relation method of proof.Wherein, encryption data size relation prover is executed by processor Shi Suoshi
Existing method can refer to each embodiment of encryption data size relation method of proof of the present invention, therefore no longer excessively repeat.
Through the above description of the embodiments, those skilled in the art can be understood that above-described embodiment side
Method can be realized by means of software and necessary general hardware platform, naturally it is also possible to by hardware, but in many cases
The former is more preferably embodiment.Based on this understanding, technical solution of the present invention substantially in other words does the prior art
The part contributed out can be embodied in the form of software products, which is stored in a storage medium
In (such as ROM/RAM), including some instructions are used so that a terminal (can be mobile phone, computer, server or network are set
It is standby etc.) execute method described in each embodiment of the present invention.
The embodiment of the present invention is described with above attached drawing, but the invention is not limited to above-mentioned specific
Embodiment, the above mentioned embodiment is only schematical, rather than restrictive, those skilled in the art
Under the inspiration of the present invention, without breaking away from the scope protected by the purposes and claims of the present invention, it can also make very much
Form, it is all using equivalent structure or equivalent flow shift made by description of the invention and accompanying drawing content, directly or indirectly
Other related technical areas are used in, all of these belong to the protection of the present invention.
Claims (10)
1. a kind of encryption data size relation method of proof, which is characterized in that the encryption data size relation method of proof packet
Include following steps:
Clear data a, b are encrypted respectively, obtain corresponding ciphertext data A, B, wherein A=a*G+x1*H, B=b*G+x2*
H, G, H indicate that two points of the difference on the same elliptic curve, a, b are positive integer, and x1 and x2 indicate the blind factor and be random number；
Calculate separately parameter message, c, y, wherein message=hash (string (A)+string (B)), parameter c are bright
Text and c=a-b-1, y=x1-x2；
It is input parameter with message, c, y, is signed by RangeProof algorithm to input parameter, generate signature
signature；
It is greater than or equal to 0 proof using signature as clear data c, signature, ciphertext data A and B is published to
On block chain, so that data requirements side carries out sign test by RangeProof algorithm, and clear data a is determined based on sign test result
With the size relation of b.
2. encryption data size relation method of proof as described in claim 1, which is characterized in that the encryption data size is closed
It is method of proof further include:
Obtain the proof of ciphertext data A, B and clear data c more than or equal to 0 that data providing is published on block chain
signature；
Calculate separately parameter message, C, wherein message=hash (string (A)+string (B)), C=(A-B-G)
=(a-b-1) * G+ (x1-x2) * H=c*G+y*H, C are the ciphertext data of clear data c；
It is input parameter with message, C, signature, sign test is carried out to input parameter by RangeProof algorithm, is obtained
Sign test result；
Based on sign test as a result, determining the size relation of clear data a and b, wherein if sign test result is to prove very, determine
Clear data a is greater than b.
3. encryption data size relation method of proof as claimed in claim 1 or 2, which is characterized in that described respectively to bright
Before the step of literary data a, b are encrypted, and corresponding ciphertext data A, B are obtained, further includes:
Obtain the original plaintext data for carrying out encryption data size relation proof；
Judge whether original plaintext data are positive integer；
If so, using original plaintext data as clear data a, b；
If it is not, then carrying out the processing of decimal point fixed point to original plaintext data, the clear data of positive integer is obtained, and by positive integer
Clear data as clear data a, b.
4. encryption data size relation method of proof as claimed in claim 3, which is characterized in that in the acquisition for carrying out
Before the step of original plaintext data that encryption data size relation proves, further includes:
Obtain original plaintext data n, h, the k for being subordinate to numberical range verifying for carrying out encryption data, wherein to be verified differs
Formula relationship is h < n < k；
Based on the size relation between numerical value n and numerical value h, k, inequality relation to be verified is split as n > h, k > n, for
The verifying of encryption data size relation is carried out to the corresponding encryption data of n, h and the corresponding encryption data of n, k respectively.
5. a kind of encryption data size relation proves device, which is characterized in that the encryption data size relation proves device packet
It includes:
Encrypting module obtains corresponding ciphertext data A, B, wherein A=a*G+ for encrypting respectively to clear data a, b
X1*H, B=b*G+x2*H, G, H indicate that two points of the difference on the same elliptic curve, a, b are positive integer, and x1 and x2 indicate blind
The factor and be random number；
First parameter calculating module, for calculating separately parameter message, c, y, wherein message=hash (string (A)
+ string (B)), parameter c is plaintext and c=a-b-1, y=x1-x2；
Signature generation module carries out input parameter by RangeProof algorithm for being input parameter with message, c, y
Signature generates signature signature；
Release module, for being greater than or equal to 0 proof using signature as clear data c, by signature, ciphertext number
It is published on block chain according to A and B, so that data requirements side carries out sign test by RangeProof algorithm, and is based on sign test result
Determine the size relation of clear data a and b.
6. encryption data size relation as claimed in claim 5 proves device, which is characterized in that the encryption data size is closed
System proves device further include:
First obtains module, big for obtaining ciphertext data A, B that data providing is published on block chain and clear data c
In or equal to 0 proof signature；
Second parameter calculating module, for calculating separately parameter message, C, wherein message=hash (string (A)+
String (B)), C=(A-B-G)=(a-b-1) * G+ (x1-x2) * H=c*G+y*H, C is the ciphertext data of clear data c；
Signature verification module, for being input parameter with message, C, signature, by RangeProof algorithm to input
Parameter carries out sign test, obtains sign test result；Based on sign test as a result, determining the size relation of clear data a and b, wherein if sign test
As a result true to prove, then determine that clear data a is greater than b.
7. as encryption data size relation described in claim 5 or 6 proves device, which is characterized in that the encryption data is big
Small relationship proves device further include:
Second obtains module, for obtaining the original plaintext data for carrying out encryption data size relation proof；
Judgment module, for judging whether original plaintext data are positive integer；
First preprocessing module, if for original plaintext data be positive integer, using original plaintext data as clear data a,
b；If original plaintext data are non-positive integer, the processing of decimal point fixed point is carried out to original plaintext data, obtains positive integer
Clear data, and using the clear data of positive integer as clear data a, b.
8. encryption data size relation as claimed in claim 7 proves device, which is characterized in that the encryption data size is closed
System proves device further include:
Third obtains module, for obtaining original plaintext data n, h, k for being subordinate to numberical range verifying for carrying out encryption data,
Wherein, inequality relation to be verified is h < n < k；
Second preprocessing module, for based on the size relation between numerical value n and numerical value h, k, by inequality relation to be verified
It is split as n > h, k > n, for carrying out encryption data to the corresponding encryption data of n, h and the corresponding encryption data of n, k respectively
Size relation verifying.
9. a kind of encryption data size relation proves equipment, which is characterized in that the encryption data size relation proves equipment packet
It includes memory, processor and is stored in the encryption data size relation that can be run on the memory and on the processor
Prover is realized when the encryption data size relation prover is executed by the processor as appointed in claim 1-4
Described in one the step of encryption data size relation method of proof.
10. a kind of computer readable storage medium, which is characterized in that be stored with encryption number on the computer readable storage medium
According to size relation prover, such as claim 1- is realized when the encryption data size relation prover is executed by processor
Described in any one of 4 the step of encryption data size relation method of proof.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910542027.6A CN110399735A (en) | 2019-06-21 | 2019-06-21 | Encryption data size relation method of proof, device, equipment and storage medium |
| PCT/CN2019/120850 WO2020253106A1 (en) | 2019-06-21 | 2019-11-26 | Method and apparatus for proving size relationship of encrypted data, device, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910542027.6A CN110399735A (en) | 2019-06-21 | 2019-06-21 | Encryption data size relation method of proof, device, equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110399735A true CN110399735A (en) | 2019-11-01 |
Family
ID=68324184
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910542027.6A Pending CN110399735A (en) | 2019-06-21 | 2019-06-21 | Encryption data size relation method of proof, device, equipment and storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN110399735A (en) |
| WO (1) | WO2020253106A1 (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111612457A (en) * | 2020-04-27 | 2020-09-01 | 深圳壹账通智能科技有限公司 | Electronic voting method, device and storage medium based on block chain |
| CN111628865A (en) * | 2020-04-23 | 2020-09-04 | 平安科技（深圳）有限公司 | Method and device for verifying peer-to-peer relation parameters of encrypted data and storage medium |
| WO2020253106A1 (en) * | 2019-06-21 | 2020-12-24 | 深圳壹账通智能科技有限公司 | Method and apparatus for proving size relationship of encrypted data, device, and storage medium |
| CN112417432A (en) * | 2020-11-25 | 2021-02-26 | 北京奇艺世纪科技有限公司 | Data conversion method, verification method, device, electronic equipment and storage medium |
| CN112632636A (en) * | 2020-12-23 | 2021-04-09 | 深圳前海微众银行股份有限公司 | Method and device for proving and verifying ciphertext data comparison result |
| CN113014384A (en) * | 2021-03-16 | 2021-06-22 | 平安付科技服务有限公司 | Data comparison method and device based on DH key exchange algorithm, computer equipment and storage medium |
| WO2021120869A1 (en) * | 2019-12-16 | 2021-06-24 | 支付宝(杭州)信息技术有限公司 | Multi-party secure calculation method and system for private data |
| CN113379415A (en) * | 2020-03-10 | 2021-09-10 | 深圳市网心科技有限公司 | Block chain system, information processing method, system, device and computer medium |
| WO2021196478A1 (en) * | 2020-03-30 | 2021-10-07 | 深圳壹账通智能科技有限公司 | Method for comparing equality relationship of encryption data, device, computer apparatus, and storage medium |
| WO2022068354A1 (en) * | 2020-09-29 | 2022-04-07 | 深圳壹账通智能科技有限公司 | Data verification method, apparatus and device, and storage medium |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113420307B (en) * | 2021-06-28 | 2023-03-28 | 未鲲(上海)科技服务有限公司 | Ciphertext data evaluation method and device, computer equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107707358A (en) * | 2017-10-30 | 2018-02-16 | 武汉大学 | A kind of EC KCDSA digital signature generation method and system |
| CN109257182A (en) * | 2018-10-24 | 2019-01-22 | 杭州趣链科技有限公司 | A kind of block chain method for secret protection that the cryptography promise based on homomorphism is proved with Zero Knowledge range |
| CA3040601A1 (en) * | 2018-11-27 | 2019-04-18 | Alibaba Group Holding Limited | System and method for information protection |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5784662B2 (en) * | 2013-03-13 | 2015-09-24 | 株式会社東芝 | ENCRYPTED DATA OPERATION SYSTEM, DEVICE, AND PROGRAM |
| US9674189B1 (en) * | 2014-05-25 | 2017-06-06 | Fujitsu Limited | Relational encryption |
| CN108234108B (en) * | 2017-12-15 | 2021-06-22 | 复旦大学 | High-efficiency de-ordering encryption method for weak leakage |
| CN108512840A (en) * | 2018-03-21 | 2018-09-07 | 杭州弗兰科信息安全科技有限公司 | One kind is based on letting out the encrypted cipher text retrieval method of sequence |
| CN110399735A (en) * | 2019-06-21 | 2019-11-01 | 深圳壹账通智能科技有限公司 | Encryption data size relation method of proof, device, equipment and storage medium |
-
2019
- 2019-06-21 CN CN201910542027.6A patent/CN110399735A/en active Pending
- 2019-11-26 WO PCT/CN2019/120850 patent/WO2020253106A1/en active Application Filing
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107707358A (en) * | 2017-10-30 | 2018-02-16 | 武汉大学 | A kind of EC KCDSA digital signature generation method and system |
| CN109257182A (en) * | 2018-10-24 | 2019-01-22 | 杭州趣链科技有限公司 | A kind of block chain method for secret protection that the cryptography promise based on homomorphism is proved with Zero Knowledge range |
| CA3040601A1 (en) * | 2018-11-27 | 2019-04-18 | Alibaba Group Holding Limited | System and method for information protection |
Non-Patent Citations (1)
| Title |
|---|
| 康立;王之怡;: "高效的适应性选择密文安全公钥加密算法", 计算机学报, no. 02 * |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020253106A1 (en) * | 2019-06-21 | 2020-12-24 | 深圳壹账通智能科技有限公司 | Method and apparatus for proving size relationship of encrypted data, device, and storage medium |
| WO2021120869A1 (en) * | 2019-12-16 | 2021-06-24 | 支付宝(杭州)信息技术有限公司 | Multi-party secure calculation method and system for private data |
| CN113379415B (en) * | 2020-03-10 | 2022-09-20 | 深圳市迅雷网络技术有限公司 | Block chain system, information processing method, system, device and computer medium |
| CN113379415A (en) * | 2020-03-10 | 2021-09-10 | 深圳市网心科技有限公司 | Block chain system, information processing method, system, device and computer medium |
| WO2021196478A1 (en) * | 2020-03-30 | 2021-10-07 | 深圳壹账通智能科技有限公司 | Method for comparing equality relationship of encryption data, device, computer apparatus, and storage medium |
| WO2021212611A1 (en) * | 2020-04-23 | 2021-10-28 | 平安科技（深圳）有限公司 | Encrypted data peer-to-peer relationship parameter inspection method and apparatus, and device and storage medium |
| CN111628865A (en) * | 2020-04-23 | 2020-09-04 | 平安科技（深圳）有限公司 | Method and device for verifying peer-to-peer relation parameters of encrypted data and storage medium |
| CN111612457A (en) * | 2020-04-27 | 2020-09-01 | 深圳壹账通智能科技有限公司 | Electronic voting method, device and storage medium based on block chain |
| WO2022068354A1 (en) * | 2020-09-29 | 2022-04-07 | 深圳壹账通智能科技有限公司 | Data verification method, apparatus and device, and storage medium |
| CN112417432A (en) * | 2020-11-25 | 2021-02-26 | 北京奇艺世纪科技有限公司 | Data conversion method, verification method, device, electronic equipment and storage medium |
| CN112632636A (en) * | 2020-12-23 | 2021-04-09 | 深圳前海微众银行股份有限公司 | Method and device for proving and verifying ciphertext data comparison result |
| CN112632636B (en) * | 2020-12-23 | 2024-06-04 | 深圳前海微众银行股份有限公司 | Ciphertext data comparison result proving and verifying method and device |
| CN113014384A (en) * | 2021-03-16 | 2021-06-22 | 平安付科技服务有限公司 | Data comparison method and device based on DH key exchange algorithm, computer equipment and storage medium |
| CN113014384B (en) * | 2021-03-16 | 2022-07-15 | 平安付科技服务有限公司 | Data comparison method and device based on DH key exchange algorithm, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2020253106A1 (en) | 2020-12-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110399735A (en) | Encryption data size relation method of proof, device, equipment and storage medium | |
| Leng et al. | Blockchain security: A survey of techniques and research directions | |
| Stevens et al. | The first collision for full SHA-1 | |
| JP7372938B2 (en) | Computer-implemented systems and methods for performing atomic swaps using blockchain | |
| CN107967557B (en) | Modifiable credit evaluation system and method based on block chain and electronic payment system | |
| CN106961336B (en) | A kind of key components trustship method and system based on SM2 algorithm | |
| EP3616356B1 (en) | Preventing misrepresentation of input data by participants in a secure multi-party computation | |
| US10887104B1 (en) | Methods and systems for cryptographically secured decentralized testing | |
| CN110147994A (en) | A kind of instant execution method of the block chain based on homomorphic cryptography | |
| CN108768988A (en) | Block chain access control method, equipment and computer readable storage medium | |
| CN116911836A (en) | Method and system for realizing block chain | |
| CN113569294A (en) | Zero knowledge proving method and device, electronic equipment and storage medium | |
| CN110149323B (en) | Processing device with ten-million-level TPS (platform secure protocol) contract processing capacity | |
| CN114584294B (en) | Method and device for carelessly dispersing and arranging | |
| WO2020253108A1 (en) | Information hiding method, apparatus, device, and storage medium | |
| US8448719B2 (en) | Key exchange device | |
| CN109698744A (en) | A kind of machinery of consultation of Satellite Networking session key and device | |
| CN113206744A (en) | Cross-chain transaction supervision method, device, equipment and storage medium | |
| CN106452790A (en) | Multi-party quantum digital signature method without trusted center | |
| Kumar et al. | PSEBVC: Provably secure ECC and biometric based authentication framework using smartphone for vehicular cloud environment | |
| Wan et al. | Towards privacy-preserving and verifiable federated matrix factorization | |
| Wang et al. | zkfl: Zero-knowledge proof-based gradient aggregation for federated learning | |
| CN116506227B (en) | Data processing method, device, computer equipment and storage medium | |
| Zhang et al. | Efficient privacy protection authentication protocol for vehicle network in 5G | |
| CN114629663B (en) | Block chain-based digital commodity transaction method and 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 | ||
| AD01 | Patent right deemed abandoned |
Effective date of abandoning: 20240621 |
|
| AD01 | Patent right deemed abandoned |