Encryption experience map construction method and system

Abstract

The invention provides an encryption experience map construction method and system, relates to the technical field of information encryption, and particularly discloses a student information encryption method and system.The method comprises the steps that experience information is converted, and experience units containing time labels are obtained; comparing the experience units obtained by conversion, clustering the experience units, and folding the experience units according to a clustering result to obtain an experience map; comparing the experience maps of different students, calculating student similarity, for any student, selecting the 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 alternative encryption on the experience map of the current student; when an information query request uploaded by a student is received, the student is verified, gradient decryption is carried out according to a verification result, and the experience map after alternative encryption is fed back; the method is essentially an encryption process based on the memory of the student himself / herself, the encryption degree is extremely high, and the security is extremely high.

Description

[0001] This application is a divisional application of an invention application with an application date of April 10, 2025, a Chinese application number of 202510445805.5, and an invention name of "A Student Information Encryption Method and System". Technical Field

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

[0003] 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 has also expanded. 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, which can fully reflect a student's learning trajectory and is of extremely high importance, 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

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

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

[0006] A student information encryption method, the method includes:

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

[0008] 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 with a time tag;

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

[0010] 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;

[0011] When receiving an information query request uploaded by a student, verify the student, and decrypt in a gradient manner according to the verification result and feedback the experience graph after replacement encryption; 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.

[0012] 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 containing a time tag include:

[0013] 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;

[0014] 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;

[0015] 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;

[0016] When the verification fails, send the proof file to the artificial terminal, receive the verification result feedback by the artificial terminal. When the verification result is true, it is determined 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.

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

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

[0019] Successively 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;

[0020] 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;

[0021] 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 graph.

[0022] As a further solution of the present invention: The steps of comparing the experience graphs 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 graph of the encryption source, and performing replacement encryption on the experience graph of the current student include:

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

[0024] 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;

[0025] 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;

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

[0027] As a further solution of the present invention: The steps of reading the experience graph of the encryption source and performing replacement encryption on various experience units to be encrypted based on the experience graph of the encryption source include:

[0028] 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;

[0029] 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;

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

[0031] Synchronously record the replacement process.

[0032] As a further solution of the present invention: The steps of verifying the student when receiving an information query request uploaded by the student, decrypting in a gradient manner according to the verification result, and feeding back the experience graph after replacement encryption include:

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

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

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

[0036] Loop to execute receiving the decryption request input by the student, adjust the verification level according to the decryption request, and feedback the decrypted experience graph until the student inputs a stop instruction;

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

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

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

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

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

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

[0043] 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;

[0044] 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;

[0045] A replacement encryption module for comparing the experience graphs of different students, calculating the student similarity, for any student, selecting the student 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;

[0046] A verification feedback module for verifying the student when receiving the information query request uploaded by the student, 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.

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

[0048] An information receiving unit, configured to receive, for each student in the permission library, 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;

[0049] An information verification unit, 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;

[0050] An information processing unit, 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;

[0051] A file library updating unit, configured to, when the verification fails, send the proof file to the artificial terminal, receive the verification result feedback by the artificial terminal, determine that the verification is passed when the verification result is true, 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.

[0052] As a further solution of the present invention: the experience map construction module includes:

[0053] A horizontal arrangement unit, configured to arrange the experience units in the horizontal axis direction according to the time sequence for the same student;

[0054] A clustering threshold determination unit, 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;

[0055] A clustering unit, configured to compare other experience units with the reference unit to obtain the experience similarity, and classify them into the same category when the experience similarity reaches the clustering threshold;

[0056] A vertical arrangement unit, 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 map.

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

[0058] A map comparison unit, configured to compare the experience maps of different students and calculate the student similarity;

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

[0060] An encryption part selection unit, configured to receive the encryption level input by a student, determine the encryption quantity according to the encryption level, and select various experience units to be encrypted from the student's experience map according to the encryption quantity;

