A Student Information Encryption Method and System

Abstract

The present invention relates to the field of information encryption technology, and specifically discloses a method and system for encrypting student information. The method includes converting experience information to obtain experience units with time tags; comparing the converted experience units, clustering the experience units, folding the experience units according to the clustering results to obtain an experience map; comparing the experience maps of different students, calculating the student similarity, for any student, selecting students whose student similarity is less than a preset similarity threshold as the encryption source, reading the experience map of the encryption source, and performing replacement encryption on the experience map of the current student; when receiving an information query request uploaded by a student, verifying the student, and decrypting and feeding back the replacement-encrypted experience map in a gradient manner according to the verification result; essentially, the present invention is an encryption process based on the memory of the student himself, with a very high degree of encryption and extremely high security.

Description

Technical Field

[0001] The present invention relates to the technical field of information encryption, and specifically to a method and system for encrypting student information. Background Art

[0002] Student information is a very broad concept, generally referring to students' identity information. Since the amount of identity information is very small, some conventional data tables can be used to count student information; with the progress of technology, the concept of student information is also expanding. Some learning behaviors of students during their study careers can also be called student information. It can be imagined that the amount of this kind of student information is very large and can fully reflect a student's learning trajectory. Its importance is extremely high and it needs to be encrypted. How to provide a data encryption solution to ensure the security of student information is the technical problem that the technical solution of the present invention wants to solve. Summary of the Invention

[0003] The purpose of the present invention is to provide a method and system for encrypting student information to solve the problems raised in the above background art.

[0004] To achieve the above purpose, the present invention provides the following technical solutions:

[0005] A method for encrypting student information, the method comprising:

[0006] Based on a dynamic permission library, the granted permissions of each student are updated in real time;

[0007] For each student in the permission library, receive the experience information uploaded by the student, verify the experience information, and based on the verification result, convert the experience information to obtain an experience unit containing a time tag;

[0008] Compare the converted experience units, cluster the experience units, and fold the experience units according to the clustering result to obtain an experience map;

[0009] Compare the experience maps of different students, calculate the student similarity, for any student, select the students whose student similarity is less than a preset similarity threshold as the encryption source, read the experience map of the encryption source, and perform replacement encryption on the experience map of the current student;

[0010] When receiving a student's information query request, verify the student, and decrypt and feedback the replaced and encrypted experience map in a gradient manner according to the verification result; wherein, the gradient feedback process includes adjusting the verification level according to the student's information query request, and determining whether to perform the decryption operation according to the verification results of different verification levels.

[0011] As a further solution of the present invention: for each student in the permission library, the steps of receiving the experience information uploaded by the student, verifying the experience information, and converting the experience information based on the verification result to obtain an experience unit with a time tag include:

[0012] For each student in the permission library, receive the experience type, experience name, experience duration, and experience performance uploaded by the student; the experience type includes courses, activities, and internships, and the evaluation criteria for the experience performance are determined by the experience type;

[0013] Send a verification request to the student, receive the proof file uploaded by the student, and verify the proof file based on a preset proof file library;

[0014] When the verification passes, query the unit shape in a preset shape library according to the experience type, create a unit label according to the experience name and experience duration, determine the unit size according to the experience performance, and create an experience unit according to the unit shape, unit label, and unit size; the unit label contains a time tag;

[0015] When the verification fails, send the proof file to the artificial end, receive the verification result feedback from the artificial end. When the verification result is true, it is determined that the verification passes, and update the proof file library according to the proof file; when the verification result is false, generate an error message and feedback it to the student.

[0016] As a further solution of the present invention: the steps of comparing the obtained experience units, clustering the experience units, and folding the experience units according to the clustering result to obtain an experience map include:

[0017] For the same student, arrange the experience units in the horizontal axis direction according to the time sequence;

[0018] Select the unclassified experience unit as the reference unit in turn, and determine the clustering threshold according to the time difference between it and other experience units; the clustering threshold is proportional to the time difference;

[0019] Compare other experience units with the reference unit to obtain the experience similarity. When the experience similarity reaches the clustering threshold, classify them into one category;

[0020] Read the total number of experience units in each category, and arrange the experience units in each category on the vertical axis to obtain an experience map.

[0021] As a further solution of the present invention: the steps of comparing the experience maps of different students, calculating the student similarity, selecting, for any student, the students with a student similarity less than a preset similarity threshold as the encryption source, reading the experience map of the encryption source, and performing replacement encryption on the experience map of the current student include:

[0022] Compare the experience graphs of different students and calculate the student similarity;

[0023] For any student, query the student similarity with other students. When the student similarity is less than the preset similarity threshold, select the corresponding student as the encryption source;

[0024] Receive the encryption level input by the student, determine the encryption quantity according to the encryption level, and select various experience units to be encrypted in the student's experience graph according to the encryption quantity;

[0025] Read the experience graph of the encryption source and encrypt various experience units to be encrypted in a replacement manner based on the experience graph of the encryption source.

[0026] As a further solution of the present invention: the step of reading the experience graph of the encryption source and encrypting various experience units to be encrypted in a replacement manner based on the experience graph of the encryption source includes:

[0027] Randomly select an encryption source, read the experience graph of the encryption source, and randomly select a type of experience unit to be encrypted in the experience graph of the current student;

[0028] Query the experience graph of the encryption source and calculate the similarity between various experience units in the experience graph of the encryption source and the randomly selected type of experience unit to be encrypted;

[0029] Select the type of experience unit with the largest similarity in the experience graph of the encryption source to replace the randomly selected type of experience unit to be encrypted;

[0030] Synchronously record the replacement process.

[0031] As a further solution of the present invention: the step of verifying the student when receiving an information query request uploaded by the student and decrypting and feeding back the replaced and encrypted experience graph in a gradient manner according to the verification result includes:

[0032] When receiving an information query request uploaded by the student, verify the student;

[0033] When the student passes the verification, read the encrypted experience graph and feed it back to the student;

[0034] Receive the decryption request input by the student, adjust the verification level according to the decryption request, and feed back the decrypted experience graph;

[0035] Loop to execute the process of receiving the decryption request input by the student, adjusting the verification level according to the decryption request, and feeding back the decrypted experience graph until the student inputs a stop instruction;

[0036] The content of receiving the decryption request input by the student, adjusting the verification level according to the decryption request, and feeding back the decrypted experience graph includes:

[0037] Receive the decryption area input by the student, and judge the authenticity of the student according to whether the decryption area is encrypted;

[0038] When the authenticity is greater than the preset threshold, read the replacement process, decrypt the decryption area, and feedback it to the student;

[0039] When the authenticity is less than the preset threshold, increase the verification level.

[0040] The technical solution of the present invention also provides a student information encryption system, which includes:

[0041] A permission interaction module for updating the granted permissions of each student in real time based on a dynamic permission library;

[0042] An experience unit generation module for each student in the permission library, receiving the experience information uploaded by the student, verifying the experience information, and converting the experience information based on the verification result to obtain an experience unit with a time tag;

[0043] An experience graph construction module for comparing the converted experience units, clustering the experience units, and folding the experience units according to the clustering result to obtain an experience graph;

[0044] A replacement encryption module for comparing the experience graphs of different students, calculating the student similarity, selecting, for any student, the students with a student similarity less than the preset similarity threshold as the encryption source, reading the experience graph of the encryption source, and performing replacement encryption on the experience graph of the current student;

[0045] A verification feedback module for verifying the student when receiving an information query request uploaded by the student, and decrypting and feedbacking the replacement-encrypted experience graph according to the verification result in a gradient manner; wherein, the gradient feedback process includes adjusting the verification level according to the information query request of the student, and determining whether to perform the decryption operation according to the verification results of different verification levels.

[0046] As a further solution of the present invention: the experience unit generation module includes:

[0047] An information receiving unit for each student in the permission library, receiving the experience type, experience name, experience duration, and experience performance uploaded by the student; the experience type includes courses, activities, and internships, and the evaluation criteria for the experience performance are determined by the experience type;

[0048] An information verification unit for sending a verification request to the student, receiving the proof file uploaded by the student, and verifying the proof file based on a preset proof file library;

[0049] An information processing unit, which is configured to, when the verification is passed, query the unit shape in a preset shape library according to the experience type, create a unit label according to the experience name and experience duration, determine the unit size according to the experience performance, and create an experience unit according to the unit shape, unit label and unit size; the unit label contains a time label.

[0050] A file library update unit, which is configured to, when the verification fails, send the proof file to the artificial side, receive the verification result feedback from the artificial side, when the verification result is true, determine that the verification is passed, and update the proof file library according to the proof file; when the verification result is false, generate an error message and feedback it to the student.

[0051] As a further solution of the present invention: the experience graph construction module includes:

[0052] A horizontal arrangement unit, which is configured to arrange experience units in the horizontal axis direction according to the time sequence for the same student.

[0053] A clustering threshold determination unit, which is configured to sequentially select the unclassified experience units as the reference unit, and determine the clustering threshold according to the time difference between it and other experience units; the clustering threshold is proportional to the time difference.

[0054] A clustering unit, which is configured to compare other experience units with the reference unit to obtain the experience similarity, and when the experience similarity reaches the clustering threshold, classify them into one category.

[0055] A vertical arrangement unit, which is configured to read the total number of each type of experience unit and arrange each type of experience unit on the vertical axis according to the total number to obtain an experience graph.

[0056] As a further solution of the present invention: the replacement encryption module includes:

[0057] A graph comparison unit, which is configured to compare the experience graphs of different students and calculate the student similarity.

[0058] A source selection unit, which is configured to query the student similarity with other students for any student, and when the student similarity is less than a preset similarity threshold, select the corresponding student as the encryption source.

[0059] An encryption part selection unit, which is configured to receive the encryption level input by the student, determine the encryption quantity according to the encryption level, and select various types of experience units to be encrypted in the experience graph of the student according to the encryption quantity.

[0060] An encryption execution unit, which is configured to read the experience graph of the encryption source and perform replacement encryption on various types of experience units to be encrypted based on the experience graph of the encryption source.

[0061] Compared with the prior art, the beneficial effects of the present invention are as follows: The present invention quantifies the experience information of students, converts it into a graph structure, folds the experience information of students based on the graph structure to generate an experience map, and replaces and encrypts the experience information of a student according to the experience information of a student with a large difference from this student. When decrypting, the query party independently inputs the decryption area, which is essentially an encryption process based on the memory of the student himself. The encryption degree is extremely high and the security is high. It provides a convenient solution for students to record their study careers, which is equivalent to an electronic diary. BRIEF DESCRIPTION OF THE DRAWINGS

[0062] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following will briefly introduce the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings in the following description are only some embodiments of the present invention.

[0063] Figure 1 It is a flowchart of a method for encrypting student information.

[0064] Figure 2 It is a block diagram of the composition structure of a student information encryption system. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0065] In order to make the technical problems, technical solutions and beneficial effects to be solved by the present invention clearer, the following further describes the present invention in detail with reference to the drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention.

[0066] Figure 1 It is a flowchart of a method for encrypting student information. In an embodiment of the present invention, a method for encrypting student information includes:

[0067] Step S100: Update the granted permissions of each student in real time based on a dynamic permission library;

[0068] The present application provides an information management platform. For the personnel to be managed, it is necessary to clearly obtain their granted permissions before management can be carried out. The above-mentioned dynamic permission library is a database for counting student permissions. Students with granted permissions will be recorded in the permission library. Of course, students can revoke their permissions at any time. Therefore, it is called a dynamic permission library.

[0069] Step S200: For each student in the permission library, receive the experience information uploaded by the student, verify the experience information, and convert the experience information based on the verification result to obtain an experience unit with a time tag;

[0070] For each student in the permission library, receive the experience information uploaded by the student. The experience information includes which courses the student has taken, which activities the student has participated in, and which internships the student has done. Verify the experience information, and based on the verification result, transform the experience information to obtain experience units with time tags.

[0071] Step S300: Compare the transformed experience units, cluster the experience units, and fold the experience units according to the clustering result to obtain an experience map;

[0072] The experience unit in this application is equivalent to a node in the graph data structure. For example, a circle with tags and dimensions, which is used to quantify the experience information. Compare the transformed experience units, cluster the experience units, group similar experiences into one category, and then arrange each category of experience units, which is called folding the experience units. The set of the folded experience units is the experience map.

[0073] It is worth mentioning that in the experience map of this application, there is no connection line between each experience unit, which is slightly different from the conventional graph data structure.

[0074] Step S400: Compare the experience maps of different students, calculate the student similarity. For any student, select the student whose student similarity is less than the preset similarity threshold as the encryption source, read the experience map of the encryption source, and perform replacement encryption on the experience map of the current student;

[0075] After the above processing, each student can obtain an experience map. By comparing the experience maps of different students, it can be determined whether each student is similar, which is represented by the parameter of student similarity. For any student, determine the student with a large enough difference from it according to the student similarity, that is, select the student whose student similarity is less than the preset similarity threshold as the encryption source, read the experience map of the encryption source, and replace some of the data in it into the experience map to be encrypted to implement the replacement encryption process.

[0076] Step S500: When receiving an information query request uploaded by a student, verify the student, and decrypt and feedback the replacement-encrypted experience map in a gradient manner according to the verification result.

[0077] Receive the encrypted source experience graph for reading and verify the student. This verification is different from the verification of experience information. Verifying the student mainly involves identity verification, which has multiple methods corresponding to different verification levels. For example, password verification is at a low level, fingerprint verification is at a higher level, face verification is at a higher level, and there is also iris pattern verification, etc. In the technical solution of the present invention, the student is initially verified, and then it is determined whether to increase the verification level according to the student's decryption request. Since the student himself is most familiar with the experience information, when he faces the replaced experience graph, he can know which part is doubtful and then upload a decryption request. If the targeted part of the decryption request is incorrect, it indicates that it is very likely not the student himself who is operating. At this time, the verification level needs to be increased. Therefore, it is called a gradient decryption process.

