A visitor appointment management system

Abstract

The present invention discloses a visitor appointment management system, which relates to the field of monitoring and controlling access, and is used to solve the problem that the large number of visitor accesses increases the number of signature verification results and occupies too much system memory. The system includes a data acquisition module, a special processing module, a data analysis module, a signature security module, and a visualization port, and the signals between the modules are connected. By collecting visitor information and QR code information, the number of times visitors enter and leave the venue, the arrival rate, the security of digital signatures, etc. are processed, a data analysis model is established, a cache evaluation coefficient is generated, and compared with the cache threshold to obtain a cache determination result and an alarm message, which are respectively sent to the signature security module and the visualization port; the signature security module uses fuzzy logic to determine the cache scheme and sends it to the visualization port, effectively reducing the burden of real-time processing of the system, improving the QR code verification efficiency and its security, reducing the calculation delay during visitor verification, and making it more convenient for visitors to enter and leave.

Description

Technical Field

[0001] The present invention relates to the field of monitoring and controlling access, and more specifically, to a visitor appointment management system. Background Art

[0002] Visitor systems are mainly used for visitor information registration, permission management, and arrival information recording. When a visitor comes, it is necessary to register the visitor information, assign a receptionist to the visitor, grant the visitor access rights to the access control, turnstile, and entrance / exit, record the situation of the visitor during the visit time limit and the visit period, and provide functions such as visitor appointment and visitor self-service. The main purpose is to uniformly manage the information of the visiting visitors for later statistical or query operations.

[0003] The prior art has the following deficiencies:

[0004] Currently, when a visitor system sends a visit application to a visitor, it is usually sent to the visitor in the form of a QR code. After the visitor arrives at the designated area, they scan the code to pass. During the permission period, after the visitor leaves the designated area and enters and exits the designated area multiple times, each passage requires presenting the QR code to pass. At the same time, when verifying the QR code, public system parameters are required to verify the authenticity of its digital signature. Correspondingly, this will increase the number of signature verification results and occupy too much system memory. Therefore, a visitor appointment management system is proposed.

[0005] The above information disclosed in the background art section is only used to enhance the understanding of the background of the present disclosure. Therefore, it may include information that does not constitute the prior art known to those of ordinary skill in the art. Summary of the Invention

[0006] In order to overcome the above-mentioned defects of the prior art, an embodiment of the present invention provides a visitor appointment management system, which solves the problems raised in the above background art by using different product inspection methods.

[0007] To achieve the above purpose, the present invention provides the following technical solution: A visitor appointment management system includes a data acquisition module, a special processing module, a data analysis module, a signature security module, and a visualization port; the modules are signal-connected to each other;

[0008] The data acquisition module is used to collect the information of visitors who have entered the venue before the specified time and their QR code information. Through data processing, the number of times a visitor enters and exits the venue, the historical access arrival rate, the security of the digital signature, and the signature calculation efficiency are obtained, and they are sent to the special processing module;

[0009] The special processing module is used to obtain the information of visitors who have entered the venue before the specified time and their QR code information, establish a data analysis model, obtain a cache evaluation coefficient, and send it to the data analysis module;

[0010] The data analysis module is used to obtain the cache evaluation coefficient, compare it with the cache threshold to obtain the comparison result, and determine the cache of the QR code of each visitor based on it, generating a cache signal and sending it to the signature security module; and counting the comparison result value, comparing it with the alarm threshold, and sending the alarm message to the visualization port;

[0011] The signature security module is used to obtain the cache signal, obtain the public information data volume of the visitor's QR code, collect the remaining storage space, determine the cache public information scheme using fuzzy logic, and send it to the visualization port;

[0012] The visualization port is used to receive the alarm message and the cache public information scheme and report them respectively.

[0013] In a preferred embodiment, by tracking and counting the identity information and access records of visitors, the number of accesses of the visitor at the current time is calculated to obtain ; where is the th visitor; and the number of visitors corresponds to the number of QR codes, that is is also the th QR code;

[0014] By tracking the identity information of visitors and storing the arrival situation of each visitor in the database, the historical access arrival rate is calculated based on the ratio of the number of on-time arrivals to the total number of arrivals ;

[0015] For the QR code generated based on IBS, the security of the generated digital signature is through the collision resistance of the hash function, and the complexity of using the birthday attack is approximately , and the digital signature security is obtained through probability expression ;

[0016] By measuring the number of calculation operations and time consumption in the signature generation and verification processes, determining the number of signatures that can be generated and verified per unit time, and obtaining the signature calculation efficiency .

[0017] In a preferred embodiment, the number of times a visitor enters and exits the venue, the historical access arrival rate, the digital signature security, and the signature calculation efficiency are obtained, a data analysis model is established, and a cache evaluation coefficient is generated. The formula is:

[0018] ;

[0019] In the formula, is the cache evaluation coefficient, , , and are preset proportionality coefficients for the number of times a visitor enters and exits the venue, the historical access arrival rate, the digital signature security, and the signature calculation efficiency, and , , and are all greater than 0.

[0020] In a preferred embodiment, after obtaining the cache evaluation coefficient, the cache evaluation coefficient is compared and analyzed with the continuously iterated cache threshold;

[0021] If the cache evaluation coefficient is greater than or equal to the cache threshold, the public information of the two-dimensional code of the visitor is cached, and a cache signal is generated;

[0022] If the cache evaluation coefficient is less than the cache threshold, the two-dimensional code of the visitor continues to be monitored in the background, and an end signal is generated.

[0023] In a preferred embodiment, the comparison results where the cache evaluation coefficient is greater than or equal to the cache threshold are statistically calculated, and the values are statistically calculated and compared with the alarm threshold. If it is greater than the alarm threshold, an alarm message is generated.

[0024] In a preferred embodiment, the public information data volume of the visitor two-dimensional code includes the size of the public system parameters that can be cached and the size of the public hash function that can be cached. The maximum cache volume is obtained through the security verification scheme of the digital signature.

[0025] In a preferred embodiment, by determining the group structure type, calculating the number of bytes of the generator, summing up each part of the generator, obtaining the size of the generator, and then through the repeated verification of the digital signature security scheme, based on the maximum cache of the public system parameters, the size of the public system parameters that can be cached is obtained;

[0026] By determining the hash algorithm used in the IBS scheme, recording according to the output length of the selected hash algorithm to determine the hash function output size, and repeating the verification of the digital signature security scheme, based on the maximum cache of the public hash function, the size of the public hash function that can be cached is obtained.

[0027] In a preferred embodiment, by monitoring the storage rate, setting a storage threshold, controlling the storage rate to be maintained within a certain range value, and subtracting the used storage space from the total storage space, the remaining storage space is obtained.

[0028] In a preferred embodiment, the public information data volume of the visitor two-dimensional code and the remaining storage space are defined as input variables, and they are respectively divided into different fuzzy sets;

[0029] Define the cache public information scheme as an output variable and divide it into fuzzy sets;

[0030] Formulate fuzzy rules to describe the impact of the public information data volume of the visitor QR code and the remaining storage space on the cache public information scheme;

[0031] Perform fuzzy inference according to the fuzzy rules to determine the cache public information scheme.

[0032] Technical effects and advantages of the present invention:

[0033] 1. By collecting the information of visitors who have entered the venue before a specified time and their QR code information, establishing a data analysis model, obtaining a cache evaluation coefficient, comparing it with a cache threshold, obtaining a comparison result, and making a cache determination for the QR codes of each visitor based on it, and counting the comparison result values, comparing them with an alarm threshold, and sending the comparison results to a visualization port, in a scenario of high-frequency entry and exit, the burden of real-time processing of the system is effectively reduced, the speed and efficiency of QR code verification are improved, and at the same time, the calculation delay during visitor verification is reduced, enhancing the user experience.

[0034] 2. By obtaining the maximum size of public system parameters that can be cached and the size of public hash functions that can be cached through the security verification scheme of digital signatures, and formulating a set of fuzzy rules with the remaining storage space for fuzzy inference to determine the cache public information scheme, while ensuring the system operation speed and the security of QR codes, the QR code verification efficiency is improved, making it more convenient for visitors to enter and exit. Description of the Drawings

[0035] Figure 1 It is a module schematic diagram of a visitor reservation management system of the present invention. Detailed Embodiments

[0036] Next, the technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

[0037] The present invention generates a visitor QR code through identity-based signature, i.e., IBS. This QR code has high security. The digital signature scheme set inside it reduces the bilinear pairing operation while maintaining correctness and has a certain anti-attack ability. By determining whether the visitor enters the venue before a specified time as a precondition, and based on the number of times they enter and exit the venue and their historical access arrival rate, etc., evaluate whether to cache in advance the public system parameters, public hash functions and other public information data for judging the authenticity of the QR code. Embodiment 1

[0038] The present invention discloses a visitor reservation management system, as Figure 1 shown, which includes a data acquisition module, a special processing module, a data analysis module, a signature security module, and a visualization port; the modules are signal-connected to each other.

[0039] The data acquisition module is used to collect the information of visitors who have entered the venue before the specified time and their QR code information. Through digital processing, the number of times a visitor enters and exits the venue, the historical access arrival rate, the digital signature security, and the signature calculation efficiency are obtained, and they are sent to the special processing module.

[0040] Among them, the information of visitors who have entered the venue before the specified time refers to those who have verified their identities through QR codes and entered the venue before the meeting starts. Usually, the meeting room is reserved by the meeting initiator, and then an access invitation is sent to the visitors. Correspondingly, the system generates a QR code that can verify the visitor information and a meeting notice and sends them to the visitors. The visitors arrive at the specified venue according to the meeting notice, and the visitors who have entered the venue before the specified time are counted, and the number of times a visitor enters and exits the venue is analyzed in real time.

[0041] The acquisition logic of the number of times a visitor enters and exits the venue is to track and count the identity information and access records of the visitors. The system calculates the number of times a visitor enters and exits at the current time according to the QR code scanning records in the background to obtain ; among them, is the th visitor; and the number of visitors corresponds to the number of QR codes, that is, is also the rd QR code.

[0042] It should be noted that the number of times a visitor enters and exits the venue is the number of times at the current time when entering and exiting the venue during the meeting after entering the venue; among them, the interval for calculating the number of times a visitor enters and exits the venue at the current time is not limited, but is specifically implemented by the experimenter according to the specific management method and is not limited here.

[0043] The acquisition logic of the historical access arrival rate is to track the identity information of the visitors and store the arrival situation of each visitor in the database to form a historical record. Its calculation logic is that if a visitor arrives within the specified time before the meeting starts, it is counted as "arriving on time", and the historical access arrival rate is obtained by calculating the ratio of the number of times of arriving on time to the total number of times .

[0044] It should be noted that the specified time refers to the specified time set by the meeting initiator, and the specific specified time is not limited here, but is set by different meeting initiators according to the meeting requirements.

[0045] Among them, the two-dimensional code information includes digital signature security and signature calculation efficiency.

[0046] The generation of the two-dimensional code is based on IBS, that is, an improved identity-based digital signature scheme, to reduce the number of bilinear pairing operations. The steps for generating the signature are as follows:

[0047] Step A1: In the system initialization stage, define as a cyclic additive group of order q, with its generator as P. When the system is initialized, randomly select the master key , define the bilinear mapping , the public key of the system is , define two hash functions and , then there is , Step A2: In the private key extraction stage, the identity of the signer is , which is a public parameter and can be accessed by external members in the scope. Thus, the public key of the signer can be directly calculated through the identity hash function as . Before signing, the signer needs to request his own private key from the PKG. The PKG calculates the private key of the signer and securely distributes the private key to the signer through a secret channel;

[0048] Step A3: In the signature stage, the signer takes out the previously secretly saved private key , and randomly selects in , calculates , calculates , then the signature for the message m is . The signer sends the signature to the user;

[0049] Step A4: After receiving the signature, the signature recipient can verify the signature through public system parameters, public hash functions, public information of the signer, etc. The recipient calculates the following verification formula to determine the authenticity of the signature information; the verification formula is:

[0050] .