[0061] An encryption execution unit, configured to 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.

[0062] 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 performs replacement encryption on the experience information of a student according to the experience information of a student with a great difference from this student. During decryption, 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 learning careers, which is equivalent to an electronic diary. BRIEF DESCRIPTION OF THE DRAWINGS

[0063] 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.

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

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

[0066] 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.

[0067] 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, the method includes:

[0068] Step S100: Real-time update the granted permissions of each student based on a dynamic permission library;

[0069] 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 take back their permissions at any time. Therefore, it is called a dynamic permission library.

[0070] 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;

[0071] For each student in the permission library, receive the experience information uploaded by the student. The experience information includes what courses the student has taken, what activities the student has participated in, and what internships the student has done. Verify the experience information, and convert the experience information based on the verification result to obtain an experience unit with a time tag.

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

[0073] The experience unit of this application is equivalent to a node in the graph data structure. For example, a circle with labels and dimensions, which is used to quantify the experience information. Compare the converted 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.

[0074] It is worth mentioning that in the experience map of this application, there are no connection lines between the various experience units, which is slightly different from the conventional graph data structure.

[0075] 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;

[0076] After the above processing, each student can obtain an experience map. By comparing the experience maps of different students, it can be determined whether the students are 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 part of the data in it into the experience map to be encrypted to implement the replacement encryption process.

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

[0078] Receive the encrypted source experience graph for reading and verify the students. This verification is different from the verification of experience information. The verification of students is mainly identity verification, and there are various 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 and so on. In the technical solution of the present invention, the students are initially verified, and then it is determined whether to increase the verification level according to the decryption request of the students. Because the students themselves must be the most familiar with the experience information. When they face the replaced experience graph, they 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 that the operation is not performed by the student himself. At this time, it is necessary to increase the verification level. Therefore, it is called a gradient decryption process.

[0079] Generally speaking, 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.

[0080] 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, and for any one experience unit in it, the most similar experience unit in the other experience graph is calculated (compared in sequence, and the maximum similarity value is selected), and the similarity is read. After each experience unit in the benchmark has been operated once, the average value of the similarities is calculated as the similarity of the two experience graphs. This belongs to the comparison of set and set. Of course, the intersection 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 that the two experience graphs have the same number of experience units. Suppose the other graph has only one experience unit, then the comparison process is to compare each experience unit in the benchmark with that one experience unit in the other graph.

[0081] 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 result to obtain an experience unit with a time tag include:

[0082] 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;

[0083] 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;

[0084] 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;

[0085] 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.

[0086] 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 clock-in result of a course, the ranking of an activity, and the evaluation score of an internship.

[0087] 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.

[0088] Specifically, when the verification is passed, query the unit shape in the preset shape library according to the experience type. The unit shape generally uses 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.

[0089] 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.

[0090] 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:

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

[0092] 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;

[0093] 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;

[0094] 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.

[0095] 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, 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 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 them into the same category.

[0096] 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, various experience units are sorted according to the number of units in each category of experience units, and the obtained experience map is more coordinated in format. All experience maps have a generally similar overall shape.

[0097] 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:

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

[0099] 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;

[0100] 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;

[0101] 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.

[0102] 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.

[0103] 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 categories of experience units need to be encrypted according to the encryption quantity, which 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, which is specifically determined by the student according to the situation. 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.

[0104] 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:

[0105] 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;

[0106] 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;

[0107] 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;

[0108] Synchronously record the replacement process.

[0109] 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 closest to this type of experience unit in the source graph (which is also a comparison process of sets of experience units. In fact, the comparison process is equivalent to a comparison process of small experience graphs), and replace the corresponding type of experience unit in the encrypted graph with the type of experience unit with the highest similarity to obtain the encrypted graph after replacement as the encryption result.

[0110] 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.

[0111] 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:

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

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

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

[0115] 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;

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

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

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

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

