CN110708280A - System and method for authenticating root block chain formed by combining multiple independent units - Google Patents
System and method for authenticating root block chain formed by combining multiple independent units Download PDFInfo
- Publication number
- CN110708280A CN110708280A CN201910774419.5A CN201910774419A CN110708280A CN 110708280 A CN110708280 A CN 110708280A CN 201910774419 A CN201910774419 A CN 201910774419A CN 110708280 A CN110708280 A CN 110708280A
- Authority
- CN
- China
- Prior art keywords
- root
- server
- servers
- transaction
- hash code
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/389—Keeping log of transactions for guaranteeing non-repudiation of a transaction
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- 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/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
-
- 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/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Computer Security & Cryptography (AREA)
- Finance (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Signal Processing (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Computer Networks & Wireless Communication (AREA)
- Physics & Mathematics (AREA)
- Technology Law (AREA)
- Marketing (AREA)
- Economics (AREA)
- Development Economics (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to a system and a method for authenticating a root block chain composed of a plurality of groups of independent units, wherein the system for authenticating the root block chain composed of the plurality of groups of independent units comprises a plurality of root servers RS, a plurality of databases DB and a plurality of transaction servers TS; each root server RS corresponds to a database DB, and the database DB is used for storing hash codes H; a plurality of transaction servers TS are arranged under each root server RS; the root block chain authentication system formed by the set of the plurality of independent units improves the reliability of the root server RS, and simultaneously can optimize the data storage cost and the operation speed because only a small number of root servers RS exist.
Description
Technical Field
The invention relates to the technical field of block chains, in particular to a Root block chain authentication System and a Root block chain authentication method (RBAS) which are formed by collecting a plurality of independent units.
Background
As we are conducting many services through the internet in daily life, how to efficiently and economically establish trust becomes more important every day. As the internet of things age comes, these transaction volumes will become larger and more effective authentication services will be required to conduct online transactions.
There are two main methods to obtain this authentication, but each has problems, one: one large reliable business operation company ensures the service of the user, but has the conflict of interests, once the accident happens, the rights and interests of the client can not be ensured to be infringed, two: a large number of users form peers to identify the trust level of the service provider, but this approach becomes too time consuming for timely transaction activities as the number of users increases.
Disclosure of Invention
In view of the defects in the prior art, the invention aims to provide a system and a method for authenticating a root block chain, which are formed by combining a plurality of mechanisms with non-profit properties and independent operation of public trust.
In order to achieve the above purposes, the technical scheme adopted by the invention is as follows:
a root block chain authentication system composed of a plurality of independent units is integrated, which comprises a plurality of root servers RS, a plurality of data bases DB and a plurality of transaction servers TS;
each root server RS is provided with a plurality of transaction servers TS, the root server RS manages and regularly checks the passing standard of the transaction servers TS arranged below the root server RS, and if the passing standard is not met, the transaction servers TS are cancelled for transaction qualification; the transaction server is used for generating a corresponding hash code H for each transaction and uploading the hash code H to a corresponding root server RS;
each root server RS corresponds to a database DB, and the database DB is used for storing hash codes H;
the root servers RS are connected with each other and used for transmitting and receiving the hash code H.
On the basis of the scheme, the number of the root servers RS is at least 3, so that the root servers RS are guaranteed to have more than 50% of the same hash codes H during verification.
On the basis of the scheme, the passing standard can be determined by practical application.
A method for authenticating a root block chain composed of a plurality of independent units is applied to a system for authenticating a root block chain composed of a plurality of independent units, and comprises the following steps:
step 1: establishing a committee, inviting a plurality of mechanisms which are independent and have public credibility respectively by the committee, wherein each mechanism corresponds to a root server RS, and the committee is used for managing the root server RS;
step 2: every transaction on the internet generates a corresponding hash code H by a transaction server TS where the transaction is located, the generated hash code H is uploaded to a root server RS to which the transaction server TS belongs and stored in a corresponding database DB, and the root server RS records the name and time of the transaction server TS generated by each hash code H and stores the name and time in the database DB for query;
and step 3: synchronizing hash codes H in other root servers RS at each timing period through a block chain algorithm among the root servers RS;
and 4, step 4: when the hash code H needs to be verified, the public performs a query check in the root server RS: in the root server RS, if the matched information is found, the name and the time for generating the hash code H transaction server TS are obtained, and if the matched information is not found, the name and the time are invalid;
and 5: the root server RS will regularly check the passing criteria of its underlying transaction server TS and if the passing criteria are not met, the transaction server TS will be disqualified from the transaction.
On the basis of the scheme, the number of the plurality of root servers RS is at least 3, so that the root servers RS are ensured to have more than 50% of the same hash codes H during verification.
On the basis of the scheme, the step 3 specifically comprises the following steps:
step 3.1: in each timing period, the root server RS sends the hash code H stored in the database DB to other root servers RS and receives the hash codes H sent by other root servers RS;
step 3.2: processing the hash code H received in the period and the hash code H received before by a block chain algorithm to obtain the hash code H obtained this time;
step 3.3: comparing the hash code H obtained this time with hash codes H in the database DB of other root servers RS;
if the two are the same, entering step 3.4;
if not, judging the times of non-uniformity:
if the number 1 is different, returning to the step 3.1, and re-receiving the hash code H sent by other root servers RS;
if the number of times is more than 1, returning to the step 2;
step 3.4: and storing the hash code H obtained this time into a database DB.
On the basis of the above scheme, the block chain algorithm in step 3.2 is a hash256 algorithm.
On the basis of the above scheme, the passing standard in step 5 can be determined by practical application.
The invention has the beneficial effects that:
the reputations of all RS servers will be maximized by:
1. and the independent RS servers are mutually backed up to improve the reliability.
2. The hash code H can only be increased continuously according to the period, but can not be deleted, so that the truth storage is ensured.
3. Only a small number of root servers RS are needed in order to optimize data storage costs and computation speed.
Drawings
The invention has the following drawings:
FIG. 1 is a schematic view of the RBAS structure of the present invention.
Fig. 2 is a schematic diagram of a synchronization control method for each timing cycle according to the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings 1 to 2.
A Root block chain authentication System (RBAS) which is composed of a plurality of independent units comprises a plurality of Root servers RS, a plurality of database DBs and a plurality of transaction servers TS;
each root server RS is provided with a plurality of transaction servers TS, the root server RS manages and regularly checks the passing standard of the transaction servers TS arranged below the root server RS, and if the passing standard is not met, the transaction servers TS are cancelled for transaction qualification; the transaction server is used for generating a corresponding hash code H for each transaction and uploading the hash code H to a corresponding root server RS;
each root server RS corresponds to a database DB, and the database DB is used for storing hash codes H;
the root servers RS are connected with each other and used for transmitting and receiving the hash code H.
On the basis of the scheme, the number of the root servers RS is at least 3, so that the root servers RS are guaranteed to have more than 50% of the same hash codes H during verification.
On the basis of the scheme, the passing standard can be determined by practical application.
A method for authenticating a root block chain composed of a plurality of independent units is applied to a system for authenticating a root block chain composed of a plurality of independent units, and comprises the following steps:
step 1: establishing a committee, inviting a plurality of mechanisms which are independent and have public credibility respectively by the committee, wherein each mechanism corresponds to a root server RS, and the committee is used for managing the root server RS;
step 2: every transaction on the internet generates a corresponding hash code H by a transaction server TS where the transaction is located, and the generated hash code H is uploaded to a root server RS to which the transaction server TS belongs and stored in a corresponding database DB;
and step 3: synchronizing hash codes H in other root servers RS at each timing period through a block chain algorithm among the root servers RS;
and 4, step 4: when the hash code H needs to be verified, the public performs a query check in the root server RS: in the root server RS, if the matched information is found, the name and the time for generating the hash code H transaction server TS are obtained, and if the matched information is not found, the name and the time are invalid;
and 5: the root server RS will regularly check the passing criteria of its underlying transaction server TS and if the passing criteria are not met, the transaction server TS will be disqualified from the transaction.
On the basis of the scheme, the number of the plurality of root servers RS is at least 3, so that the root servers RS are ensured to have more than 50% of the same hash codes H during verification.
On the basis of the scheme, the step 3 specifically comprises the following steps:
step 3.1: in each timing period, the root server RS sends the hash code H stored in the database DB to other root servers RS and receives the hash codes H sent by other root servers RS;
step 3.2: processing the hash code H received in the period and the hash code H received before by a block chain algorithm to obtain the hash code H obtained this time;
step 3.3: comparing the hash code H obtained this time with hash codes H in the database DB of other root servers RS;
if the two are the same, entering step 3.4;
if not, judging the times of non-uniformity:
if the number 1 is different, returning to the step 3.1, and re-receiving the hash code H sent by other root servers RS;
if the number of times is more than 1, carrying out manual restart, and returning to the step 2 after the restart;
step 3.4: and storing the hash code H obtained this time into a database DB.
On the basis of the above scheme, the block chain algorithm in step 3.2 is a hash256 algorithm.
On the basis of the above scheme, the passing standard in step 5 can be determined by practical application.
Those not described in detail in this specification are within the skill of the art.
Claims (8)
1. A root block chain authentication system composed of a plurality of independent units is characterized by comprising a plurality of root servers RS, a plurality of database DBs and a plurality of transaction servers TS;
each root server RS is provided with a plurality of transaction servers TS, the root server RS manages and can regularly check the passing standard of the transaction servers TS arranged below the root server RS, and if the passing standard is not met, the transaction servers TS are cancelled for transaction qualification; the transaction server is used for generating a corresponding hash code H for each transaction and uploading the hash code H to a corresponding root server RS;
each root server RS corresponds to a database DB, and the database DB is used for storing hash codes H;
the root servers RS are connected with each other and used for transmitting and receiving the hash code H.
2. The system of claim 1, wherein the number of root servers RS is at least 3 to ensure that the root servers RS have more than 50% identical hash codes H when verified.
3. The system of claim 1, wherein the reach criteria are determined by the application.
4. A method of authenticating a root block chain composed of a plurality of independent units in combination, using the system as claimed in any one of claims 1 to 3, comprising the steps of:
step 1: establishing a committee, inviting a plurality of mechanisms which are independent and have public credibility respectively by the committee, wherein each mechanism corresponds to a root server RS, and the committee is used for managing the root server RS;
step 2: every transaction on the internet generates a corresponding hash code H by a transaction server TS where the transaction is located, the generated hash code H is uploaded to a root server RS to which the transaction server TS belongs and stored in a corresponding database DB, and the root server RS records the name and time of the transaction server TS generated by each hash code H and stores the name and time in the database DB for query;
and step 3: synchronizing hash codes H in other root servers RS at each timing period through a block chain algorithm among the root servers RS;
and 4, step 4: when the hash code H needs to be verified, the public performs a query check in the root server RS: in the root server RS, if the matched information is found, the name and the time for generating the hash code H transaction server TS are obtained, and if the matched information is not found, the name and the time are invalid;
and 5: the root server RS will regularly check the passing criteria of its underlying transaction server TS and if the passing criteria are not met, the transaction server TS will be disqualified from the transaction.
5. The method of claim 4, wherein the number of the root servers RS is at least 3, so as to ensure that the root servers RS have more than 50% identical hash codes H when verified.
6. The method of claim 4, wherein the step 3 includes the steps of:
step 3.1: in each timing period, the root server RS sends the hash code H stored in the database DB to other root servers RS and receives the hash codes H sent by other root servers RS;
step 3.2: processing the hash code H received in the period and the hash code H received before by a block chain algorithm to obtain the hash code H obtained this time;
step 3.3: comparing the hash code H obtained this time with hash codes H in the database DB of other root servers RS;
if the two are the same, entering step 3.4;
if not, judging the times of non-uniformity:
if the number 1 is different, returning to the step 3.1, and re-receiving the hash code H sent by other root servers RS;
if the difference is more than 1 time, returning to the step 2; step 3.4: and storing the hash code H obtained this time into a database DB.
7. The method of claim 6, wherein the block chain algorithm of step 3.2 is a hash256 algorithm.
8. The method of claim 4, wherein the pass criteria of step 5 are determined by the application.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910774419.5A CN110708280B (en) | 2019-08-21 | 2019-08-21 | Root block chain authentication system and method formed by integrating multiple independent units |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910774419.5A CN110708280B (en) | 2019-08-21 | 2019-08-21 | Root block chain authentication system and method formed by integrating multiple independent units |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110708280A true CN110708280A (en) | 2020-01-17 |
| CN110708280B CN110708280B (en) | 2021-02-09 |
Family
ID=69193363
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910774419.5A Active CN110708280B (en) | 2019-08-21 | 2019-08-21 | Root block chain authentication system and method formed by integrating multiple independent units |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110708280B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101079036A (en) * | 2006-06-23 | 2007-11-28 | 腾讯科技（深圳）有限公司 | Storage method and system for mass file |
| CN101388759A (en) * | 2007-09-10 | 2009-03-18 | 中兴通讯股份有限公司 | Method and system for implementing from asynchronous copy to synchronous copy by data |
| CN103312809A (en) * | 2013-06-24 | 2013-09-18 | 北京汉柏科技有限公司 | Distributed management method for service in cloud platform |
| CN107124444A (en) * | 2017-03-28 | 2017-09-01 | 上海瑞麒维网络科技有限公司 | A kind of method and apparatus of block chain data syn-chronization |
| CN108282474A (en) * | 2018-01-18 | 2018-07-13 | 山东大学 | The maintaining method of digital asset trade identity based on block chain |
| CN108805590A (en) * | 2018-06-20 | 2018-11-13 | 佛山科学技术学院 | A kind of agricultural product traceability system based on block chain |
| CN108805585A (en) * | 2018-05-28 | 2018-11-13 | 广州中国科学院软件应用技术研究所 | Distributed commodity data storage system, circulation and source tracing method based on block chain |
| CN109583896A (en) * | 2018-11-30 | 2019-04-05 | 元灵通智能科技（深圳）有限公司 | Transaction verification method, block chain node and storage medium |
| WO2019078411A1 (en) * | 2017-10-19 | 2019-04-25 | 한국과학기술원 | History verification method using block chain configuration between epcis history events |
| CN109842655A (en) * | 2017-11-28 | 2019-06-04 | 北京众享比特科技有限公司 | A kind of method of data synchronization of transregional piece of chain network |
| CN110138592A (en) * | 2019-04-09 | 2019-08-16 | 苏宁易购集团股份有限公司 | A kind of management method and system of intelligence contract |
-
2019
- 2019-08-21 CN CN201910774419.5A patent/CN110708280B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101079036A (en) * | 2006-06-23 | 2007-11-28 | 腾讯科技（深圳）有限公司 | Storage method and system for mass file |
| CN101388759A (en) * | 2007-09-10 | 2009-03-18 | 中兴通讯股份有限公司 | Method and system for implementing from asynchronous copy to synchronous copy by data |
| CN103312809A (en) * | 2013-06-24 | 2013-09-18 | 北京汉柏科技有限公司 | Distributed management method for service in cloud platform |
| CN107124444A (en) * | 2017-03-28 | 2017-09-01 | 上海瑞麒维网络科技有限公司 | A kind of method and apparatus of block chain data syn-chronization |
| WO2019078411A1 (en) * | 2017-10-19 | 2019-04-25 | 한국과학기술원 | History verification method using block chain configuration between epcis history events |
| CN109842655A (en) * | 2017-11-28 | 2019-06-04 | 北京众享比特科技有限公司 | A kind of method of data synchronization of transregional piece of chain network |
| CN108282474A (en) * | 2018-01-18 | 2018-07-13 | 山东大学 | The maintaining method of digital asset trade identity based on block chain |
| CN108805585A (en) * | 2018-05-28 | 2018-11-13 | 广州中国科学院软件应用技术研究所 | Distributed commodity data storage system, circulation and source tracing method based on block chain |
| CN108805590A (en) * | 2018-06-20 | 2018-11-13 | 佛山科学技术学院 | A kind of agricultural product traceability system based on block chain |
| CN109583896A (en) * | 2018-11-30 | 2019-04-05 | 元灵通智能科技（深圳）有限公司 | Transaction verification method, block chain node and storage medium |
| CN110138592A (en) * | 2019-04-09 | 2019-08-16 | 苏宁易购集团股份有限公司 | A kind of management method and system of intelligence contract |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110708280B (en) | 2021-02-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11290441B1 (en) | Systems and methods for blockchain validation of user identity and authority | |
| CN110784346B (en) | Reputation value-based PBFT consensus system and method | |
| US11356521B2 (en) | Methods and apparatus to share online media impressions data | |
| CA2782500C (en) | Automated entity verification | |
| US10356094B2 (en) | Uniqueness and auditing of a data resource through an immutable record of transactions in a hash history | |
| CN110572281B (en) | Credible log recording method and system based on block chain | |
| US9477737B1 (en) | Systems and user interfaces for dynamic access of multiple remote databases and synchronization of data based on user rules | |
| US20150356165A1 (en) | Method and system for providing content to users based on frequency of interaction | |
| CN108282339B (en) | Digital identity retrieving method based on intelligent contracts and self-social media | |
| CN102333112B (en) | Method and system for sharing personal information on internet | |
| WO2014193399A1 (en) | Influence score of a brand | |
| CN111008402A (en) | Block chain timestamp protocol | |
| US10019308B1 (en) | Disaster-proof event data processing | |
| CN113438084A (en) | Green power source tracing method and system based on R-PBFT consensus algorithm and timestamp | |
| US11997188B2 (en) | Method and system for HTTP session management using hash chains | |
| CN115186304B (en) | Transaction data verification method and system based on block chain | |
| US20170132079A1 (en) | Rebuilding and verifying an encoded data slice utilizing slice verification information | |
| CN112767151A (en) | Transaction processing method and device applied to verification node in block chain | |
| CN101557403A (en) | Website login method, device and system | |
| CN110708280B (en) | Root block chain authentication system and method formed by integrating multiple independent units | |
| CN111198895A (en) | Block chain updating method | |
| US7685231B2 (en) | Member activation | |
| CN109783058A (en) | User identity code generating method, device, computer equipment and storage medium | |
| CN117221337A (en) | Block chain consensus method, device, medium and electronic equipment | |
| CN110855643A (en) | Network marketing system based on customer matching |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |