CN109558527B - Block chain-based high-score query method and device and computer equipment - Google Patents
Block chain-based high-score query method and device and computer equipment Download PDFInfo
- Publication number
- CN109558527B CN109558527B CN201910002948.3A CN201910002948A CN109558527B CN 109558527 B CN109558527 B CN 109558527B CN 201910002948 A CN201910002948 A CN 201910002948A CN 109558527 B CN109558527 B CN 109558527B
- Authority
- CN
- China
- Prior art keywords
- score
- management server
- query
- management
- alliance chain
- 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.)
- Active
Links
Classifications
-
- 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/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Accounting & Taxation (AREA)
- Computer Security & Cryptography (AREA)
- Finance (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Electrically Operated Instructional Devices (AREA)
Abstract
The application discloses a high-score query method, a device, computer equipment and a storage medium based on a blockchain, wherein the method comprises the following steps: each management node of the high-score query alliance chain receives a joining request of a first university for joining the high-score query alliance chain respectively, and each management node judges the authenticity of the joining request respectively; if the authenticity of the joining request passes the verification of all the management nodes, allowing the first university to access the high-score query alliance chain and distributing the high-score query alliance chain to a first private key corresponding to the first university; acquiring a score query instruction and a second private key which are input by a first university; judging whether the second private key is successfully decrypted or not; and if the second private key is successfully decrypted, searching corresponding score information from the management server of each high-consideration score according to the score inquiry instruction. The application can prevent colleges and universities which are not registered in the national education department from inquiring the college and university score of the examinee.
Description
Technical Field
The present application relates to the field of blockchain, and in particular, to a blockchain-based high-score query method, device and computer equipment.
Background
The high score relates to what higher schools the student can enter. The college score is strictly taken care of by the country to prevent the situation of being tampered, but the danger of being tampered still exists, such as hackers invading the college score management system to tamper, staff to tamper with the convenience of the staff to tamper with the law, and the like. Moreover, colleges not registered in the national education department can also send a notice to the examinee, so that part of the examinees do not enter the regular colleges and influence the fate of the examinee.
Blockchain (Blockchain) is a new application mode of computer technologies such as distributed data storage, point-to-point transmission, consensus mechanisms, encryption algorithms, and the like. The common knowledge mechanism is a mathematical algorithm for realizing trust establishment and rights acquisition among different nodes in a block chain system. By using the blockchain technology to record the high-score into the blockchain, the high-score can be effectively prevented from being tampered. But how to avoid that colleges and universities which are not registered in the national education department inquire about the high score of the examinee, no related technical scheme is disclosed at present.
Disclosure of Invention
The application mainly aims to provide a high-score query method, a device, computer equipment and a storage medium based on a blockchain, which aim to solve the technical problem that colleges and universities which are not registered in national education departments can query the high-score.
In order to achieve the above-mentioned problems, the present application provides a high-score query method based on blockchain, comprising the steps of:
each management node of the high-score query alliance chain receives a request of a first college for applying to join the high-score query alliance chain, wherein the joining information comprises a name of the first college and a registration number of the first college in a national education department, and the high-score query alliance chain at least comprises management servers of all places of high-score scores;
each management node respectively judges the authenticity of the joining request;
if the authenticity of the joining request passes the verification of all the management nodes, allowing the first university to access the high-score query alliance chain and distributing the high-score query alliance chain to a first private key corresponding to the first university;
acquiring a score query instruction and a second private key which are input by a first university;
judging whether the second private key is successfully decrypted or not;
And if the second private key is successfully decrypted, searching corresponding score information from the management server of each high-consideration score according to the score inquiry instruction.
Further, before each management node of the high-score query federation chain receives a request for a first university to apply for joining the high-score query federation chain, the method includes:
judging whether the management servers accessed to the high-score query alliance chain contain all first management servers of a designated area or not by using a designated one of the management nodes;
if not, searching a second management server which is not accessed to the high-score query alliance chain in the appointed area;
and when the second management server is found, sending a request for inviting the second management server to join the high-score query alliance chain to the second management server.
Further, the step of determining, by using the designated one of the management nodes, whether the management servers accessing the high-score query federation chain include all first management servers of a designated area includes:
acquiring a first number of all first management servers of the designated area;
Comparing the first number with a second number corresponding to a management server filed in the national education department in the designated area;
and if the first quantity is smaller than the second quantity, judging that the management servers accessing the high-score query alliance chain do not contain all first management servers of a designated area.
Further, the step of searching the designated area for the second management server not accessed to the high-score query federation chain includes:
searching the IP of each recorded management server in the designated area in the server of the national education department;
in the high-score inquiry alliance chain, sending a verification connection request to each recorded management server according to the IP of the recorded management server;
and recording the management server corresponding to the IP which is not fed back to be successfully verified as the second management server.
Further, after the step of sending a request to invite the second management server to join the high score query federation chain to the second management server when the second management server is found, the method includes:
Receiving verification information submitted by the second management server;
distributing the verification information to each other management node;
and when all the management nodes verify that the verification information is true, allowing the second management server to join the high-score query alliance chain.
Further, after the step of searching the corresponding score information from the management server of each high-score according to the score query instruction, the method includes:
marking the information corresponding to the high-score inquired by the first university.
Further, before each management node of the high-score query federation chain receives a request for a first university to apply for joining the high-score query federation chain, the method includes:
judging whether an authorization signal of a designated authority is received when the management server of the college entrance examination score of each place receives the uploaded college entrance examination score;
if yes, the college entrance examination score management server is allowed to receive and store the uploaded college entrance examination score.
The application also provides a high-score query device based on the block chain, which comprises the following components:
the system comprises a receiving unit, a first college and a second college, wherein each management node of the high-score query alliance chain is used for respectively receiving a request for adding the high-score query alliance chain to a first college, the adding information comprises a name of the first college and a registration number of the first college in a national education department, and the high-score query alliance chain at least comprises a management server of the high-score of each place;
A first judging unit, configured to control each of the management nodes to respectively judge the authenticity of the join request;
the joining distribution unit is used for allowing the first university to access the high-score query alliance chain and distributing the first private key corresponding to the first university if the authenticity of the joining request passes the verification of all the management nodes;
the acquisition unit is used for acquiring the score inquiry instruction and the second private key input by the first university;
the second judging unit is used for judging whether the second private key is successfully decrypted or not;
and the searching unit is used for searching corresponding score information from the management server of each high-score according to the score inquiry instruction if the second private key is successfully decrypted.
The application also provides a computer device comprising a memory storing a computer program and a processor implementing the steps of any of the methods described above when the processor executes the computer program.
The application also provides a computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of the method of any of the preceding claims.
According to the block chain-based high-grade score query method, the block chain-based high-grade score query device, the computer equipment and the storage medium, as the management server in the high-grade score query alliance chain and the colleges and universities which can be accessed are approved by the national education department, the colleges and universities which are not registered in the national education department can be prevented from querying the colleges and universities of the examinees, and further the colleges and universities which are not registered in the national education department can be prevented from misleading the colleges and universities which are not registered in the national education department by using the queried scores; according to the non-tamperable property of the blockchain, the access universities can be guaranteed to obtain real high-score scores, and students which do not accord with regulations are prevented from being recruited; meanwhile, the high-grade score of the student can be prevented from being tampered, and the prospect of the student and the fairness of the college entrance are affected.
Drawings
FIG. 1 is a flow chart of a high-score query method based on blockchain in accordance with an embodiment of the present application;
FIG. 2 is a block diagram of a block-chain-based high-score query device according to an embodiment of the present application;
fig. 3 is a block diagram schematically illustrating a structure of a computer device according to an embodiment of the present application.
The achievement of the objects, functional features and advantages of the present application will be further described with reference to the accompanying drawings, in conjunction with the embodiments.
Detailed Description
The present application will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present application more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the application.
Referring to fig. 1, an embodiment of the present application provides a high-score query method based on a blockchain, including the steps of:
s1, each management node of a high-score query alliance chain respectively receives a request of a first college to add the high-score query alliance chain, wherein the adding information comprises a name of the first college and a registration number of the first college in a national education department, and the high-score query alliance chain at least comprises a management server of the high-score of each place;
s2, each management node respectively judges the authenticity of the joining request;
s3, if the authenticity of the joining request passes through the verification of all the management nodes, allowing the first university to access the high-score query alliance chain and distributing the first high-score query alliance chain to a first private key corresponding to the first university;
s4, acquiring a score query instruction and a second private key which are input by the first university;
S5, judging whether the second private key is successfully decrypted or not;
and S6, if the second private key is successfully decrypted, searching corresponding score information from the management server of each high-score according to the score inquiry instruction.
As described in step S1, the management node is a node with a management function selected when the high-score query federation chain is established, and any request for joining the high-score query federation chain in the high-score query federation chain requires authorization with a specific proportion in each management node to access the high-score query federation chain. Each of the above-mentioned management nodes may be an organizer-designated node that initiates a high-score query federation chain, for example, a federation chain node of a college province such as Shandong province, hebei province, henan province, jiangsu province, etc., as a management node. The national education department refers to the department established by the country and belongs to the national management.
As described in step S2 above, each management node determines the authenticity of the joining request, and it does not directly obtain the verification result sent by the other nodes for use, so as to ensure that the verification result of each management node is authentic. The method for judging the authenticity of the joining request comprises the following steps: searching a preset registration number which is the same as the registration number in a university management database of the national education department, checking whether the name corresponding to the preset registration number is the same as the name of the first university if the preset registration number is the same as the registration number, and indicating that the joining request is real if the name is the same as the first university.
As described in step S3 above, in the present application, the first university is allowed to access the high-score coalition chain only if all the management nodes determine that the above-mentioned joining request is authentic. After the access high-score query alliance chain is accessed, a corresponding private key is allocated to the first university, and when the first university needs to enter the high-score query alliance chain to query the high-score, the first university needs to input the allocated private key to log in.
As described in the above step S4, the score query instruction includes various types, such as, for example, querying a college score of a certain region, querying an average score of a certain region, a score line of a certain region, a special department, etc. The second private key is a key for verifying whether the first university can log into a high-score query federation chain. Because the first private key is distributed to the first university, if the first private key is true, the second private key input by the first university is necessarily the same as the first private key (except for the case of wrong input), the first university can smoothly log in the high-score query alliance chain, and if other universities which are not registered in the national education department impersonate the first university to log in the high-score query alliance chain, the second private key which is the same as the first private key is difficult to input by the first university, so that the colleges which are not registered in the national education department impersonate the colleges registered in the national education department can be effectively prevented from being queried for the high-score.
As described in the above steps S5 and S6, it is determined whether the second private key input by the first university can unlock the public key of the high-score query federation chain, and if so, it is indicated that the first university can access the federation chain, and then the score query instruction is executed.
In one embodiment, before each management node of the high-score query federation chain receives the step S1 of applying for joining the high-score query federation chain to the first university, the method includes:
s101, judging whether the management servers accessed to the high-score query alliance chain contain all first management servers of a designated area by using a designated management node;
s102, if not, searching a second management server which is not accessed to the high-score query alliance chain in the designated area;
and S103, when the second management server is found, sending a request for inviting the second management server to join the high-score query alliance chain to the second management server.
In this embodiment, when the high-score query alliance chain is established, all the management servers of the high-score scores of all the places in the country need to be accessed into the high-score query alliance chain, so that all the universities accessed can comprehensively find the high-score conditions of all the regions. However, when the high-score query alliance chain is established, there may be a case where a certain management server is not accessed to the high-score query alliance chain, so that it is necessary to search for the management server that is not accessed to the high-score query alliance chain. The designated area includes all domestic areas or different areas such as China, south China, north China and the like, and can be set according to specific conditions. In this embodiment, the above-mentioned query is performed by using a designated one of the management nodes, and because the number of the management servers of the college entrance examination score in the whole country is not very large, one management node is required to calculate, and each management node is not required to perform all the calculation, so as to save the calculation resources in the federation chain. The specific method for searching the second management server which is not accessed into the high-score query alliance chain comprises various methods, such as traversing the IP of all management servers submitted by each region to search for the second management server and the like.
In a specific embodiment, the step S101 of determining, by using the designated one of the management nodes, whether the management servers accessing the high-score query federation chain include all the first management servers of the designated area includes:
acquiring a first number of all first management servers of the designated area;
comparing the first number with a second number corresponding to a management server filed in the national education department in the designated area;
and if the first quantity is smaller than the second quantity, judging that the management servers accessing the high-score query alliance chain do not contain all first management servers of a designated area.
In this embodiment, the number of management servers per designated area is fixed, for example, one management server per provincial area is provided, and the like. Taking the national range as a designated area as an example, the designated area has a plurality of provinces, and the designated area has a plurality of management servers, all of the management servers need to be recorded by the national education department, and only the data provided by the recorded management servers can be acknowledged and used by the universities of the country. When the designated area is determined, then the number of its corresponding management servers is also determined, i.e., the second number. Comparing the first number with the second number, it can be quickly determined whether the management server of the high-score query federation chain contains all the first management servers of the designated area, etc.
In one embodiment, the step S102 of searching for the second management server in the specified area that is not accessed to the high-score query federation chain includes:
searching the IP of each recorded management server in the designated area in the server of the national education department;
in the high-score inquiry alliance chain, sending a verification connection request to each recorded management server according to the IP of the recorded management server;
and recording the management server corresponding to the IP which is not fed back to be successfully verified as the second management server.
In this embodiment, a verification connection request is sent to each known IP in the high-score query federation chain, and then only each management server in the federation chain is connected, without searching the whole network, so that a second management server not in the high-score query federation chain can be quickly searched.
In one embodiment, after the step S103 of sending a request for inviting the second management server to join the high-score query federation chain to the second management server when the second management server is found, the method includes:
receiving verification information submitted by the second management server;
Distributing the verification information to each other management node;
and when all the management nodes verify that the verification information is true, allowing the second management server to join the high-score query alliance chain.
In this embodiment, although the second management server receives the request for inviting to join the high-score query federation chain, the high-score query federation chain may be joined only after all management nodes still need to be approved when actually joining the high-score query federation chain.
In one embodiment, after the step S6 of searching the corresponding score information from the management server of each high-score according to the score query instruction, the method includes:
marking the information corresponding to the high-score inquired by the first university.
In this embodiment, the high-score inquired by the university and the corresponding information thereof are marked, so that when students, teachers and the like inquire scores, whether the inquired scores of the students are watched by the university or not can be seen. The information corresponding to the high-score generally includes student status information and the like. The marks can be school badge of colleges and universities, abbreviations of the colleges and universities and the like; the method can also record different colors and the quantity thereof, for example, one college uses red for representation, two colleges uses green for representation, three colleges uses yellow for representation, numbers can be displayed on different colors, for example, 5 is displayed on red, and the fact that 5 colleges inquire the high-consideration score and corresponding information and the like.
In one embodiment, before each management node of the high-score query federation chain receives the step S1 of applying for joining the high-score query federation chain to the first university, the method includes:
judging whether an authorization signal of a designated authority is received when the management server of the college entrance examination score of each place receives the uploaded college entrance examination score;
if yes, the college entrance examination score management server is allowed to receive and store the uploaded college entrance examination score.
In this embodiment, the college entrance examination score is not uploaded randomly, but only after being checked, for example, manual check, and the like, and only after checking, the college entrance examination score can be uploaded without errors, and the regional authorization is required to be uploaded when the college entrance examination score is uploaded, and only after the authorization signal is received, the college entrance examination score can be successfully uploaded, and after the uploading is successful, the score in the college entrance examination score management server can not be tampered by other people, so that the circumstance that the college entrance examination score is changed by a series of ways and is replaced by an impersonation is prevented.
According to the block chain-based high-score query method, as the management server in the high-score query alliance chain and the colleges which can be accessed are approved by the national education department, colleges and universities which are not registered in the national education department can be prevented from querying the colleges and universities of the examinees, and further, the colleges and universities which are not registered in the national education department can be prevented from misleading the colleges and universities which are not registered in the national education department by using the queried results; according to the non-tamperable property of the blockchain, the access universities can be guaranteed to obtain real high-score scores, and students which do not accord with regulations are prevented from being recruited; meanwhile, the high-grade score of the student can be prevented from being tampered, and the prospect of the student and the fairness of the college entrance are affected.
Referring to fig. 2, an embodiment of the present application provides a high-score query device based on a blockchain, including:
a first receiving unit 10, configured to receive, by using each management node of a high-score query alliance chain, a request for a first college to apply for joining in the high-score query alliance chain, where the joining information includes a name of the first college and a registration number of the first college in a national education department, and the high-score query alliance chain includes at least a management server for each local high-score;
a first judging unit 20, configured to control each of the management nodes to respectively judge the authenticity of the join request;
a joining distribution unit 30, configured to allow the first university to access the high-score query federation chain and distribute the first high-score query federation chain to a first private key corresponding to the first university if the authenticity of the joining request passes verification of all the management nodes;
an obtaining unit 40, configured to obtain a score query instruction and a second private key that are input by the first university;
a second judging unit 50, configured to judge whether the second private key is successfully decrypted;
and the first searching unit 60 searches the corresponding score information from the management server of each high-consideration score according to the score inquiry instruction if the second private key is successfully decrypted.
In the receiving unit 10, the management node is a node with a management function selected when the high-score query federation chain is established, and any request for joining the high-score query federation chain in the high-score query federation chain needs a specific proportion of authorization in each management node to access the high-score query federation chain. Each of the above-mentioned management nodes may be an organizer-designated node that initiates a high-score query federation chain, for example, a federation chain node of a college province such as Shandong province, hebei province, henan province, jiangsu province, etc., as a management node. The national education department refers to the department established by the country and belongs to the national management.
As described in the first determining unit 20, each management node determines the authenticity of the joining request, and it does not directly obtain the verification result sent by the other nodes for use, so as to ensure that the verification result of each management node is authentic. The method for judging the authenticity of the joining request comprises the following steps: searching a preset registration number which is the same as the registration number in a university management database of the national education department, checking whether the name corresponding to the preset registration number is the same as the name of the first university if the preset registration number is the same as the registration number, and indicating that the joining request is real if the name is the same as the first university.
As with the join distribution unit 30 described above, in the present application, the first university is permitted to access the high-score coalition chain only if all the management nodes determine that the join request is authentic. After the access high-score query alliance chain is accessed, a corresponding private key is allocated to the first university, and when the first university needs to enter the high-score query alliance chain to query the high-score, the first university needs to input the allocated private key to log in.
As the acquisition unit 40, the score inquiry instruction includes various types such as inquiring about a score of a college entrance of a certain area, inquiring about an average score of a certain area, a score line of a certain area, a special department, etc. The second private key is a key for verifying whether the first university can log into a high-score query federation chain. Because the first private key is distributed to the first university, if the first private key is true, the second private key input by the first university is necessarily the same as the first private key (except for the case of wrong input), the first university can smoothly log in the high-score query alliance chain, and if other universities which are not registered in the national education department impersonate the first university to log in the high-score query alliance chain, the second private key which is the same as the first private key is difficult to input by the first university, so that the colleges which are not registered in the national education department impersonate the colleges registered in the national education department can be effectively prevented from being queried for the high-score.
The second judging unit 50 and the searching unit 60 judge whether the second private key input by the first university can unlock the public key of the high-score query federation chain, if so, the first university can be accessed into the federation chain, and then execute the score query instruction.
In one embodiment, the above-mentioned high-score query device based on blockchain further includes:
a third judging unit configured to judge, by using a specified one of the management nodes, whether the management servers accessing the high-score query federation chain include all first management servers of a specified area;
the second searching unit is used for searching a second management server which is not accessed into the high-score query alliance chain in the appointed area if the management server which is accessed into the high-score query alliance chain does not contain all the first management servers in the appointed area;
and the sending request unit is used for sending a request for inviting the second management server to join the high-score query alliance chain to the second management server when the second management server is found.
In this embodiment, when the high-score query alliance chain is established, all the management servers of the high-score scores of all the places in the country need to be accessed into the high-score query alliance chain, so that all the universities accessed can comprehensively find the high-score conditions of all the regions. However, when the high-score query alliance chain is established, there may be a case where a certain management server is not accessed to the high-score query alliance chain, so that it is necessary to search for the management server that is not accessed to the high-score query alliance chain. The designated area includes all domestic areas or different areas such as China, south China, north China and the like, and can be set according to specific conditions. In this embodiment, the above-mentioned query is performed by using a designated one of the management nodes, and because the number of the management servers of the college entrance examination score in the whole country is not very large, one management node is required to calculate, and each management node is not required to perform all the calculation, so as to save the calculation resources in the federation chain. The specific method for searching the second management server which is not accessed into the high-score query alliance chain comprises various methods, such as traversing the IP of all management servers submitted by each region to search for the second management server and the like.
In a specific embodiment, the third determining unit includes:
an acquisition module, configured to acquire a first number of all first management servers in the specified area;
a comparison module for comparing the first number with a second number corresponding to a management server filed in the national education department in the designated area;
and the judging module is used for judging that the management server accessing the high-score query alliance chain does not contain all the first management servers of the designated area if the first number is smaller than the second number.
In this embodiment, the number of management servers per designated area is fixed, for example, one management server per provincial area is provided, and the like. Taking the national range as a designated area as an example, the designated area has a plurality of provinces, and the designated area has a plurality of management servers, all of the management servers need to be recorded by the national education department, and only the data provided by the recorded management servers can be acknowledged and used by the universities of the country. When the designated area is determined, then the number of its corresponding management servers is also determined, i.e., the second number. Comparing the first number with the second number, it can be quickly determined whether the management server of the high-score query federation chain contains all the first management servers of the designated area, etc.
In one embodiment, the second search unit includes:
the searching module is used for searching the IP of each recorded management server in the designated area in the server of the national education department;
the verification request module is used for sending verification connection requests to each recorded management server according to the IP of the recorded management server in the high-score inquiry alliance chain;
and the recording module is used for recording the management server corresponding to the IP which is not successfully verified in feedback as the second management server.
In this embodiment, a verification connection request is sent to each known IP in the high-score query federation chain, and then only each management server in the federation chain is connected, without searching the whole network, so that a second management server not in the high-score query federation chain can be quickly searched.
In one embodiment, the above-mentioned high-score query device based on blockchain further includes:
the second receiving unit is used for receiving the verification information submitted by the second management server;
a distribution unit configured to distribute the authentication information to each of the other management nodes;
and the joining unit is used for allowing the second management server to join the high-score query alliance chain when all the management nodes verify that the verification information is true.
In this embodiment, although the second management server receives the request for inviting to join the high-score query federation chain, the high-score query federation chain may be joined only after all management nodes still need to be approved when actually joining the high-score query federation chain.
In one embodiment, the above-mentioned high-score query device based on blockchain further includes:
the marking unit is used for marking the high-score inquired by the first university and the information corresponding to the high-score.
In this embodiment, the high-score inquired by the university and the corresponding information thereof are marked, so that when students, teachers and the like inquire scores, whether the inquired scores of the students are watched by the university or not can be seen. The information corresponding to the high-score generally includes student status information and the like. The marks can be school badge of colleges and universities, abbreviations of the colleges and universities and the like; the method can also record different colors and the quantity thereof, for example, one college uses red for representation, two colleges uses green for representation, three colleges uses yellow for representation, numbers can be displayed on different colors, for example, 5 is displayed on red, and the fact that 5 colleges inquire the high-consideration score and corresponding information and the like.
In one embodiment, the above-mentioned high-score query device based on blockchain further includes:
the receiving authorization unit is used for judging whether an authorization signal of a designated authority is received when the management server of the college entrance examination scores in each place receives the uploaded college entrance examination scores;
and the uploading unit is used for allowing the college entrance examination score management server to receive and store the uploaded college entrance examination score if the authorization signal of the designated authority is received.
In this embodiment, the college entrance examination score is not uploaded randomly, but only after being checked, for example, manual check, and the like, and only after checking, the college entrance examination score can be uploaded without errors, and the regional authorization is required to be uploaded when the college entrance examination score is uploaded, and only after the authorization signal is received, the college entrance examination score can be successfully uploaded, and after the uploading is successful, the score in the college entrance examination score management server can not be tampered by other people, so that the circumstance that the college entrance examination score is changed by a series of ways and is replaced by an impersonation is prevented.
According to the block chain-based high-score query device, as the management server in the high-score query alliance chain and the colleges which can be accessed are approved by the national education department, colleges and universities which are not registered in the national education department can be prevented from querying the colleges and universities of the examinees, and further, the colleges and universities which are not registered in the national education department can be prevented from misleading the colleges and universities which are not registered in the national education department by using the queried results; according to the non-tamperable property of the blockchain, the access universities can be guaranteed to obtain real high-score scores, and students which do not accord with regulations are prevented from being recruited; meanwhile, the high-grade score of the student can be prevented from being tampered, and the prospect of the student and the fairness of the college entrance are affected.
Referring to fig. 3, in an embodiment of the present application, a computer device is further provided, where the computer device may be the above-mentioned management server, or a server corresponding to a management node, and an internal structure of the computer device may be as shown in fig. 3. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the computer is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, computer programs, and a database. The memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The database of the computer equipment is used for storing data such as high-consideration scores, college information and the like. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program, when executed by a processor, implements a blockchain-based high-score query method.
The processor executes the high-score query method based on the blockchain, and the method comprises the following steps: each management node of the high-score query alliance chain receives a request of a first college for applying to join the high-score query alliance chain, wherein the joining information comprises a name of the first college and a registration number of the first college in a national education department, and the high-score query alliance chain at least comprises management servers of all places of high-score scores; each management node respectively judges the authenticity of the joining request; if the authenticity of the joining request passes the verification of all the management nodes, allowing the first university to access the high-score query alliance chain and distributing the high-score query alliance chain to a first private key corresponding to the first university; acquiring a score query instruction and a second private key which are input by a first university; judging whether the second private key is successfully decrypted or not; and if the second private key is successfully decrypted, searching corresponding score information from the management server of each high-consideration score according to the score inquiry instruction.
In one embodiment, before each management node of the high-score query federation chain receives a request for a first university to join the high-score query federation chain, the method includes: judging whether the management servers accessed to the high-score query alliance chain contain all first management servers of a designated area or not by using a designated one of the management nodes; if not, searching a second management server which is not accessed to the high-score query alliance chain in the appointed area; and when the second management server is found, sending a request for inviting the second management server to join the high-score query alliance chain to the second management server.
In one embodiment, the step of determining, by using the designated one of the management nodes, whether the management servers accessing the high-score query federation chain include all the first management servers of the designated area includes: acquiring a first number of all first management servers of the designated area; comparing the first number with a second number corresponding to a management server filed in the national education department in the designated area; and if the first quantity is smaller than the second quantity, judging that the management servers accessing the high-score query alliance chain do not contain all first management servers of a designated area.
In one embodiment, the step of searching the designated area for the second management server that is not accessed in the high-score query federation chain includes: searching the IP of each recorded management server in the designated area in the server of the national education department; in the high-score inquiry alliance chain, sending a verification connection request to each recorded management server according to the IP of the recorded management server; and recording the management server corresponding to the IP which is not fed back to be successfully verified as the second management server.
In one embodiment, after the step of sending the request for inviting the second management server to join the high-score query federation chain to the second management server when the second management server is found, the method includes: receiving verification information submitted by the second management server;
distributing the verification information to each other management node; and when all the management nodes verify that the verification information is true, allowing the second management server to join the high-score query alliance chain.
In one embodiment, after the step of searching the corresponding score information from the management server of each high-score according to the score query instruction, the method includes: marking the information corresponding to the high-score inquired by the first university.
In one embodiment, before each management node of the high-score query federation chain receives a request for a first university to join the high-score query federation chain, the method includes: judging whether an authorization signal of a designated authority is received when the management server of the college entrance examination score of each place receives the uploaded college entrance examination score; if yes, the college entrance examination score management server is allowed to receive and store the uploaded college entrance examination score.
It will be appreciated by those skilled in the art that the architecture shown in fig. 3 is merely a block diagram of a portion of the architecture in connection with the present inventive arrangements and is not intended to limit the computer devices to which the present inventive arrangements are applicable.
The computer equipment of the embodiment of the application can prevent colleges and universities which are not registered in the national education department from inquiring the college score of the examinee because the management server in the high-score inquiry alliance chain and the colleges and universities which can be accessed are approved by the national education department, thereby preventing the colleges and universities which are not registered in the national education department from misleading the colleges and universities by the inquired score from reading the colleges and universities which are not registered in the national education department; according to the non-tamperable property of the blockchain, the access universities can be guaranteed to obtain real high-score scores, and students which do not accord with regulations are prevented from being recruited; meanwhile, the high-grade score of the student can be prevented from being tampered, and the prospect of the student and the fairness of the college entrance are affected.
An embodiment of the present application also provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements a blockchain-based high-score query method, comprising the steps of: each management node of the high-score query alliance chain receives a request of a first college for applying to join the high-score query alliance chain, wherein the joining information comprises a name of the first college and a registration number of the first college in a national education department, and the high-score query alliance chain at least comprises management servers of all places of high-score scores; each management node respectively judges the authenticity of the joining request; if the authenticity of the joining request passes the verification of all the management nodes, allowing the first university to access the high-score query alliance chain and distributing the high-score query alliance chain to a first private key corresponding to the first university; acquiring a score query instruction and a second private key which are input by a first university; judging whether the second private key is successfully decrypted or not; and if the second private key is successfully decrypted, searching corresponding score information from the management server of each high-consideration score according to the score inquiry instruction.
According to the block chain-based high-score query method, as the management server in the high-score query alliance chain and the colleges which can be accessed are approved by the national education department, colleges and universities which are not registered in the national education department can be prevented from querying the colleges and universities of the examinees, and further, the colleges and universities which are not registered in the national education department can be prevented from misleading the colleges and universities which are not registered in the national education department by using the queried results; according to the non-tamperable property of the blockchain, the access universities can be guaranteed to obtain real high-score scores, and students which do not accord with regulations are prevented from being recruited; meanwhile, the high-grade score of the student can be prevented from being tampered, and the prospect of the student and the fairness of the college entrance are affected.
In one embodiment, before each management node of the high-score query federation chain receives a request for a first university to join the high-score query federation chain, the method includes: judging whether the management servers accessed to the high-score query alliance chain contain all first management servers of a designated area or not by using a designated one of the management nodes; if not, searching a second management server which is not accessed to the high-score query alliance chain in the appointed area; and when the second management server is found, sending a request for inviting the second management server to join the high-score query alliance chain to the second management server.
In one embodiment, the step of determining, by using the designated one of the management nodes, whether the management servers accessing the high-score query federation chain include all the first management servers of the designated area includes: acquiring a first number of all first management servers of the designated area; comparing the first number with a second number corresponding to a management server filed in the national education department in the designated area; and if the first quantity is smaller than the second quantity, judging that the management servers accessing the high-score query alliance chain do not contain all first management servers of a designated area.
In one embodiment, the step of searching the designated area for the second management server that is not accessed in the high-score query federation chain includes: searching the IP of each recorded management server in the designated area in the server of the national education department; in the high-score inquiry alliance chain, sending a verification connection request to each recorded management server according to the IP of the recorded management server; and recording the management server corresponding to the IP which is not fed back to be successfully verified as the second management server.
In one embodiment, after the step of sending the request for inviting the second management server to join the high-score query federation chain to the second management server when the second management server is found, the method includes: receiving verification information submitted by the second management server;
distributing the verification information to each other management node; and when all the management nodes verify that the verification information is true, allowing the second management server to join the high-score query alliance chain.
In one embodiment, after the step of searching the corresponding score information from the management server of each high-score according to the score query instruction, the method includes: marking the information corresponding to the high-score inquired by the first university.
In one embodiment, before each management node of the high-score query federation chain receives a request for a first university to join the high-score query federation chain, the method includes: judging whether an authorization signal of a designated authority is received when the management server of the college entrance examination score of each place receives the uploaded college entrance examination score; if yes, the college entrance examination score management server is allowed to receive and store the uploaded college entrance examination score.
Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium provided by the present application and used in embodiments may include non-volatile and/or volatile memory. The nonvolatile memory can include Read Only Memory (ROM), programmable ROM (PROM), electrically Programmable ROM (EPROM), electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), dual speed data rate SDRAM (SSRSDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), memory bus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), among others.
The foregoing description is only of the preferred embodiments of the present application and is not intended to limit the scope of the application, and all equivalent structures or equivalent processes using the descriptions and drawings of the present application or directly or indirectly applied to other related technical fields are included in the scope of the application.
Claims (6)
1. A high-score query method based on a block chain is characterized by comprising the following steps:
each management node of the high-score query alliance chain receives a request for a first college to apply for joining the high-score query alliance chain, wherein the joining request comprises a name of the first college and a registration number of the first college in a national education department, and the high-score query alliance chain at least comprises management servers of all places of high-score scores;
each management node respectively judges the authenticity of the joining request;
if the authenticity of the joining request passes the verification of all the management nodes, allowing the first university to access the high-score query alliance chain and distributing the high-score query alliance chain to a first private key corresponding to the first university;
acquiring a score query instruction and a second private key which are input by a first university;
Judging whether the second private key is successfully decrypted or not;
if the second private key is successfully decrypted, corresponding score information is searched for in the management server of each high-consideration score according to the score inquiry instruction;
before each management node of the high-score query alliance chain receives a step of applying for joining the high-score query alliance chain by a first university, the method comprises the following steps:
judging whether the management servers accessed to the high-score query alliance chain contain all first management servers of a designated area or not by using a designated one of the management nodes;
if not, searching a second management server which is not accessed to the high-score query alliance chain in the appointed area;
when the second management server is found, sending a request for inviting the second management server to join the high-score query alliance chain to the second management server;
the step of searching the designated area for the second management server which is not accessed into the high-score query alliance chain comprises the following steps:
searching the IP of each recorded management server in the designated area in the server of the national education department;
In the high-score inquiry alliance chain, sending a verification connection request to each recorded management server according to the IP of the recorded management server;
recording an IP corresponding management server which is not successfully verified by feedback as the second management server;
after the step of sending a request to invite the second management server to join the high-score query federation chain to the second management server when the second management server is found, the method includes:
receiving verification information submitted by the second management server;
distributing the verification information to each other management node;
when all the management nodes verify that the verification information is true, allowing the second management server to join the high-score query alliance chain
Before each management node of the high-score query alliance chain receives a step of applying for joining the high-score query alliance chain by a first university, the method comprises the following steps:
judging whether an authorization signal of a designated authority is received when the management server of the college entrance examination score of each place receives the uploaded college entrance examination score;
if yes, the college entrance examination score management server is allowed to receive and store the uploaded college entrance examination score.
2. A blockchain-based high score query method as in claim 1, wherein the step of determining, with a designated one of the management nodes, whether the management server accessing the high score query coalition chain contains all of the first management servers of the designated area comprises:
acquiring a first number of all first management servers of the designated area;
comparing the first number with a second number corresponding to a management server filed in the national education department in the designated area;
and if the first quantity is smaller than the second quantity, judging that the management servers accessing the high-score query alliance chain do not contain all first management servers of a designated area.
3. A blockchain-based high score query method according to claim 1, wherein after the step of searching the corresponding score information from the management server for each high score according to the score query instruction, the method includes:
marking the information corresponding to the high-score inquired by the first university.
4. A blockchain-based high score query device for performing the blockchain-based high score query method of any of claims 1-3, comprising:
The system comprises a receiving unit, a first college and a second college, wherein each management node of the high-score query alliance chain is used for respectively receiving a joining request of a first college for joining the high-score query alliance chain, the joining request comprises a name of the first college and a registration number of the first college in a national education department, and the high-score query alliance chain at least comprises a management server of the high-score of each place;
a first judging unit, configured to control each of the management nodes to respectively judge the authenticity of the join request;
the joining distribution unit is used for allowing the first university to access the high-score query alliance chain and distributing the first private key corresponding to the first university if the authenticity of the joining request passes the verification of all the management nodes;
the acquisition unit is used for acquiring the score inquiry instruction and the second private key input by the first university;
the second judging unit is used for judging whether the second private key is successfully decrypted or not;
and the searching unit is used for searching corresponding score information from the management server of each high-score according to the score inquiry instruction if the second private key is successfully decrypted.
5. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the method of any of claims 1 to 3 when the computer program is executed.
6. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910002948.3A CN109558527B (en) | 2019-01-02 | 2019-01-02 | Block chain-based high-score query method and device and computer equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910002948.3A CN109558527B (en) | 2019-01-02 | 2019-01-02 | Block chain-based high-score query method and device and computer equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109558527A CN109558527A (en) | 2019-04-02 |
| CN109558527B true CN109558527B (en) | 2023-10-20 |
Family
ID=65872433
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910002948.3A Active CN109558527B (en) | 2019-01-02 | 2019-01-02 | Block chain-based high-score query method and device and computer equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109558527B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111740966B (en) * | 2020-06-10 | 2021-10-15 | 腾讯科技（深圳）有限公司 | Data processing method based on block chain network and related equipment |
| CN112258360A (en) * | 2020-12-22 | 2021-01-22 | 思创数码科技股份有限公司 | Student score management method, system and readable storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015077378A1 (en) * | 2013-11-19 | 2015-05-28 | Sunrise Tech Group, Llc | Block mining methods and apparatus |
| CN106339639A (en) * | 2016-08-30 | 2017-01-18 | 弗洛格（武汉）信息科技有限公司 | Credit score management method and system based on block chain |
| CN107257341A (en) * | 2017-06-21 | 2017-10-17 | 济南浪潮高新科技投资发展有限公司 | A kind of student status based on block chain reviews authentication method |
| GB201714841D0 (en) * | 2017-01-27 | 2017-11-01 | Zensar Tech Ltd | A system and method for evaluating the feasibility of introducing a new node in a blockchain infrastructure |
| CN108009830A (en) * | 2017-12-14 | 2018-05-08 | 上海密尔克卫化工储存有限公司 | Products in circulation tracking and system based on block chain |
| CN108446314A (en) * | 2018-02-07 | 2018-08-24 | 平安科技（深圳）有限公司 | A kind of student information storage method, computer readable storage medium and terminal device |
| CN109002527A (en) * | 2018-07-13 | 2018-12-14 | 江苏开放大学（江苏城市职业学院） | A method of its management online exam of network test system and utilization based on block chain |
-
2019
- 2019-01-02 CN CN201910002948.3A patent/CN109558527B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015077378A1 (en) * | 2013-11-19 | 2015-05-28 | Sunrise Tech Group, Llc | Block mining methods and apparatus |
| CN106339639A (en) * | 2016-08-30 | 2017-01-18 | 弗洛格（武汉）信息科技有限公司 | Credit score management method and system based on block chain |
| GB201714841D0 (en) * | 2017-01-27 | 2017-11-01 | Zensar Tech Ltd | A system and method for evaluating the feasibility of introducing a new node in a blockchain infrastructure |
| CN107257341A (en) * | 2017-06-21 | 2017-10-17 | 济南浪潮高新科技投资发展有限公司 | A kind of student status based on block chain reviews authentication method |
| CN108009830A (en) * | 2017-12-14 | 2018-05-08 | 上海密尔克卫化工储存有限公司 | Products in circulation tracking and system based on block chain |
| CN108446314A (en) * | 2018-02-07 | 2018-08-24 | 平安科技（深圳）有限公司 | A kind of student information storage method, computer readable storage medium and terminal device |
| CN109002527A (en) * | 2018-07-13 | 2018-12-14 | 江苏开放大学（江苏城市职业学院） | A method of its management online exam of network test system and utilization based on block chain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109558527A (en) | 2019-04-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108595126B (en) | Data storage system, query method, query device, server, and storage medium | |
| CN111368230B (en) | Processing method and device for industrial Internet identification based on blockchain | |
| CN107943996B (en) | Learning calendar query method and device based on block chain | |
| CN110956470A (en) | Block chain-based personal experience information processing method and device | |
| Agrawal et al. | Privacy and security of Aadhaar: a computer science perspective | |
| CN110309259B (en) | Audit result data storage and query methods, and audit item storage method and device | |
| CN105868596B (en) | The method and apparatus of identity real name certification | |
| CN109558527B (en) | Block chain-based high-score query method and device and computer equipment | |
| CN106603225B (en) | The verification method of Information Authentication is provided for business information services device | |
| CN109242404B (en) | Resume information management method, resume information management device, computer equipment and readable storage medium | |
| KR20230072462A (en) | Certificate management server based on blockchain and method thereof and computer program | |
| CN112231284A (en) | Block chain-based big data sharing system, method, device and storage medium | |
| CN112235260B (en) | Anonymous data storage method, device, equipment and storage medium | |
| US20240096160A1 (en) | Distributed Voting Platform | |
| CN112163199B (en) | Login authentication method, device, equipment and storage medium using public account | |
| CN107786343A (en) | A kind of access method and system in privately owned mirror image warehouse | |
| CN111125256A (en) | User credit authentication method, device, equipment and storage medium based on block chain | |
| CN112633854A (en) | Student archive management system based on block chain | |
| CN110955699A (en) | Decentralized electronic academic certificate checking method and system | |
| CN103188208B (en) | Authority control method, system and the call center of web page access | |
| CN108334792B (en) | Financial industry foreign aid information sharing method and device | |
| CN110909388B (en) | Decentralized electronic calendar management system and method | |
| CN111666554B (en) | Certificate authentication method, device, equipment and storage medium | |
| CN111680331B (en) | System and method for managing length-checking mailbox based on block chain | |
| CN111488449A (en) | Student at school information evidence storing method based on permission block chain |
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 |