CN109194472A - Game block chain common recognition method based on bilinear map and set signature algorithm - Google Patents
Game block chain common recognition method based on bilinear map and set signature algorithm Download PDFInfo
- Publication number
- CN109194472A CN109194472A CN201811092996.8A CN201811092996A CN109194472A CN 109194472 A CN109194472 A CN 109194472A CN 201811092996 A CN201811092996 A CN 201811092996A CN 109194472 A CN109194472 A CN 109194472A
- Authority
- CN
- China
- Prior art keywords
- signature
- common recognition
- block
- bilinear map
- algorithm
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- 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
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/04—Protocols for data compression, e.g. ROHC
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0819—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
- H04L9/0825—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s) using asymmetric-key encryption or public key infrastructure [PKI], e.g. key signature or public key certificates
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- 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/3066—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy involving algebraic varieties, e.g. elliptic or hyper-elliptic curves
- H04L9/3073—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy involving algebraic varieties, e.g. elliptic or hyper-elliptic curves involving pairings, e.g. identity based encryption [IBE], bilinear mappings or bilinear pairings, e.g. Weil or Tate pairing
-
- 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
Abstract
The game block chain common recognition method based on bilinear map and set signature algorithm that the present invention relates to a kind of, transaction data is broadcasted to the whole network by arbitrary node and encloses the signature of sender, after collector node receives the message that m do not enter block, using set signature algorithm and bilinear map algorithm, operation is carried out to m message and obtains set signature, and set signature is sent within the wheel common recognition time, arbitrary node receives the set signing messages of given quantity in network, reach common understanding and issues complete block, arbitrary node after receiving intact block by comprising transaction deleted from memory, and start next round common recognition.The signature of m original message is aggregated into 1 based on the game block chain common recognition method of bilinear map and set signature algorithm, reduce the consumption of message transmission confirmation, so that its space complexity is reduced to original 1/m, to improve issued transaction efficiency, network capacity is increased.
Description
Technical field
The present invention relates to block chain technical field more particularly to a kind of trips based on bilinear map and set signature algorithm
Play block chain common recognition method.
Background technique
Block chain is the hot spot of financial field and other various fields researchs in recent years, in digital cash, bill, clear
Calculate, digital asset transaction, supply chain finance and government affairs, the people's livelihood and business bottom architecture in terms of have application well latent
Power.With block chain technology continuous development with it is perfect, block chain has got rid of the limitation of the Floor layer Technology of bit coin, increasingly
More application item landings, application range are increasingly wide.
Game becomes first of the big realization mode of Internet era three, according to NewZoo data, global game market in 2017
Scale adds up to 1,08,900,000,000 U.S. dollars, is 1.54 times of 705.7 hundred million U.S. dollar of market scale in 2012, annual compound growth rate 9.06%.
However traditional game is faced with deeper and deeper isolate: (1) opaque, game developer undertakes all exploitation responsibilities, not as good as pre-
Phase leads to customer churn；(2) channel, distribution monopoly return；(3) fictitious assets is not belonging to user, also can not smooth realized value
Circulation；(4) raw galloping inflation tendency, player's interests cannot be guaranteed in game；(5) system not intercommunication, player between game
Sunk cost is high.
Block chain, can as a kind of decentralization, the distributed data base that can not be distorted, can be traced, safeguard jointly in many ways
Mutually it is uncomprehending it is multi-party between establish reliable trust.Block chain is directed to traditional game drawback, will thoroughly be reconstructed: (1)
Cochain, it is fair credible, while logical card (Token) excitation allows game community, innovation is no longer the responsibility of developer merely；(2)
By block chain, breaks channel monopolization, generate new from network for distributed sales；(3) user really possesses assets in game, and can be by
Intelligent contract goes to trust and circulate；(4) block chain across apply account book characteristic, so that same money fictitious assets is re-used, increase greatly
Add the interactivity and playing method between game.(5) economic system in game is remolded.Core, that is, game of block chain combination game is domestic-investment
It produces, is the collectibles that scarcity, practicability and ornamental value combine, design marrow is to create scarcity and uniqueness for user
Value.Therefore, block chain technical application will thoroughly be changed into existing game ecology in game virtual asset management field.
Common recognition algorithm refers to that after a node or multiple nodes propose a value, entire distributed system is to this value
Reach an agreement the algorithm of agreement, core is to guarantee that the whole network is using a kind of algorithm in distributed network for the creation of block
Consistent, the design for algorithm of knowing together is one of key Design content of block chain.
In publicly-owned chain, proved with proof of work (Proof of Work, PoW), equity (Proof of Stake,
PoS) and share entitlements prove that (DPoS) is main common recognition algorithm.And in privately owned chain and alliance's chain, they are most directly to adopt
With traditional Byzantine failure tolerance algorithm (BFT), wherein again with classical practical Byzantine failure tolerance algorithm (PBFT) and its variant
It is most commonly seen.Under the premise of malicious node number is no more than limitation, BFT class algorithm can support higher handling capacity, correct
Property can be by Strict Proof.Certainly, different common recognition algorithms has respective advantage, suitable for different scene and environment, simultaneously
Each algorithm also all Shortcomings.Selection or algorithm improvement are carried out in practical application according to specific requirements.
Currently, the significant challenge that the common recognition algorithm on block chain faces is the efficiency during its common recognition, by
The influence of number of transaction, trading frequency and issued transaction efficiency requirements, the efficiency for algorithm of knowing together are to restrict block chain technology to answer
One problem, therefore the optimization for algorithm of knowing together on block chain is particularly important.Currently, bit coin transaction handling capacity is
Handling capacity is traded as 20~30TPS in 7TPS, ether mill, and the trade confirmation time needs a few minutes even several hours, opposite game
For, game user quantity is more, transaction is frequent, and classical block chain common recognition algorithm is difficult to meet application requirement, it is therefore desirable to
The characteristics of for game, designs suitable efficiently common recognition algorithm, improves transaction capabilities.
Summary of the invention
In view of the deficiencies of the prior art, the game based on bilinear map and set signature algorithm that the present invention provides a kind of
Block chain common recognition method, aggregates into 1 for the signature of m original message, reduces the consumption of message transmission confirmation, so that its
Space complexity is reduced to original 1/m, to improve issued transaction efficiency, increases network capacity.
To achieve the above object, the present invention provides a kind of game block chain based on bilinear map and set signature algorithm
Common recognition method, specifically comprises the following steps:
S1, active view is calculated, and speaker is selected according to active view；
S2, arbitrary node broadcast transaction data to the whole network and enclose the signature of sender；
S3, after the message number for not entering block reaches m, aggregate signature person by gather signature algorithm obtain set signature；
S4, all accounting nodes independently monitor the transaction data of the whole network, and are recorded in memory；
S5, speaker's node are after time t, transmission < PerpareRequest, h, v, p, block, σi>, wherein t is
The time interval of block is generated every time, and PerpareRequest is epicycle common recognition initiation message, and h is the block height of common recognition, and v is
View number, p are speaker's number, and block is block information, σiFor signature list；
S6, Congressman i are after receiving motion, transmission < PerpareResponse, h, v, i, σi>, wherein
PerpareResponse is response message；
S7, arbitrary node are receiving at least (n-f) a σiAfter reach common understanding and issue complete block, wherein n is node
Quantity, f are Byzantium's number of nodes；
S8, arbitrary node after receiving intact block by comprising transaction deleted from memory, and start next round common recognition.
Preferably, in the step S3, set signature algorithm carries out as follows:
S31, q is enabled to be Big prime, selection generates member A ∈ G1, B ∈ G2, define the module G that rank is q1With multiplicative group G2,
Progress bilinear map is e:G1×G2→GT, define hash function H:
H0: { 0,1 } * → Zq*,
H1: { 0,1 } * × G1→G2,
H2: { 0,1 } * → G1, HDV: { 0,1 } * → G1；
Wherein Zq* Positive Integer Set, H are indicatedDVIndicate orthogonal transformation；
S32, based on view computation A instantlyv=vA obtains system parameter in conjunction with existing parameter
Params={ G1,G2,e,q,A,B,Av,H0,H1,H2,HDV}；
S33, user uiSelect random value βi∈Zq* as the secret value of user, A is calculatedi=βiA, Bi=H1(Di||Ai),
Wherein Di=vBi, generate the private key S of useri=(Di||βi)；
S34, user uiSelect random value αi∈Zq*, Ri=α A, hi=H0(Di||ωi||Ai||Ri), T=H2(Av)；
S35, V is calculatedi=Di+hiαiT+βiB exports uiTo ωiSignature list σi=(Vi, Ri), and by σiIt is sent to collection
Conjunction person uA。
Preferably, it in the step S7, needs during common recognition to signature list σiValidity verified, by such as
Under type verifies uiTo ωiSignature list σiValidity: first, in accordance with formula hi=H0(Di||ωi||Ai||Ri) calculate
The block height h of common recognitioni, then according to formula Bi=H1(Di||Ai) calculate generation member Bi, and whether verify following equalities true:
e(Vi, B) and=e (Bi, Av) e (T, hiRi) e (A, Ai)。
Preferably, set signature sigma is obtained by set signature algorithm as follows: inputting all user uiTo ωiSignature list
σi,
Then set person uAV and R is calculated,
Finally calculate set signature sigma=(V, R).
Preferably, the validity for gathering signature sigma is verified by the following method: input system parameter Params, list of identities Di、
List of public keys Pi, signature list σi, calculate Bi, T, then according to following equation calculate:
If equation is set up, it is verified, otherwise verifies and do not pass through.
Preferably, when calculating active view, one number v of each view allocation, number is incremented by since 0, and gradually,
Each node for participating in common recognition distributes a number, and since 0, the number of the last one node is n-1, and each round is known together all
One node is set to serve as speaker, other nodes are then Congressman, and the number p of speaker is determined by following formula: assuming that current
The block height of common recognition is h, then p=(h-v) mod n, and common recognition generates a block each time, and at least (n-f) a note
The signature of account node then immediately begins to the common recognition of a new round, while resetting v=0 once there is new block to generate.
The beneficial effects of the present invention are: the present invention is more for game user quantity, needs the frequently application characteristics such as transaction, mention
A kind of game block chain common recognition method based on bilinear map and set signature algorithm out, is broadcasted by arbitrary node to the whole network
Transaction data and the signature for enclosing sender, after collector node receives the message that m does not enter block, using set signature algorithm and
Bilinear map algorithm carries out operation to m message and obtains set signature, and sends set signature within the wheel common recognition time,
Arbitrary node receives the set signing messages of given quantity in network, reaches common understanding and issues complete block, arbitrary node exists
Receive after intact block by comprising transaction deleted from memory, and start next round common recognition, based on bilinear map sum aggregate
The signature of m original message is aggregated into 1 by the game block chain common recognition method for closing signature algorithm, and it is true to reduce message transmission
The consumption recognized, to improve issued transaction efficiency, increases network appearance so that its space complexity is reduced to original 1/m
Amount.
Detailed description of the invention
Fig. 1 is flow diagram of the invention.
Specific embodiment
The principle and features of the present invention will be described below with reference to the accompanying drawings, and the given examples are served only to explain the present invention, and
It is non-to be used to limit the scope of the invention.
The node for participating in common recognition needs to safeguard a state table, and for recording current common recognition state, primary common recognition is from opening
Begin to be referred to as view to data acquisition system used in end, if can not reach common understanding in active view, needs replacing view
Figure, it is assumed that the time interval that system requirements generates block every time is that t reflects then in the case where all going well based on bilinearity
The game block chain common recognition method penetrated and gather signature algorithm is executed according to following below scheme:
S1, active view is calculated, and speaker, detailed process is selected according to active view are as follows: be each view allocation one
A number v, number is incremented by since 0, and gradually, distributes until reaching common understanding, and for each node for participating in common recognition
One number, since 0, the number of the last one node is n-1, and each round common recognition system automatically selects a node to serve as
Speaker, other nodes are then Congressman, and the number p of speaker is determined by following formula: assuming that the block height currently known together is h,
Then p=(h-v) mod n, common recognition generates a block each time, and with the signature of at least (n-f) a accounting nodes, once
There is new block to generate, then immediately begins to the common recognition of a new round, while resetting v=0；
S2, arbitrary node broadcast transaction data to the whole network and enclose the signature of sender；
S3, after the message number for not entering block reaches m, aggregate signature person by gather signature algorithm obtain set signature,
Wherein gather the thinking of signature algorithm are as follows: give n user ui∈ U (1≤i≤n), wherein U is user's set, is disappeared for m
Breath, ωi∈ ω (1≤i≤m), wherein ω is massage set, is signed for n, and the generator for gathering signature can be by this n
(single) signature set is at a unique short signature γ, and the identity for giving set signature, participating in generating set signer
uiAnd its origination message ω of signaturei, it is user u that verifier can be made, which to firmly believe,iTo message ωiThe signature done；
Set signature algorithm specifically carries out as follows:
S31, q is enabled to be Big prime, selection generates member A ∈ G1, B ∈ G2, define the module G that rank is q1With multiplicative group G2,
Progress bilinear map is e:G1×G2→GT, define hash function H:
H0: { 0,1 } * → Zq*,
H1: { 0,1 } * × G1→G2,
H2: { 0,1 } * → G1, HDV: { 0,1 } * → G1；
Wherein Zq* Positive Integer Set, H are indicatedDVIndicate orthogonal transformation；
S32, based on view computation A instantlyv=vA obtains system parameter in conjunction with existing parameter
Params={ G1,G2,e,q,A,B,Av,H0,H1,H2,HDV}；
S33, user uiSelect random value βi∈Zq* as the secret value of user, A is calculatedi=βiA, Bi=H1(Di||Ai),
Wherein Di=vBi, generate the private key S of useri=(Di||βi)；
S34, user uiSelect random value αi∈Zq*, Ri=α A, hi=H0(Di||ωi||Ai||Ri), T=H2(Av)；
S35, V is calculatedi=Di+hiαiT+βiB exports uiTo ωiSignature list σi=(Vi, Ri), and by σiIt is sent to collection
Conjunction person uA；
S4, all accounting nodes independently monitor the transaction data of the whole network, and are recorded in memory；
S5, speaker's node are after time t, transmission < PerpareRequest, h, v, p, block, σi>, wherein t is
The time interval of block is generated every time, and PerpareRequest is epicycle common recognition initiation message, and h is the block height of common recognition, and v is
View number, p are speaker's number, and block is block information, σiFor signature list；
S6, Congressman i are after receiving motion, transmission < PerpareResponse, h, v, i, σi>, wherein
PerpareResponse is response message；
S7, arbitrary node are receiving at least (n-f) a σiAfter reach common understanding and issue complete block, wherein n is node
Quantity, f are Byzantium's number of nodes, are needed during common recognition to signature list σiIt is verified with the validity of set signature sigma,
U is wherein verified in the following wayiTo ωiSignature list σiValidity: first, in accordance with formula hi=H0(Di||
ωi||Ai||Ri) calculate the block height h of common recognitioni, then according to formula Bi=H1(Di||Ai) calculate generation member Bi, and verify
Whether following equalities are true: e (Vi, B) and=e (Bi, Av) e (T, hiRi) e (A, Ai), if equation is set up, signature list σiEffectively,
If equation is invalid, signature list σiIn vain；
The validity of set signature sigma is verified in the following way:
1) firstly, set signature sigma obtains in the following way: inputting all user uiTo ωiSignature list σi, then
Collection
Conjunction person uAV and R is calculated,
Finally calculate set signature sigma=(V, R)；
2) input system parameter Params, list of identities Di, list of public keys Pi, signature list σi, calculate Bi, T, then press
It is calculated according to following equation:
If equation is set up, it is verified, otherwise verifies and do not pass through；
S8, arbitrary node after receiving intact block by comprising transaction deleted from memory, and start next round common recognition.
The present invention is more for game user quantity, needs the frequently application characteristics such as transaction, by receiving m in collector node
After the message for not entering block, using set signature algorithm and bilinear map algorithm, operation is carried out to m message and obtains set label
Name, and set signature is sent within the wheel common recognition time, the signature of m original message is aggregated into 1, reduces message biography
The consumption of defeated confirmation, to improve issued transaction efficiency, increases net so that its space complexity is reduced to original 1/m
Network capacity.
The foregoing is merely presently preferred embodiments of the present invention, is not intended to limit the invention, it is all in spirit of the invention and
Within principle, any modification, equivalent replacement, improvement and so on be should all be included in the protection scope of the present invention.
Claims (6)
- A kind of method 1. game block chain based on bilinear map and set signature algorithm is known together, which is characterized in that specific packet Include following steps:S1, active view is calculated, and speaker is selected according to active view；S2, arbitrary node broadcast transaction data to the whole network and enclose the signature of sender；S3, after the message number for not entering block reaches m, aggregate signature person by gather signature algorithm obtain set signature；S4, all accounting nodes independently monitor the transaction data of the whole network, and are recorded in memory；S5, speaker's node are after time t, transmission < PerpareRequest, h, v, p, block, σi>, wherein t is each The time interval of block is generated, PerpareRequest is epicycle common recognition initiation message, and h is the block height of common recognition, and v is view Number, p are speaker's number, and block is block information, σiFor signature list；S6, Congressman i are after receiving motion, transmission < PerpareResponse, h, v, i, σi>, wherein PerpareResponse is Response message；S7, arbitrary node are receiving at least (n-f) a σiAfter reach common understanding and issue complete block, wherein n is node total number, f For Byzantium's number of nodes；S8, arbitrary node after receiving intact block by comprising transaction deleted from memory, and start next round common recognition.
- The method 2. the game block chain according to claim 1 based on bilinear map and set signature algorithm is known together, It is characterized in that, in the step S3, set signature algorithm carries out as follows:S31, q is enabled to be Big prime, selection generates member A ∈ G1, B ∈ G2, define the module G that rank is q1With multiplicative group G2, carry out Bilinear map is e:G1×G2→GT, GTIt is n rank cyclic group, defines hash function H:H0: { 0,1 } * → Zq*,H1: { 0,1 } * × G1→G2,H2: { 0,1 } * → G1, HDV: { 0,1 } * → G1；Wherein Zq* Positive Integer Set, H are indicatedDVIndicate orthogonal transformation；S32, based on view computation A instantlyv=vA obtains system parameter in conjunction with existing parameterParams={ G1,G2,e,q,A,B,Av,H0,H1,H2,HDV}；S33, user uiSelect random value βi∈Zq* as the secret value of user, A is calculatedi=βiA, Bi=H1(Di||Ai), wherein Di =vBi, generate the private key S of useri=(Di||βi)；S34, user uiSelect random value αi∈Zq*, Ri=α A, hi=H0(Di||ωi||Ai||Ri), T=H2(Av)；S35, V is calculatedi=Di+hiαiT+βiB exports uiTo initial data ωiSignature be expressed as σi=(Vi, Ri), and by σiHair Give set person uA。
- The method 3. the game block chain according to claim 2 based on bilinear map and set signature algorithm is known together, It is characterized in that, in the step S7, needs during common recognition to signature list σiValidity verified, in the following way Verify uiTo ωiSignature list σiValidity: first, in accordance with formula hi=H0(Di||ωi||Ai||Ri) calculate common recognition Block height hi, then according to formula Bi=H1(Di||Ai) calculate generation member Bi, and whether true: e (V if verifying following equalitiesi, B)=e (Bi, Av) e (T, hiRi) e (A, Ai)。
- The method 4. the game block chain according to claim 3 based on bilinear map and set signature algorithm is known together, It is characterized in that, set signature sigma is obtained by set signature algorithm as follows: inputting all user uiTo ωiSignature list σi, so Set person u afterwardsAV and R is calculated,Finally calculate set signature sigma=(V, R).
- The method 5. the game block chain according to claim 4 based on bilinear map and set signature algorithm is known together, It is characterized in that, the validity for gathering signature sigma is verified by the following method: input system parameter Params, list of identities Di, public key column Table Pi, signature list σi, calculate Bi, T, then according to following equation calculate:If equation is set up, it is verified, otherwise verifies and do not pass through.
- The method 6. the game block chain according to claim 1 based on bilinear map and set signature algorithm is known together, It being characterized in that, when calculating active view, one number v of each view allocation, number is incremented by since 0, and gradually, each The node for participating in common recognition distributes a number, and since 0, the number of the last one node is n-1, all settings one of each round common recognition A node serves as speaker, and other nodes are then Congressman, the number p of speaker is determined by following formula: assuming that currently know together Block height is h, then p=(h-v) modn, and common recognition generates a block each time, and at least (n-f) a accounting nodes Signature then immediately begin to the common recognition of a new round, while resetting v=0 once there is new block to generate.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811092996.8A CN109194472A (en) | 2018-09-19 | 2018-09-19 | Game block chain common recognition method based on bilinear map and set signature algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811092996.8A CN109194472A (en) | 2018-09-19 | 2018-09-19 | Game block chain common recognition method based on bilinear map and set signature algorithm |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109194472A true CN109194472A (en) | 2019-01-11 |
Family
ID=64908288
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811092996.8A Pending CN109194472A (en) | 2018-09-19 | 2018-09-19 | Game block chain common recognition method based on bilinear map and set signature algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109194472A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109993647A (en) * | 2019-03-08 | 2019-07-09 | 西安电子科技大学 | A kind of pay taxes credit investigation system and processing method based on block chain |
| CN110602190A (en) * | 2019-08-30 | 2019-12-20 | 上海唯链信息科技有限公司 | Block chain consensus method, block chain node and storage device |
| CN111079199A (en) * | 2020-03-23 | 2020-04-28 | 杭州有数金融信息服务有限公司 | Enterprise credit data screenshot tamper-proofing method based on block chain technology |
| CN111371744A (en) * | 2020-02-21 | 2020-07-03 | 重庆邮电大学 | Byzantine fault-tolerant consensus method based on distributed key |
| CN111445334A (en) * | 2020-03-30 | 2020-07-24 | 北京数字认证股份有限公司 | Aggregation signature method and device for block chain system and storage medium |
| CN111756548A (en) * | 2020-06-17 | 2020-10-09 | 深圳市蔚链科技有限公司 | Node consensus mechanism optimization method, system, device and storage medium |
| CN112003820A (en) * | 2020-07-13 | 2020-11-27 | 南京邮电大学 | Block chain consensus optimization method based on ring signature and aggregated signature |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107124403A (en) * | 2017-04-14 | 2017-09-01 | 朱清明 | The generation method and computing device of common recognition block in block chain |
-
2018
- 2018-09-19 CN CN201811092996.8A patent/CN109194472A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107124403A (en) * | 2017-04-14 | 2017-09-01 | 朱清明 | The generation method and computing device of common recognition block in block chain |
Non-Patent Citations (1)
| Title |
|---|
| 苑超等: "基于聚合签名的共识算法优化方案", 《计算机科学》 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109993647A (en) * | 2019-03-08 | 2019-07-09 | 西安电子科技大学 | A kind of pay taxes credit investigation system and processing method based on block chain |
| CN109993647B (en) * | 2019-03-08 | 2023-12-22 | 西安电子科技大学 | Tax collection system based on blockchain and processing method |
| CN110602190A (en) * | 2019-08-30 | 2019-12-20 | 上海唯链信息科技有限公司 | Block chain consensus method, block chain node and storage device |
| CN110602190B (en) * | 2019-08-30 | 2022-04-19 | 上海唯链信息科技有限公司 | Block chain consensus method, block chain node and storage device |
| CN111371744A (en) * | 2020-02-21 | 2020-07-03 | 重庆邮电大学 | Byzantine fault-tolerant consensus method based on distributed key |
| CN111371744B (en) * | 2020-02-21 | 2022-06-03 | 重庆邮电大学 | Byzantine fault-tolerant consensus method based on distributed key |
| CN111079199A (en) * | 2020-03-23 | 2020-04-28 | 杭州有数金融信息服务有限公司 | Enterprise credit data screenshot tamper-proofing method based on block chain technology |
| CN111445334A (en) * | 2020-03-30 | 2020-07-24 | 北京数字认证股份有限公司 | Aggregation signature method and device for block chain system and storage medium |
| CN111445334B (en) * | 2020-03-30 | 2023-09-05 | 北京数字认证股份有限公司 | Aggregation signature method, device and storage medium of blockchain system |
| CN111756548A (en) * | 2020-06-17 | 2020-10-09 | 深圳市蔚链科技有限公司 | Node consensus mechanism optimization method, system, device and storage medium |
| CN112003820A (en) * | 2020-07-13 | 2020-11-27 | 南京邮电大学 | Block chain consensus optimization method based on ring signature and aggregated signature |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109194472A (en) | Game block chain common recognition method based on bilinear map and set signature algorithm | |
| Li et al. | A blockchain privacy protection scheme based on ring signature | |
| Wang et al. | A blockchain based privacy-preserving incentive mechanism in crowdsensing applications | |
| CN109120398B (en) | Secret sharing method and device based on block chain system | |
| Wang et al. | Proof of X-repute blockchain consensus protocol for IoT systems | |
| Fuchsbauer et al. | Aggregate cash systems: A cryptographic investigation of mimblewimble | |
| Van Saberhagen | CryptoNote v 2.0 | |
| Baldimtsi et al. | Anonymous credentials light | |
| Liu et al. | Unlinkable coin mixing scheme for transaction privacy enhancement of bitcoin | |
| Libert et al. | Concise mercurial vector commitments and independent zero-knowledge sets with short proofs | |
| Li et al. | IntegrityChain: provable data possession for decentralized storage | |
| Bou Abdo et al. | Permissionless proof‐of‐reputation‐X: A hybrid reputation‐based consensus algorithm for permissionless blockchains | |
| Yang et al. | Decentralized blacklistable anonymous credentials with reputation | |
| Chen et al. | A Certificateless Strong Designated Verifier Signature Scheme with Non-delegatability. | |
| Li et al. | A blockchain-based self-tallying voting scheme in decentralized IoT | |
| CN109413078A (en) | A kind of anonymous authentication scheme based on group ranking under master pattern | |
| Li et al. | Metaopera: A cross-metaverse interoperability protocol | |
| Nosouhi et al. | UCoin: An efficient privacy preserving scheme for cryptocurrencies | |
| Yan et al. | White-box traceable ciphertext-policy attribute-based encryption in multi-domain environment | |
| Jager et al. | Black-box accumulation: Collecting incentives in a privacy-preserving way | |
| Hou et al. | Fine-grained and controllably redactable blockchain with harmful data forced removal | |
| Ni et al. | Dual-anonymous off-line electronic cash for mobile payment | |
| Fuchsbauer et al. | Fair blind signatures without random oracles | |
| Deng et al. | Designated-verifier anonymous credential for identity management in decentralized systems | |
| Nakanishi et al. | Efficient zero-knowledge proofs of graph signature for connectivity and isolation using bilinear-map accumulator |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190111 |