[0120] In an example of the technical solution of the present invention, the decryption process of the experience graph is described. When receiving the information query request uploaded by the student, the student is verified. This verification is the most basic verification, such as the password verification method. When the student passes the verification, read the encrypted experience graph and feedback it 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, receive the decryption area input by the student, and judge 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 the wrong one, which means that the query 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 query party is very familiar with the student's experience and the authenticity is relatively high; when the authenticity is greater than the preset threshold, read the replacement process, decrypt the decryption area, and feedback it to the student. When the authenticity is less than the preset threshold, increase the verification level.

[0121] Continuously execute the decryption process in a loop 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 query party is still continuously inputting decryption requests after complete decryption, it means that the query party is very likely not the student himself. At this time, do not inform that the information solution is completed, but encrypt again to protect the data. At the same time, a prompt message can also be generated and sent to the administrator.

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

[0123] 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;

[0124] An experience unit generation module 12, 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;

[0125] An experience graph construction module 13, 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;

[0126] A replacement encryption module 14, 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;

[0127] A verification feedback module 15, configured to, when receiving an information query request uploaded by a student, verify the student, and decrypt and feedback the replaced and 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 result of different verification levels.

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

[0129] An information receiving unit, 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;

[0130] An information verification unit, 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;

[0131] An information processing unit, 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;

[0132] A file library update unit, configured to, when the verification fails, send the proof file to the artificial end, receive the verification result feedback by the artificial 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.

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

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

[0135] 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;

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

[0137] A vertical arrangement unit for reading the total number of experience units of each category and arranging the experience units of each category on the vertical axis to obtain an experience map.

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

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

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

[0141] 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 experience units to be encrypted in the student's experience map according to the encryption quantity;

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

[0143] 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 method for constructing an encryption experience map, characterized in that The method includes: Based on a dynamic permission library, the granted permissions of each student are updated in real time; For each student in the permission library, receive the experience type, experience name, experience duration, and experience performance uploaded by the student; 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; Arrange the experience units in the horizontal axis direction according to the time sequence, cluster the experience units, read the total number of each type of experience unit, and arrange each type of experience unit in the vertical axis according to the total number to obtain an experience map; Compare the experience maps of different students, calculate the student similarity. For any student, select the students 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; When receiving an information query request uploaded by a student, verify the student, and perform gradient decryption and feedback the replaced and encrypted experience map according to the verification result; among them, 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.

2. The method for constructing an encrypted experience map according to claim 1, wherein The experience type includes courses, activities, and internships, and the evaluation criteria for the experience performance are determined by the experience type; the process of creating an experience unit includes: sending a verification request to the student, receiving the proof file uploaded by the student, and verifying the proof file based on the preset proof file library; when the verification passes, execute the creation process, when the verification fails, send the proof file to the artificial terminal, receive the verification result feedback by the artificial terminal, 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.

3. The method for constructing an encrypted experience map according to claim 1, wherein The steps of arranging the experience units in the horizontal axis direction according to the time sequence, clustering the experience units, reading the total number of each type of experience unit, and arranging each type of experience unit in the vertical axis according to the total number to obtain an experience map include: For the same student, arrange the experience units in the horizontal axis direction according to the time sequence; Successively 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; 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; Read the total number of each type of experience unit, and arrange each type of experience unit in the vertical axis according to the total number to obtain an experience map.

4. The method for constructing an encrypted experience map according to claim 1, characterized in that The steps of comparing the experience maps of different students, calculating the student similarity. For any student, selecting the students whose student similarity is less than the 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: Compare the experience maps of different students and calculate the student similarity; 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 types of experience units to be encrypted in the student's experience map according to the encryption quantity; Read the experience map of the encryption source, and perform substitution encryption on various types of experience units to be encrypted based on the experience map of the encryption source.