[0051] Digital signature security refers to the collision resistance of the hash function. The larger the output bit number, the higher the collision resistance, and the greater the computational complexity of finding a collision, the higher the digital signature security.

[0052] Among them, the security of the collision resistance of the hash function depends on the computational complexity required to find a collision. For a hash function with an output length of n bits, the complexity of using the birthday attack is approximately , then the complexity of the collision resistance is ; where n is the output bit number of the hash function.

[0053] If a given hash function H, its collision resistance is expressed by probability. If the input space is S, the output space is T, and , then the successful probability of finding a collision is based on the formula:

[0054] ;

[0055] In the formula, is the number of hash function inputs, that is, the number of inputs that have been hashed, is the output space size, is the collision resistance of the hash function of the digital signature in the current visitor QR code. For when, close to , then .

[0056] Specifically, the larger the output bit number n of the hash function, the higher the computational complexity of the birthday attack, thus increasing the difficulty of finding a collision. Therefore, when the digital signature security is higher, the cache evaluation coefficient is higher, and the verification information can be cached in advance.

[0057] The acquisition logic of the signature calculation efficiency is to determine the number of signatures that can be generated and verified per unit time by measuring the number of computational operations and time consumption in the signature generation and verification processes, according to the formula; , to obtain the signature calculation efficiency ; where is the signature generation time, is the signature verification time.

[0058] It should be noted that the unit time refers to a fixed time period, usually "1 second", ": 1 minute", etc., used to evaluate the performance of the algorithm within this time period. The specific unit time length is not limited, but is set by the experimenter according to the specific implementation. Among them, if the signature calculation efficiency is higher, it means that the current system verifies the visitor's identity faster.

[0059] The special processing module is used to obtain the visitor information and its QR code information who have entered the venue before the specified time, establish a data analysis model, obtain the cache evaluation coefficient, and send it to the data analysis module.

[0060] Obtain the number of times a visitor enters and exits the venue, the historical access arrival rate, the digital signature security, and the signature calculation efficiency, establish a data analysis model, and generate the cache evaluation coefficient , based on the formula:

[0061] ;

[0062] In the formula, is the cache evaluation coefficient, , , and are the preset proportionality coefficients of the number of times a visitor enters and exits the venue, the historical access arrival rate, the digital signature security, and the signature calculation efficiency, and , , and are all greater than 0.

[0063] Among them, the number of times a visitor enters and exits the venue, the historical access arrival rate, the digital signature security, and the signature calculation efficiency are all digitalized manifestations directly expressing whether the public system parameters, public hash functions, and public information of the signer of the current visitor's two-dimensional code are cached in advance.

[0064] It can be seen from the above formula that when the number of times a visitor enters and exits the venue, the historical access arrival rate, and the digital signature security are higher, it means that the current visitor has entered and exited too many times. At the same time, while their historical behavior is excellent and the security of the two-dimensional code is also very high, the cache evaluation coefficient is larger, and the public information can be cached in advance. On the contrary, the current signature calculation efficiency is lower, and the cache evaluation coefficient is smaller.

[0065] The data analysis module is used to obtain the cache evaluation coefficient, compare it with the cache threshold to obtain a comparison result, and based on this, perform a cache determination on the two-dimensional code of each visitor, generate a cache signal and send it to the signature security module; and count the comparison result value, compare it with the alarm threshold, and send the alarm message to the visualization port.

[0066] The acquisition logic of the cache threshold is to collect the distribution sample set of the historical cache public information library, then divide the data set into a training set and a test set, set evaluation indicators and clustering algorithms. In each iteration of cross-validation, train the model on the training set and evaluate the model performance on the test set, and then adjust the cache threshold according to the performance of the validation set. Therefore, the cache threshold is constantly iteratively updated.

[0067] In the present invention, the clustering algorithm is a type of unsupervised learning algorithm used to divide the data points in the data set into groups or clusters with similarity; common ones include K-means clustering, which divides the data points in the data set into K clusters, minimizing the distance between the data points of each curve and the center point (centroid) of the cluster to which it belongs. Finally, the Euclidean distance is used to measure the effect of the adjusted cache threshold, thereby setting the cache threshold.