[0078] Generally speaking, the gradient feedback process includes adjusting the verification level according to the student's information query request and determining whether to perform decryption operation based on the verification results of different verification levels.

[0079] It is worth mentioning that the technical solution of this application actually involves two comparison processes. One is the comparison process of experience units. Since experience units are quantified experience information and are graphs with labels, the comparison scheme for them can adopt graph comparison algorithms and string comparison algorithms, and the comparison process is not complicated. The other is the comparison process of experience graphs. An experience graph is a collection of experience units. On the premise that the comparison process of experience units is known, one experience graph is selected as the benchmark. For any experience unit in it, calculate the most similar experience unit in another experience graph (compare one by one and select the maximum similarity value), read the similarity. After each experience unit in the benchmark has been operated once, calculate the average value of the similarities as the similarity between the two experience graphs. This belongs to the comparison of set and set. Of course, the intersection-union ratio of the two experience graphs can also be calculated. The evaluation process of the intersection involves the comparison process of experience units. On the premise that the comparison process of experience units is known, when two experience units are similar enough, they can be considered the same data. In addition, since the comparison process of experience graphs is to first select a benchmark and then evaluate each experience unit in it by another experience graph, it does not require the two experience graphs to have the same number of experience units. Suppose another graph has only one experience unit, then the comparison process is to compare each experience unit in the benchmark with that experience unit in the other graph.

[0080] Regarding step S200, the steps of receiving the experience information uploaded by the student for each student in the permission library, verifying the experience information, and converting the experience information based on the verification results to obtain experience units with time tags include:

[0081] For each student in the permission library, receive the experience type, experience name, experience duration, and experience performance uploaded by the student; the experience type includes courses, activities, and internships, and the evaluation criteria for the experience performance are determined by the experience type;

[0082] Send a verification request to the student, receive the proof file uploaded by the student, and verify the proof file based on a preset proof file library;

[0083] When the verification passes, query the unit shape in the preset shape library according to the experience type, create a unit label according to the experience name and experience duration, determine the unit size according to the experience performance, and create an experience unit according to the unit shape, unit label, and unit size; the unit label contains a time label;

[0084] When the verification fails, send the proof file to the manual end, receive the verification result feedback from the manual end. When the verification result is true, it is determined that the verification passes, and update the proof file library according to the proof file; when the verification result is false, generate an error message and feedback it to the student.

[0085] The technical solution of this application is only carried out among students with permissions. For each student in the permission library, receive the experience type, experience name, experience duration, and experience performance uploaded by the student. The experience type includes courses, activities, and internships. The experience performance is the score of each experience, and the evaluation criteria are determined by the experience type. For this application, the evaluation criteria are default known. For example, the attendance results of courses, the rankings of activities, and the evaluation scores of internships.

[0086] After receiving the experience information uploaded by the student, send a verification request to the student and receive the proof file uploaded by the student. The proof file of this application is different from the traditional proof file. The traditional proof file is generally a fixed template, which is obviously unrealistic for this application. If a form needs to be filled out, students will hardly use it. Therefore, this application provides an open verification solution, establishing a proof file library. There are many file formats in the proof file library, such as location screenshots, award photos, and score sheets, etc. These are all feasible. As long as the student uploads them and passes the verification, they will be stored in the proof file library. When the proof file library is large enough, the determination process hardly requires manual participation and can be quickly realized based on the proof file library.

[0087] Specifically, when the verification is passed, query the unit shape in the preset shape library according to the experience type. The unit shape generally adopts regular polygons, such as equilateral triangles, squares, and regular pentagons, etc. Create a unit label according to the experience name and experience duration. The unit label is just a name. Determine the unit size according to the experience performance. Since regular polygons are used in this application, the unit size is the side length. Create an experience unit according to the unit shape, unit label, and unit size; the unit label contains a time label indicating the experience duration.

[0088] When the verification fails, send the proof document to the manual end, and receive the verification result feedback from the manual end. When the verification result is true, it is determined that the verification is passed, and update the proof document library according to the proof document; when the verification result is false, generate an error message and feedback it to the student. It should be noted that the manual end does not belong to the scope of the technical solution of the present invention. The execution subject of this method only needs to perform data interaction with the manual end, send data and receive data. When the data in the proof document library is sufficient, the application times of the manual end will be very low.

[0089] Regarding step S300, the steps of clustering the experience units obtained by comparison and transformation, folding the experience units according to the clustering result, and obtaining the experience map include:

[0090] For the same student, arrange the experience units in the horizontal axis direction according to the time sequence;

[0091] Successively select the unclassified experience units as the reference units, and determine the clustering threshold according to the time difference between it and other experience units; the clustering threshold is proportional to the time difference;

[0092] Compare other experience units with the reference unit to obtain the experience similarity. When the experience similarity reaches the clustering threshold, classify them into the same category;

