CN110708280B - Root block chain authentication system and method formed by integrating multiple independent units - Google Patents

Root block chain authentication system and method formed by integrating multiple independent units Download PDF

Info

Publication number
CN110708280B
CN110708280B CN201910774419.5A CN201910774419A CN110708280B CN 110708280 B CN110708280 B CN 110708280B CN 201910774419 A CN201910774419 A CN 201910774419A CN 110708280 B CN110708280 B CN 110708280B
Authority
CN
China
Prior art keywords
root
servers
server
hash code
transaction
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.)
Expired - Fee Related
Application number
CN201910774419.5A
Other languages
Chinese (zh)
Other versions
CN110708280A (en
Inventor
王知康
皮人杰
张玉成
刘文建
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing University of Posts and Telecommunications
Original Assignee
Beijing University of Posts and Telecommunications
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Priority to CN201910774419.5A priority Critical patent/CN110708280B/en
Publication of CN110708280A publication Critical patent/CN110708280A/en
Application granted granted Critical
Publication of CN110708280B publication Critical patent/CN110708280B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

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)
  • Signal Processing (AREA)
  • Theoretical Computer Science (AREA)
  • Strategic Management (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Marketing (AREA)
  • Economics (AREA)
  • Technology Law (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 root block chain authentication system and method formed by integrating a plurality of independent units, wherein the root block chain authentication system formed by integrating 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 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 collecting a plurality of independent units improves the reliability of the root server RS, and simultaneously can optimize the data storage cost and the operation speed due to the existence of a small number of root servers RS.

Description

Root block chain authentication system and method formed by integrating multiple independent units
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 present invention aims to provide a root block chain authentication system and method that are composed of a plurality of organizations with public trust and independent operation and non-profit property.
In order to achieve the above purposes, the technical scheme adopted by the invention is as follows:
a root block chain authentication system formed by integrating 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 root block chain authentication method formed by collecting a plurality of independent units is applied to a root block chain authentication system formed by collecting 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. the reliability of each independent RS server is improved through mutual backup;
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) formed by integrating a plurality of independent units 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 root block chain authentication method formed by collecting a plurality of independent units is applied to a root block chain authentication system formed by collecting 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 (2)

1. A root block chain authentication system formed by gathering 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;
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;
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; the hash codes H in other root servers RS are synchronized between the root servers RS in each timing period through a block chain algorithm, and the specific process is as follows:
(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;
(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;
(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 (4);
if not, judging the times of non-uniformity:
if the number 1 is different, returning to the step (1), and re-receiving the hash code H sent by other root servers RS;
if the number of times is more than 1, the root server RS collects the hash code H of the corresponding transaction server TS;
(4): storing the hash code H obtained this time into a database DB;
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;
the passing criteria are determined by the actual application.
2. A method for authenticating a root block chain composed of a plurality of independent units, which applies the system of claim 1, 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 regularly checks the passing standard of the transaction server TS set under the root server RS, and if the passing standard is not met, the transaction server TS is cancelled to be qualified;
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 difference is more than 1 time, returning to the step 2;
step 3.4: storing the hash code H obtained this time into a database DB;
the number of the plurality of the 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;
the block chain algorithm in the step 3.2 is a hash256 algorithm;
the passing criteria described in step 5 are determined by the actual application.
CN201910774419.5A 2019-08-21 2019-08-21 Root block chain authentication system and method formed by integrating multiple independent units Expired - Fee Related CN110708280B (en)

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 CN110708280A (en) 2020-01-17
CN110708280B true CN110708280B (en) 2021-02-09

Family

ID=69193363

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910774419.5A Expired - Fee Related 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 (8)

* Cited by examiner, † Cited by third party
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
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
CN110138592A (en) * 2019-04-09 2019-08-16 苏宁易购集团股份有限公司 A kind of management method and system of intelligence contract

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107124444B (en) * 2017-03-28 2020-08-04 丽水北斗区块链科技有限责任公司 Method and device for synchronizing block chain data
CN109842655A (en) * 2017-11-28 2019-06-04 北京众享比特科技有限公司 A kind of method of data synchronization of transregional piece of chain network
CN108282474B (en) * 2018-01-18 2020-04-17 山东大学 Block chain based digital asset transaction consistency maintenance method

Patent Citations (8)

* Cited by examiner, † Cited by third party
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
WO2019078411A1 (en) * 2017-10-19 2019-04-25 한국과학기술원 History verification method using block chain configuration between epcis history events
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
CN110708280A (en) 2020-01-17

Similar Documents

Publication Publication Date Title
CN109639632B (en) User information management method based on block chain, electronic equipment and storage medium
US11290441B1 (en) Systems and methods for blockchain validation of user identity and authority
CN110572281B (en) Credible log recording method and system based on block chain
CA2782500C (en) Automated entity verification
CN111382150B (en) Real-time computing method and system based on Flink
CN113438084B (en) Green power source tracing method and system based on R-PBFT consensus algorithm and timestamp
CN110784346A (en) Reputation value-based PBFT consensus system and method
WO2020248658A1 (en) Abnormal account detection method and apparatus
CN108282339B (en) Digital identity retrieving method based on intelligent contracts and self-social media
CN104572976B (en) Website data update method and system
US10019308B1 (en) Disaster-proof event data processing
CN113326165B (en) Data processing method and device based on block chain and computer readable storage medium
US20210092111A1 (en) Network traffic distribution using certificate scanning in agent-based architecture
Jiang et al. A trust-based hierarchical consensus mechanism for consortium blockchain in smart grid
CN110807209B (en) Data processing method, device and storage medium
CN112767151A (en) Transaction processing method and device applied to verification node in block chain
CN110708280B (en) Root block chain authentication system and method formed by integrating multiple independent units
CN107294905A (en) A kind of method and device for recognizing user
US20230169517A1 (en) Compliance model utilizing distributed ledger technology
US10320626B1 (en) Application discovery and dependency mapping
CN115150204B (en) Data transmission system
CN116151826A (en) Efficient and reliable block chain-based power transaction terminal trust management method
CN108011785A (en) One kind is based on cloud government affairs self-aided terminal Homes Using TV computational methods
CN116107801A (en) Transaction processing method and related product
CN112860807A (en) Fault-tolerant consensus method suitable for wireless block chain network

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
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20210209