[0068] After obtaining the cache evaluation coefficient, compare and analyze the cache evaluation coefficient with the continuously iterated cache threshold.

[0069] If the cache evaluation coefficient is greater than or equal to the cache threshold, the public information of the visitor's QR code will be cached, and a cache signal will be generated.

[0070] If the cache evaluation coefficient is less than the cache threshold, the visitor's QR code will continue to be monitored in the background, and an end signal will be generated.

[0071] Statistically calculate the comparison results where the cache evaluation coefficient is greater than or equal to the cache threshold, calculate their values, and compare them with the alarm threshold. If it is greater than the alarm threshold, an alarm message such as "The current personnel flow in the meeting is too large" will be generated and sent to the visualization port.

[0072] Among them, the alarm threshold is obtained through the current cache evaluation coefficient and the historical cache public information library.

[0073] The present invention collects the visitor information and their QR code information who have entered the venue before the specified time, establishes a data analysis model to obtain the cache evaluation coefficient, compares it with the cache threshold to obtain the comparison result, determines the cache judgment for each visitor's QR code based on it, statistically calculates the comparison result value, compares it with the alarm threshold, and sends the comparison result to the visualization port. In the scenario of high-frequency entry and exit, it effectively reduces the burden of real-time processing of the system, improves the speed and efficiency of QR code verification, and at the same time reduces the calculation delay during visitor verification, enhancing the user experience. Embodiment

[0074] In Embodiment 1 of the present invention, it mainly illustrates the operation strategy of collecting the visitor information and their QR code information who have entered the venue before the specified time, establishing a data analysis model to obtain the cache evaluation coefficient, comparing it with the cache threshold to obtain the comparison result, determining the cache judgment for each visitor's QR code based on it, statistically calculating the comparison result value, comparing it with the alarm threshold, and sending the comparison result to the output end; but in Embodiment 1, it only starts from the direction of whether the QR code needs to be cached, and does not consider the data volume of the public information to be cached. Obviously, if all the public information of the above-mentioned QR code generating the cache signal is cached, although it can avoid the calculation delay during visitor verification, it further increases the system storage burden and the QR code security problem; for the above problems, Embodiment 2 of the present invention is further refined.

[0075] The signature security module is used to obtain the cache signal, obtain the data volume of the public information of the visitor's QR code, collect the remaining storage space, determine the cache public information scheme using fuzzy logic, and send it to the visualization port.

[0076] The data volume of the public information of the visitor's QR code includes the size of the public system parameters that can be cached and the size of the public hash function that can be cached.

[0077] It should be noted that the size of the public system parameters that can be cached and the size of the public hash function that can be cached are maximized through the security verification scheme of digital signatures. The purpose is not only to limit the caching duration, but also to maximize the verification efficiency while ensuring the security of digital signatures.

[0078] Specifically, the security scheme for verifying digital signatures is usually based on the attack model of traditional digital signatures. By adding an identity Hash function oracle and a private key extraction oracle, the security of the digital signatures of the cached public system parameters and public hash function is repeatedly verified, that is, each verification adds a part of the cached public information.

[0079] The security definition of the identity-based digital signature scheme is illustrated by a challenge game between an adversary A and a challenger C. If there does not exist a PPT (probabilistic polynomial time) algorithm A that wins the challenge with a significant advantage, then the digital signature resists adaptive chosen-message existential forgery attacks and identity attacks;

[0080] Among them, the steps of the challenging game are as follows: Step B1: The challenger runs the Setup algorithm to generate the public parameters and the master key of the system, keeps the master key secret, and publishes the public parameters. The adversary can obtain the system parameters at this stage;

[0081] Step B2: The adversary specifies the identity ID of any visitor and asks for the private key corresponding to that ID. The challenger calculates and returns the private key; the adversary specifies the identity ID and the message m, and the challenger extracts the private key and generates a signature , and returns it to the adversary;

[0082] Step B3: The adversary selects the identity ID and the message m and outputs a signature under the following conditions : The adversary has not made a key extraction query; the adversary has not made a signature query; it is a valid signature;

[0083] Step B4: Perform a security determination. Within the specified time, if the adversary A generates a valid signature under the above conditions , then the digital signature is considered insecure; otherwise, the scheme is considered secure.