[0093] Read the total number of experience units in each category, and arrange the experience units in each category on the vertical axis to obtain the experience map.

[0094] In an example of the technical solution of the present invention, the generation process of the experience map is described. For the same student, arrange the experience units in the horizontal axis direction according to the time sequence. Then, successively select the unclassified experience units as the reference units, and determine the clustering threshold according to the time difference between it and other experience units. The clustering threshold is actually a minimum similarity. Compare other experience units with the reference unit to obtain the experience similarity. When the experience similarity reaches the minimum similarity, classify them into the same category; the greater the time difference, the higher the minimum similarity, and the higher the requirement for classifying into the same category.

[0095] Finally, read the total number of various experience units, arrange various experience units on the vertical axis according to the total number to obtain an experience map. In fact, even if the last step is not performed, after clustering is completed, it can also be called an experience map. However, in order to improve its orderliness, sort various experience units according to the number of units in each type of experience unit, and the obtained experience map is more coordinated in format. All experience maps have a generally similar overall shape.

[0096] Regarding step S400, the steps of comparing the experience maps of different students, calculating the student similarity, for any student, selecting a student whose student similarity is less than a preset similarity threshold as the encryption source, reading the experience map of the encryption source, and performing replacement encryption on the experience map of the current student include:

[0097] Compare the experience maps of different students and calculate the student similarity;

[0098] For any student, query the student similarity with each other student. When the student similarity is less than the preset similarity threshold, select the corresponding student as the encryption source;

[0099] Receive the encryption level input by the student, determine the encryption quantity according to the encryption level, and select various experience units to be encrypted in the student's experience map according to the encryption quantity;

[0100] Read the experience map of the encryption source and perform replacement encryption on various experience units to be encrypted based on the experience map of the encryption source.

[0101] In an example of the technical solution of the present invention, compare the experience maps of different students, calculate the student similarity, for any student, query the student similarity with each other student. When the student similarity is less than the preset similarity threshold, select the corresponding student as the encryption source. The obtained encryption source is a student with a great difference from the current student, which is used to improve the encryption effect in the replacement encryption process.

[0102] Receive the encryption level input by the student, determine the encryption quantity according to the encryption level, and select various experience units to be encrypted in the student's experience map according to the encryption quantity. The meaning of this process is to determine how many types of experience units need to be encrypted according to the encryption quantity, and it also means encrypting how many segments of experience information. The higher the encryption level, the more the encryption quantity, the more the encrypted content, and the more troublesome the subsequent decryption process. Specifically, it depends on the situation of the student. After selecting various experience units to be encrypted, read the experience map of the encryption source and perform replacement encryption on various experience units to be encrypted based on the experience map of the encryption source.

[0103] As a preferred embodiment of the technical solution of the present invention, the steps of reading the experience map of the encryption source and performing replacement encryption on various experience units to be encrypted based on the experience map of the encryption source include:

[0104] Randomly select an encryption source, read the experience graph of the encryption source, and randomly select a type of experience unit to be encrypted in the experience graph of the current student;

[0105] Query the experience graph of the encryption source, and calculate the similarity between various experience units in the experience graph of the encryption source and the randomly selected type of experience unit to be encrypted;

[0106] Select the type of experience unit with the greatest similarity in the experience graph of the encryption source to replace the randomly selected type of experience unit to be encrypted;

[0107] Synchronously record the replacement process.

[0108] In an example of the technical solution of the present invention, randomly select an encryption source, read the experience graph of the encryption source. For the sake of convenience of description, the experience graph of the encryption source is called the source graph, and the experience graph of the current student is called the encrypted graph. There are many types of experience units to be encrypted in the encrypted graph. For each type of experience unit, query the type of experience unit in the source graph that is the most similar to this type of experience unit in the source graph (which is also a comparison process of a set of experience units. In fact, the comparison process is equivalent to a comparison process of a small experience graph), and replace the corresponding type of experience unit in the encrypted graph with the type of experience unit with the greatest similarity to obtain the encrypted graph after replacement as the encryption result.

[0109] During the encryption process, record the replacement process, that is, record which type of unit in the source graph replaces which type of unit in the encrypted graph. During subsequent decryption, perform the reverse operation according to the replacement process to obtain the decrypted experience graph.

[0110] Regarding step S500, the steps of verifying the student when receiving the information query request from the student, decrypting in a gradient manner according to the verification result, and feeding back the experience graph after replacement encryption include:

[0111] When receiving the information query request from the student, verify the student;

[0112] When the student passes the verification, read the encrypted experience graph and feed it back to the student;

[0113] Receive the decryption request input by the student, adjust the verification level according to the decryption request, and feed back the decrypted experience graph;