5. The method for constructing an encrypted experience map according to claim 4, characterized in that, The step of reading the experience map of the encryption source and performing substitution encryption on various types of experience units to be encrypted based on the experience map of the encryption source includes: 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 current student's experience map; Query the experience map of the encryption source, and calculate the similarity between various types of experience units in the experience map of the encryption source and the randomly selected type of experience unit to be encrypted; Select the type of experience unit with the largest similarity in the experience map of the encryption source, and replace the randomly selected type of experience unit to be encrypted; Synchronously record the replacement process.

6. The method for constructing an encrypted experience map according to claim 1, wherein The step of verifying the student when receiving the information query request uploaded by the student, decrypting in a gradient manner according to the verification result, and feedbacking the experience map after substitution encryption includes: When receiving the information query request uploaded by the student, verify the student; When the student passes the verification, read the encrypted experience map and feedback it 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; Loop through the process of receiving the decryption request input by the student, adjusting the verification level according to the decryption request, and feedbacking the decrypted experience map until the student inputs a stop instruction; The content of receiving the decryption request input by the student, adjusting the verification level according to the decryption request, and feedbacking the decrypted experience map includes: Receive the decryption area input by the student, and judge the authenticity of the student according to whether the decryption area is encrypted; When the authenticity is greater than the preset threshold, read the replacement process, decrypt the decryption area, and feedback it to the student; When the authenticity is less than the preset threshold, increase the verification level.

7. An encrypted experience graph construction system, characterized in that The system includes: A permission interaction module for updating the granted permissions of each student in real time based on a dynamic permission library; An experience unit generation module for each student in the permission library, receiving the experience type, experience name, experience duration, and experience performance uploaded by the student; querying the unit shape in the preset shape library according to the experience type, creating a unit label according to the experience name and experience duration, determining the unit size according to the experience performance, and creating an experience unit according to the unit shape, unit label, and unit size; An experience map construction module for arranging experience units in the horizontal axis direction according to the time sequence, clustering the experience units, reading the total number of various types of experience units, and arranging various types of experience units in the vertical axis according to the total number to obtain an experience map; A substitution encryption module for comparing the experience maps of different students, calculating the student similarity, for any student, selecting the student with a student similarity less than the preset similarity threshold as the encryption source, reading the experience map of the encryption source, and performing substitution encryption on the experience map of the current student; A verification feedback module, which is used to verify a student when receiving an information query request uploaded by the student, and decrypt and feedback the experience graph after substitution encryption 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.

8. The encryption experience map construction system according to claim 7, characterized in that, The types of experiences include courses, activities and internships, and the evaluation criteria for the performance of experiences are determined by the types of experiences; the process of creating an experience unit includes: sending a verification request to the student, receiving the proof documents uploaded by the student, and verifying the proof documents based on a preset proof document library; when the verification is passed, the creation process is executed, when the verification fails, the proof documents are sent to the artificial end, receiving the verification result feedback from the artificial end, when the verification result is true, it is determined that the verification is passed, and the proof document library is updated according to the proof documents; when the verification result is false, an error message is generated and feedback to the student.

9. The encryption experience map construction system according to claim 7, characterized in that The experience graph construction module includes: A horizontal arrangement unit, which is used to arrange experience units in the horizontal axis direction according to the time sequence for the same student. A clustering threshold determination unit, which is used 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. A clustering unit, which is used 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. A vertical arrangement unit, which is used to read the total number of various experience units, and arrange various experience units on the vertical axis according to the total number to obtain the experience graph.

10. The encryption experience map construction system according to claim 7, characterized in that, The substitution encryption module includes: A graph comparison unit, which is used to compare the experience graphs of different students and calculate the student similarity. A source selection unit, which is used to query the student similarity with other students for any student, and when the student similarity is less than the preset similarity threshold, select the corresponding student as the encryption source. An encryption part selection unit, which 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 graph according to the encryption quantity. An encryption execution unit, which is used to read the experience graph of the encryption source and encrypt various experience units to be encrypted in a substitution manner based on the experience graph of the encryption source.

Images