[0084] Among them, the specified time is implemented by the experimenter according to the specific implementation plan and is not limited here. At the same time, the public system parameters and public hash function cached in the previous security test of the digital signature that is first determined to be insecure are used as the maximized size of the public system parameters that can be cached and the size of the public hash function that can be cached.

[0085] The size of the public system parameters refers to the storage space occupied by the system-level public parameters related to the visitor QR code signature and verification process. Since this experiment is based on the identity-based signature (IBS) scheme, in which the size of the generator is the size of the public system parameters, the above verification method is repeated to obtain the maximum cached generator size, that is, the size of the public system parameters that can be cached.

[0086] The size of the public hash function refers to the output length of the hash function used in the signature and verification process and the storage space occupied by defining the hash function itself. Specifically, the output size of the hash function is that after the hash function inputs data of any length, it generates a hash value of a fixed length. This fixed-length hash value is brought into the above verification method for repeated verification to obtain the maximum cached hash value, that is, the size of the public hash function that can be cached.

[0087] Among them, the acquisition logic of the generator size is by determining the group structure type. In the IBS scheme, the generator is usually represented as a specific element in the group, which may be a point or an integer. For the group structure, calculate the number of bytes of the generator and sum up the various parts of the generator to obtain the generator size.

[0088] It should be noted that there are two ways to determine the representation of the generator: the elliptic curve group and the cyclic additive group. The generator of the elliptic curve group is usually a coordinate point, and its size is determined by the number of bits of the selected curve. The generator of the cyclic additive group is an integer, and its size depends on the order of the group.

[0089] Among them, the acquisition logic of the hash function output size is by determining the hash algorithm used in the IBS scheme. According to the standards or specifications of the selected hash algorithm, find its output size, and then record the output length of the selected hash algorithm to determine the hash function output size.

[0090] It should be noted that the hash algorithm applied to the IBS scheme is usually used for the input message when generating signatures. Therefore, it is necessary to ensure that the selected hash algorithm has sufficient security and collision resistance to meet the signature requirements. For example, the output size of SHA-256 is 256 bits, that is, 32 bytes, and the output size of SHA-512 is 512 bits, that is, 64 bytes. The selection of this hash algorithm is applied by the experimenters according to the specific implementation situation and is not limited here.

[0091] The remaining storage space refers to the remaining storage space without reducing the storage rate, to limit the cache quantity and ensure the system storage efficiency. Its acquisition logic is by monitoring the storage rate, setting a storage threshold, controlling the storage rate to remain within a certain range value, and subtracting the used storage space from the total storage space to obtain the remaining storage space.

[0092] Among them, the setting of the storage threshold triggers an alarm, for example, when the remaining storage space is lower than a certain percentage, or restricts new data writing operations to maintain the storage rate.

[0093] Determine the caching public information scheme according to the public information data volume of the visitor QR code and the remaining storage space using fuzzy logic;

[0094] For example, "High", "Low", "Medium" for the public information data volume of the visitor QR code, and "Many", "Few", "Moderate" for the remaining storage space;

[0095] Formulate a set of fuzzy rules to describe the influence of different input variables on the output variable. The definition of the rules can be based on professional knowledge or obtained through data analysis and experiments. For example:

[0096] Mark the public information data volume of the visitor QR code as X, the remaining storage space as U, and the caching public information scheme as C_Public;

[0097] Then it can be defined as:

[0098] Rule 1: IF (X is High) AND (U is Many) THEN (C_Public is High)

[0099] Rule 2: IF (U is Low) AND (U is Few) THEN (C_Public is Low) ...

[0100] Conduct fuzzy reasoning according to the fuzzy rules to determine the caching public information scheme;

[0101] It should be noted that the division of the fuzzy set can be adjusted according to the actual situation. For example, although this embodiment takes three fuzzy sets as an example, in fact, the public information data volume of the visitor QR code and the remaining storage space can be divided into more than three sets to facilitate more accurate adjustment according to different public information.