[0114] Loop to execute the process of receiving the decryption request input by the student, adjusting the verification level according to the decryption request, and feeding back the decrypted experience graph until the student inputs a stop instruction;

[0115] Receiving a decryption request input by a student, adjusting the verification level according to the decryption request, and the content of the feedback decrypted experience graph includes:

[0116] Receiving the decryption area input by the student, and judging the authenticity of the student according to whether the decryption area is encrypted;

[0117] When the authenticity is greater than a preset threshold, reading the replacement process, decrypting the decryption area, and feeding it back to the student;

[0118] When the authenticity is less than a preset threshold, increasing the verification level.

[0119] In an example of the technical solution of the present invention, the decryption process of the experience graph is described. When receiving an information query request uploaded by a student, the student is verified. This verification is the most basic verification, such as a password verification method. When the student passes the verification, the encrypted experience graph is read and fed back to the student. The encrypted experience graph is the replaced experience graph, which contains experiences that do not belong to the student. For them, it is easy to know where it does not belong. At this time, receiving the decryption area input by the student, and judging the authenticity of the student according to whether the decryption area is encrypted. If an area is not encrypted, it is obvious that the student has chosen wrongly, which means that the querying party is not familiar with the student's experience. At this time, the authenticity of the student is relatively low. If the student chooses correctly, it means that the querying party is very familiar with the student's experience and the authenticity is relatively high; when the authenticity is greater than a preset threshold, reading the replacement process, decrypting the decryption area, and feeding it back to the student. When the authenticity is less than a preset threshold, increasing the verification level.

[0120] Continuously and circularly execute the decryption process until the student inputs a stop instruction; it is worth mentioning that when the student does not input a decryption request for a long time, it is also considered that a stop instruction is input; when all areas are decrypted, if the student is still uploading a decryption request, at this time, a preset backup experience unit set can be used to encrypt the uploaded decryption area again. This is equivalent to a remedial measure. It does not directly stop the loop after complete decryption. If the querying party is still continuously inputting decryption requests after complete decryption, it means that the querying party is very likely not the student himself. At this time, it is not informed that the information solution is completed, but encryption is performed again to protect the data. At the same time, a prompt message can be generated and sent to the administrator.

[0121] Figure 2 It is a block diagram of the composition structure of a student information encryption system. In an embodiment of the present invention, a student information encryption system, the system 10 includes:

[0122] A permission interaction module 11, which is used to update the granted permissions of each student in real time based on a dynamic permission library;

[0123] The experience unit generation module 12 is configured to, for each student in the permission library, receive the experience information uploaded by the student, verify the experience information, and convert the experience information based on the verification result to obtain an experience unit with a time tag;

[0124] The experience graph construction module 13 is configured to compare the converted experience units, cluster the experience units, and fold the experience units according to the clustering result to obtain an experience graph;

[0125] The replacement encryption module 14 is configured to compare the experience graphs of different students, calculate the student similarity, for any student, select the students whose student similarity is less than a preset similarity threshold as the encryption source, read the experience graph of the encryption source, and perform replacement encryption on the experience graph of the current student;

[0126] The verification feedback module 15 is configured to, when receiving an information query request uploaded by a student, verify the student, and decrypt and feedback the replacement-encrypted experience graph according to the verification result in a gradient manner; wherein, the gradient feedback process includes adjusting the verification level according to the information query request of the student, and determining whether to perform a decryption operation according to the verification results of different verification levels.

[0127] Further, the experience unit generation module 12 includes:

[0128] The information receiving unit is configured to, for each student in the permission library, receive the experience type, experience name, experience duration, and experience performance uploaded by the student; the experience type includes courses, activities, and internships, and the evaluation criteria for the experience performance are determined by the experience type;

[0129] The information verification unit is configured to send a verification request to the student, receive the proof file uploaded by the student, and verify the proof file based on a preset proof file library;

[0130] The information processing unit is configured to, when the verification is passed, query the unit shape in a preset shape library according to the experience type, create a unit label according to the experience name and experience duration, determine the unit size according to the experience performance, and create an experience unit according to the unit shape, unit label, and unit size; the unit label contains a time tag;

[0131] The file library update unit is configured to, when the verification fails, send the proof file to the manual end, receive the verification result feedback by the manual end, when the verification result is true, determine that the verification is passed, and update the proof file library according to the proof file; when the verification result is false, generate an error message and feedback it to the student.

[0132] Specifically, the experience graph construction module 13 includes:

[0133] A horizontal arrangement unit for arranging experience units for the same student in the horizontal axis direction according to the time sequence;

[0134] A clustering threshold determination unit for sequentially selecting unclassified experience units as reference units and determining a clustering threshold according to the time difference between it and other experience units; the clustering threshold is proportional to the time difference;

[0135] A clustering unit for comparing other experience units with the reference unit to obtain an experience similarity, and when the experience similarity reaches the clustering threshold, classifying them into one category;

[0136] A vertical arrangement unit for reading the total number of each type of experience unit and arranging each type of experience unit on the vertical axis according to the total number to obtain an experience map.

[0137] In addition, the replacement encryption module 14 includes:

[0138] A map comparison unit for comparing the experience maps of different students and calculating the student similarity;

[0139] A source selection unit for querying the student similarity with other students for any student, and when the student similarity is less than a preset similarity threshold, selecting the corresponding student as the encryption source;

[0140] An encryption part selection unit for receiving the encryption level input by the student, determining the encryption quantity according to the encryption level, and selecting various types of experience units to be encrypted in the student's experience map according to the encryption quantity;

[0141] An encryption execution unit for reading the experience map of the encryption source and replacing and encrypting various types of experience units to be encrypted based on the experience map of the encryption source.

[0142] The above are only the preferred embodiments of the present invention and are not intended to limit the present invention. Any modifications, equivalent replacements, and improvements made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A student information encryption method, characterized in that: The method comprises: Update the granted permissions of each student in real time based on a dynamic permission library; For each student in the authority library, receiving the experience information uploaded by the student, verifying the experience information, and converting the experience information based on the verification result to obtain an experience unit with a time tag; Compare the experience units obtained by the transformation, cluster the experience units, and fold the experience units according to the clustering results to obtain an experience map; Compare the experience graphs of different students, calculate the student similarity, and for any student, select the student whose student similarity is less than the preset similarity threshold as the encryption source, read the experience graph of the encrypted source, and perform replacement encryption on the experience graph of the current student; When receiving an information query request uploaded by a student, the student is verified, and the experience map encrypted by substitution is decrypted in a gradient manner according to the verification result and fed back; wherein the gradient feedback process includes adjusting the verification level according to the student's information query request, and determining whether to perform the decryption operation according to the verification results of different verification levels; Receive the decryption request input by the student, adjust the verification level according to the decryption request, and feedback the content of the decrypted experience map including: receiving the decrypted area input by the student, and judging the authenticity of the student according to whether the decrypted area is encrypted; When the authenticity is greater than the preset threshold, the replacement process is read, the decrypted area is decrypted, and feedback is given to the student; When the authenticity is less than the preset threshold, the verification level is increased.

2. The student information encryption method according to claim 1, characterized in that: The steps of receiving, for each student in the authority library, the experience information uploaded by the student, verifying the experience information, and converting the experience information based on the verification result to obtain an experience unit containing a time tag include: For each student in the permission library, receive the experience type, experience name, experience duration and experience performance uploaded by the student; the experience type includes courses, activities and internships, and the evaluation criteria of the experience performance are determined by the experience type; Send verification requests to students, receive certification documents uploaded by students, and verify the certification documents based on the preset certification document library; When the verification is passed, the unit shape is queried in the preset shape library according to the experience type, the unit label is created according to the experience name and the experience duration, the unit size is determined according to the experience performance, and the experience unit is created according to the unit shape, unit label and unit size; the unit label contains a time label; When the verification fails, the certification document is sent to the manual end, and the verification result fed back by the manual end is received. When the verification result is true, it is determined that the verification is passed, and the certification document library is updated according to the certification document; when the verification result is false, an error message is generated and fed back to the student.

3. The student information encryption method according to claim 1, characterized in that: The steps of comparing the experience units obtained by the transformation, clustering the experience units, and folding the experience units according to the clustering results to obtain the experience map include: For the same student, arrange the experience units in the horizontal direction according to the chronological order; Selecting unclassified experience units as reference units in turn, and determining a clustering threshold according to the time difference between the reference unit and other experience units; the clustering threshold is proportional to the time difference; Compare other experience units with the benchmark unit to obtain experience similarity, and when the experience similarity reaches the clustering threshold, classify them into one category; Read the total number of each type of experience unit, arrange each type of experience unit on the vertical axis according to the total number, and obtain an experience map.

4. The student information encryption method according to claim 1, characterized in that: The steps of comparing the experience maps of different students, calculating the student similarity, selecting a student whose student similarity is less than a preset similarity threshold as an encryption source, reading the experience map of the encryption source, and performing replacement encryption on the experience map of the current student include: Compare the experience maps of different students and calculate the similarity of students; For any student, query the student similarity with other students. When the student similarity is less than the preset similarity threshold, select the corresponding student as the encryption source; Receive the encryption level input by the student, determine the encryption quantity according to the encryption level, and select various experience units to be encrypted in the student's experience map according to the encryption quantity; The experience graph of the encryption source is read, and various experience units to be encrypted are replaced and encrypted based on the experience graph of the encryption source.