[0102] Furthermore, for the judgment of high, medium, and low values of the public information data volume of the visitor QR code and the remaining storage space, thresholds can be set for judgment according to the actual situation. For example, when the public information data volume of the visitor QR code exceeds 75%, it is marked as "High", and when the remaining storage space is higher than 80%, it is marked as "Many", etc., which will not be elaborated here.

[0103] The visualization port is used to receive the alarm words and the caching public information scheme and report them respectively.

[0104] Through the security verification scheme of digital signature, the present invention obtains the maximized size of the public system parameters that can be cached and the size of the public hash function that can be cached, and formulates a set of fuzzy rules with the remaining storage space for fuzzy inference to determine the caching public information scheme, which improves the QR code verification efficiency while ensuring the system operation speed and the security of the QR code, making it more convenient for visitors to enter and exit.

[0105] The above formulas are all dimensionless and take their numerical values for calculation. The formulas are obtained by collecting a large amount of data for software simulation to get a formula closest to the real situation. The preset parameters in the formulas are set by those skilled in the art according to the actual situation.

[0106] The above embodiments can be implemented in whole or in part by software, hardware, firmware, or any other combination. When implemented using software, the above embodiments can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions or computer programs. When the computer instructions or computer programs are loaded or executed on a computer, the processes or functions described in the embodiments of the present application are generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center in a wired or wireless (such as infrared, wireless, microwave, etc.) manner. The computer-readable storage medium can be any available medium that the computer can access or a data storage device such as a server or data center that contains one or more collections of available media. The available media can be magnetic media (such as floppy disks, hard disks, magnetic tapes), optical media (such as DVDs), or semiconductor media. The semiconductor media can be a solid-state drive.

[0107] It should be understood that in various embodiments of the present application, the order numbers of the above processes do not mean the order of execution. The order of execution of each process should be determined by its function and internal logic, and should not constitute any limitation to the implementation process of the embodiments of the present application.

[0108] Those of ordinary skill in the art can realize that the units and algorithm steps of each example described in combination with the embodiments disclosed herein can be implemented by electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are executed in a hardware or software manner depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present application.

[0109] Those skilled in the art can clearly understand that for the convenience and brevity of description, the specific working processes of the systems, devices, and units described above can refer to the corresponding processes in the foregoing method embodiments and will not be elaborated herein.

[0110] In several embodiments provided in the present application, it should be understood that the disclosed systems, devices, and methods can be implemented in other ways. For example, the device embodiments described above are merely illustrative. For example, the division of the units is only a logical function division, and there may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the displayed or discussed couplings or direct couplings or communication connections to each other can be through some interfaces. The indirect couplings or communication connections of the devices or units can be in electrical, mechanical, or other forms.

[0111] The units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they can be located in one place or distributed to multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0112] In addition, in each embodiment of the present application, the functional units can be integrated in a processing unit, or each unit can exist physically alone, or two or more units can be integrated in one unit.

[0113] If the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, in essence, or the part that contributes to the prior art or part of this technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in each embodiment of the present application. The foregoing storage medium includes: various media such as USB flash drives, mobile hard disks, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical discs that can store program codes.

[0114] As described above, it is only the specific implementation manner of this application, but the protection scope of this application is not limited thereto. Any person skilled in the art within the technical scope disclosed by this application can easily think of changes or substitutions, which should all be covered within the protection scope of this application. Therefore, the protection scope of this application shall be subject to the protection scope of the claims described.

Claims