5. The student information encryption method according to claim 4, characterized in that: The step of reading the experience graph of the encryption source and replacing and encrypting various experience units to be encrypted based on the experience graph of the encryption source comprises: Randomly select an encryption source, read the experience map of the encryption source, and randomly select a type of experience unit to be encrypted in the experience map of the current student; Query the experience graph of the encrypted source, and calculate the similarity between various experience units in the experience graph of the encrypted source and a randomly selected type of experience unit to be encrypted; Select a type of experience unit with the greatest similarity in the experience graph of the encrypted source, and replace the randomly selected type of experience unit to be encrypted; Synchronize the record replacement process.

6. The student information encryption method according to claim 1, characterized in that: The steps of verifying the student upon receiving the information query request uploaded by the student, gradient decrypting according to the verification result and feeding back the experience map after substitution encryption include: When receiving an information query request uploaded by a student, verify the student; When the student passes the verification, the encrypted experience map is read and fed back to the student; Receive the decryption request input by the student, adjust the verification level according to the decryption request, and feedback the decrypted experience map; The process of receiving the decryption request input by the student, adjusting the verification level according to the decryption request, and feeding back the decrypted experience map is executed cyclically until the student inputs a stop command.

7. A student information encryption system, characterized in that: The system comprises: The permission interaction module is used to update the granted permissions of each student in real time based on the dynamic permission library; An experience unit generation module is used to receive the experience information uploaded by each student in the authority library, verify the experience information, and convert the experience information based on the verification result to obtain an experience unit with a time tag; An experience map construction module is used to compare the experience units obtained by the transformation, cluster the experience units, and fold the experience units according to the clustering results to obtain an experience map; The replacement encryption module is used to compare the experience maps of different students, calculate the student similarity, and for any student, select the student whose student similarity is less than the preset similarity threshold as the encryption source, read the experience map of the encryption source, and perform replacement encryption on the experience map of the current student; The verification feedback module is used to verify the student when receiving the information query request uploaded by the student, and to decrypt and feedback the experience map encrypted by substitution in a gradient manner according to the verification result; wherein the gradient feedback process includes adjusting the verification level according to the student's information query request, and determining whether to perform the decryption operation according to the verification results of different verification levels; Receive the decryption request input by the student, adjust the verification level according to the decryption request, and feedback the content of the decrypted experience map including: receiving the decrypted area input by the student, and judging the authenticity of the student according to whether the decrypted area is encrypted; When the authenticity is greater than the preset threshold, the replacement process is read, the decrypted area is decrypted, and feedback is given to the student; When the authenticity is less than the preset threshold, the verification level is increased.

8. The student information encryption system according to claim 7, characterized in that: The experience unit generation module includes: An information receiving unit, for each student in the authority library, receives the experience type, experience name, experience duration and experience performance uploaded by the student; the experience type includes courses, activities and internships, and the evaluation criteria of the experience performance are determined by the experience type; An information verification unit, used to send a verification request to a student, receive a certification document uploaded by the student, and verify the certification document based on a preset certification document library; An information processing unit, which is used to query the unit shape in a preset shape library according to the experience type when the verification is passed, create a unit label according to the experience name and the experience duration, determine the unit size according to the experience performance, and create an experience unit according to the unit shape, unit label and unit size; the unit label contains a time label; The file library update unit is used to send the certification file to the manual end when the verification fails, receive the verification result fed back by the manual end, and when the verification result is true, determine that the verification is passed, and update the certification file library according to the certification file; when the verification result is false, generate an error message and feed it back to the student.

9. The student information encryption system according to claim 7, characterized in that: The experience graph construction module includes: Horizontal arrangement of units is used to arrange the experience units of the same student in the horizontal direction according to the time sequence; A clustering threshold determination unit, used to sequentially select unclassified experience units as reference units, and determine a clustering threshold according to the time difference between the reference unit and other experience units; the clustering threshold is proportional to the time difference; A clustering unit is used to compare other experience units with the benchmark unit to obtain experience similarity, and when the experience similarity reaches the clustering threshold, they are grouped into one category; The vertical arrangement unit is used to read the total number of each type of experience unit, and arrange each type of experience unit on the vertical axis according to the total number to obtain an experience map.

10. The student information encryption system according to claim 7, characterized in that: The replaceable encryption module comprises: A graph comparison unit, used to compare the experience graphs of different students and calculate the similarity of the students; A source selection unit is used to query the student similarity between any student and other students, and when the student similarity is less than a preset similarity threshold, the corresponding student is selected as the encryption source; The encryption part selection unit is used to receive the encryption level input by the student, determine the encryption quantity according to the encryption level, and select various experience units to be encrypted in the student's experience map according to the encryption quantity; The encryption execution unit is used to read the experience map of the encryption source, and replace and encrypt various experience units to be encrypted based on the experience map of the encryption source.

Images