1. A visitor reservation management system, characterized in that: It includes a data acquisition module, a special processing module, a data analysis module, a signature security module, and a visualization port; the signals are connected between the modules; The data acquisition module is used to collect the information of visitors who have entered the venue before the specified time and their QR code information. Through data processing, it obtains the number of times visitors enter and leave the venue, the historical access arrival rate, the digital signature security, and the signature calculation efficiency, and sends them to the special processing module; The special processing module is used to obtain the information of visitors who have entered the venue before the specified time and their QR code information, establish a data analysis model, obtain a cache evaluation coefficient, and send it to the data analysis module; Among them, the process of obtaining the cache evaluation coefficient is as follows: Obtain the number of times Io that visitors enter and leave the venue i , historical access arrival rate Ar i , digital signature security Pc i and signature calculation efficiency Ce i , establish a data analysis model to generate a cache evaluation coefficient Ca i , and the formula is as follows: Where Ca i is the cache evaluation coefficient, and are preset proportional coefficients for the number of times a visitor enters and exits the venue, the historical access arrival rate, the digital signature security, and the signature calculation efficiency, and and are all greater than 0; The data analysis module is used to obtain the cache evaluation coefficient, compare it with the cache threshold to obtain a comparison result, and based on this, conduct a cache determination on the QR code of each visitor, generate a cache signal and send it to the signature security module; and count the comparison result value, compare it with the alarm threshold, and send the alarm message to the visualization port; The signature security module is used to obtain the cache signal, obtain the public information data volume of the visitor's QR code, collect the remaining storage space, use fuzzy logic to determine the cache public information scheme, and send it to the visualization port; Among them, the process of collecting the remaining storage space and using fuzzy logic for the public information data volume of the visitor's QR code and the remaining storage space to determine the cache public information scheme is as follows: By monitoring the storage rate, setting a storage threshold, controlling the storage rate to remain within a certain range value, subtracting the used storage space from the total storage space to obtain the remaining storage space. Define the public information data volume of the visitor's QR code and the remaining storage space as input variables, and divide them into different fuzzy sets respectively; Define the cache public information scheme as an output variable and divide it into a fuzzy set; Formulate fuzzy rules to describe the influence of the public information data volume of the visitor's QR code and the remaining storage space on the cache public information scheme; Conduct fuzzy reasoning according to the fuzzy rules to determine the cache public information scheme. The visualization port is used to receive the alarm message and the cache public information scheme and report them respectively.

2. The visitor appointment management system according to claim 1, wherein: By tracking and counting the identity information and access records of visitors, the number of accesses of visitors at the current time is calculated to obtain Io i ; where i is the i-th visitor; and the number of visitors corresponds to the number of two-dimensional codes, that is, i is also the i-th two-dimensional code; By tracking the visitor identity information and storing the arrival situation of each visitor in the database, the historical visit arrival rate Ar is calculated based on the ratio of the number of on-time arrivals to the total number of arrivals. i ; For the QR code generated based on IBS, the security of the generated digital signature is ensured by the collision resistance of the hash function. The complexity of using the birthday attack is approximately 2 n / 2 , and the security Pc of the digital signature is obtained through probability expression i ; where n is the output bit number of the hash function By measuring the number of computational operations and time consumption during the signature generation and verification processes, determining the number of signatures that can be generated and verified per unit time, and obtaining the signature calculation efficiency Ce i .

3. The visitor appointment management system according to claim 1, wherein: After obtaining the cache evaluation coefficient, compare and analyze the cache evaluation coefficient with the continuously iterated cache threshold; If the cache evaluation coefficient is greater than or equal to the cache threshold, cache the public information of the QR code of this visitor and generate a cache signal; If the cache evaluation coefficient is less than the cache threshold, continue to monitor the QR code of this visitor in the background and generate an end signal.

4. The visitor appointment management system according to claim 3, wherein: Count the comparison results where the cache evaluation coefficient is greater than or equal to the cache threshold, statistically calculate its value, and compare it with the alarm threshold. If it is greater than the alarm threshold, generate an alarm message.

5. The visitor appointment management system according to claim 4, wherein: The public information data volume of the visitor's QR code includes the size of the public system parameters that can be cached and the size of the public hash function that can be cached. The maximum cache volume is obtained through the security verification scheme of the digital signature.

6. The visitor appointment management system according to claim 5, characterized in that: By determining the type of group structure, calculating the number of bytes of the generator, summing up each part of the generator to obtain the generator size, and then repeatedly verifying the digital signature security scheme, based on maximizing the cached public system parameters, the size of the public system parameters that can be cached is obtained; By determining the hash algorithm used in the IBS scheme, recording according to the output length record of the selected hash algorithm to determine the hash function output size, and repeatedly verifying the digital signature security scheme, based on maximizing the cached public hash function, the size of the public hash function that can be cached is obtained.

Images