To mask information about the characters on a vehicle's license plate, a character code permanently stored in a camera is used to generate a speeding ticket.

The method and system provide enhanced data protection and tamper-proof evidence for generating speeding tickets by using a masked character code stored in a hardwired memory to secure license plate information, addressing the lack of robust protection in existing systems.

JP7872115B2Active Publication Date: 2026-06-09INTERNATIONAL BUSINESS MACHINE CORPORATION

Patent Information

Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
INTERNATIONAL BUSINESS MACHINE CORPORATION
Filing Date
2022-11-25
Publication Date
2026-06-09

Smart Images

  • Figure 0007872115000001
    Figure 0007872115000001
  • Figure 0007872115000002
    Figure 0007872115000002
  • Figure 0007872115000003
    Figure 0007872115000003
Patent Text Reader

Abstract

A computer-implemented method for generating a speeding ticket is disclosed. The method includes generating a first image of at least a portion of a vehicle by a first camera, detecting a first set of characters on a license plate of the vehicle in dependence on the first image, and generating a secured file by the first camera using the first set of characters and a first character code. The method may further include generating a second image of the portion of the vehicle by a second camera and detecting a second set of license plate-dependent characters in dependence on the second image. The method further includes generating a speeding ticket in response to determining that the vehicle is violating a speed limit and in response to verifying that the first set of characters is equal to the second set of characters.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention generally relates to traffic monitoring, and more particularly to a method, a system, and a camera for generating speeding tickets.

[0002] A system for issuing speeding tickets may measure the actual speed or average speed of a vehicle. When the average speed is measured, it may be necessary to store first data regarding the vehicle, such as the characters of the license plate generated by a first measurement component of the system, during the time the average speed is measured. The first data regarding the vehicle may be transferred within a communication network for processing this data together with second data regarding the vehicle generated by a second measurement component of the system. To enhance the data protection of this data, it is known to generate a hash value of the data regarding the vehicle.

Summary of the Invention

[0003] In one aspect, a computer-implemented method for generating speeding tickets is provided. The computer-implemented method includes generating a first image of at least a portion of a vehicle by a first camera, the first camera positioned at a first location on the road, where the portion of the vehicle includes the vehicle's license plate, and the license plate includes letters. The computer-implemented method further includes detecting a first set of letters on the vehicle's license plate, depending on the first image. The computer-implemented method further includes generating a protection file by the first camera using the first set of letters on the license plate and a first character code, the protection file including a masked version of the first set of letters on the license plate. The computer-implemented method further includes generating a second image of a portion of the vehicle by a second camera, the second camera positioned at a second location on the road. The computer-implemented method further includes detecting a second set of letters on the license plate, depending on the second image. The computer-implemented method further includes verifying, using the protection file, whether the first set of letters is equal to the second set of letters. The computer implementation method further includes checking whether the vehicle is in violation of a speed limit, depending on information regarding the average speed of the vehicle between a first position and a second position. The computer implementation method further includes generating a speeding ticket in response to determining that the vehicle is in violation of a speed limit and verifying that a first set of characters is equal to a second set of characters.

[0004] In another aspect, a camera is provided for generating a protection file. The camera is configured to generate a first image of at least a portion of a vehicle, the camera comprising a memory device for persistently storing a first character code inaccessible from the camera to the outside, the portion of the vehicle including the vehicle's license plate, the license plate including characters, the camera detecting a first set of characters on the vehicle's license plate depending on the first image, and the camera generating a protection file using the first set of characters on the license plate and the first character code, the protection file including a masked version of the first set of characters on the license plate.

[0005] On another note, a system for generating speeding tickets is provided. The system includes a first camera and a second camera. The system is configured to generate a first image of at least a portion of a vehicle using a first camera, wherein the first camera is positioned at a first location on the road, the portion of the vehicle includes the vehicle's license plate, and the license plate includes letters, to detect a first set of letters on the vehicle's license plate depending on the first image, to generate a protection file using the first set of letters on the license plate and a first character code using the first camera, wherein the protection file includes a masked version of the first set of letters on the license plate, to generate a second image of a portion of the vehicle using a second camera, wherein the second camera is positioned at a second location on the road, to detect a second set of letters on the license plate depending on the second image, to verify whether the first set of letters is equal to the second set of letters using the protection file, to check whether the vehicle is in violation of a speed limit depending on information about the vehicle's average speed between the first and second locations, and to generate a speeding ticket in response to the determination that the vehicle is in violation of a speed limit and in response to the verification that the first set of letters is equal to the second set of letters.

[0006] Hereinafter, embodiments of the present invention will be described in more detail, only as examples, with reference to the drawings. [Brief explanation of the drawing]

[0007] [Figure 1] This is a block diagram schematically showing a system for generating vehicle speeding tickets, including a first camera and a second camera. [Figure 2] This is the first image showing the license plate of the vehicle shown in Figure 1. [Figure 3] This figure shows the first set of detected characters on the license plate shown in Figure 2. [Figure 4] This figure shows a protected file generated using the first set of characters shown in Figure 3. [Figure 5] This is a second image showing the license plate of the vehicle shown in Figure 1. [Figure 6] This figure shows the second set of detected characters from the license plate shown in Figure 5. [Figure 7] Figure 1 shows a block diagram of the first camera. [Figure 8] Figure 1 shows a block diagram of the second camera. [Figure 9] This is a flowchart of the method for generating speeding tickets for vehicles. [Figure 10] This is a diagram showing an example of a speeding ticket. [Figure 11] The figure shows further examples of speeding tickets. [Figure 12] The figure shows further examples of speeding tickets. [Figure 13] The figure shows further examples of speeding tickets. [Figure 14] Figure 10 shows a verification server used by national authorities to verify speeding tickets. [Figure 15] Figure 10 is a flowchart illustrating the method for verifying speeding tickets. [Figure 16]This figure shows a further example of the system shown in Figure 1, which includes multiple pairs of cameras for generating multiple speeding tickets, as shown in Figure 18. [Figure 17] This figure shows multiple evaluation units for generating multiple speeding tickets, as shown in Figure 18. [Figure 18] This figure shows multiple speeding tickets generated by the system shown in Figure 16. [Figure 19] This figure shows a blockchain network for permanently storing multiple speeding tickets, as shown in Figure 18. [Figure 20] This figure shows a blockchain containing blockchain elements for permanently storing multiple speeding tickets as shown in Figure 18. [Modes for carrying out the invention]

[0008] The descriptions of various embodiments of the present invention are presented for illustrative purposes but are not intended to exhaust or limit the disclosed embodiments. Many modifications and variations will be apparent to those skilled in the art without departing from the scope and spirit of the described embodiments. The terminology used herein has been selected to best describe the principles of the embodiments, their practical applications, or technical improvements to the art found in the market, or to enable those else skilled in the art to understand the embodiments disclosed herein.

[0009] The proposed method can enable higher data protection for a first set of characters on a license plate (hereinafter also referred to as the first set of characters). This is because the first character code generates a protection file containing a masked version of the first set of characters. The data protection for the first set of characters that can be achieved using the proposed method may be higher than the data protection achieved by simply hashing the first set of characters using, for example, a secure hash algorithm (SHA)-256. In this case, the first set of characters can be reconstructed using a "rainbow table" which may contain all combinations of characters having a length equal to the number of characters in the first set of characters, and their corresponding hash values. In addition, since the first character code is hardwired and permanently stored in the persistent memory device of the first camera and is inaccessible from outside the first camera, the data protection for the first set of characters may be further increased.

[0010] Data protection for the first set of characters may be useful for transferring information about the first set of characters from a first camera to a second camera. For example, such a transfer may be performed to check whether a vehicle is violating a speed limit. This transfer can be performed by sending a protected file from the first camera to the second camera. Furthermore, in one example, information about the first set of characters may be sent from the first camera to a state authority, for example, as part of a speed ticket. In this case, the proposed method may also make higher data protection information available for the first set of characters. The proposed method may further include checking whether a vehicle is violating a speed limit and deleting the protected file if it is indicated that the vehicle is not violating a speed limit.

[0011] Furthermore, the protection file can also be used to prove that it was generated by a first camera. This is because the protection file is generated using a first character code, the first character code is hardwired into the first camera's persistent memory device, and the first character code is stored in the first camera's memory device in a way that prevents access from outside the first camera. In addition, since the first camera is positioned at a first location on the road, the protection file could serve to prove that a vehicle has passed that first location on the road. In one example, a national authority and only a national authority may have access to a verification server that stores the first character code in order to verify that the protection file was generated by the first camera. In a further example, a national authority may have access to a verification server that stores the public key of the first camera in order to verify that the protection file was generated by the first camera. In one example, a speeding ticket includes a protection file. In a further example, a speeding ticket may be designed in the form of a protection file.

[0012] Since a protection file is generated using a first character code, and the first character code is permanently stored in the persistent memory device of the first camera via a hardwired method, and the first character code is stored in the memory device of the first camera in a manner that prevents access from outside the first camera, the proposed method can be considered a highly tamper-proof method for generating a protection file. As a result, the proposed method can be used, for example, to generate a tamper-proof certificate indicating that a vehicle has passed a first location on a road by generating a protection file. For example, if the first character code is stored on a verification server, the first character code is stored in the memory device of the first camera in a manner that prevents access from outside the first camera, and is therefore accessible only to national authorities, separate from the respective processing units of the first or second camera.

[0013] The first and second images can include the front or rear of the vehicle. Thus, a part of the vehicle can be part of the front or rear of the vehicle. In most cases, a part of the vehicle can include a part of the lower portion of the front or rear of the vehicle such that the license plate can be constituted by a part of the vehicle.

[0014] The first camera and the second camera can each include an optical system and a respective processing unit for generating a first image depending on an electronic signal of the optical system of the first camera and for generating a second image depending on an electronic signal of the optical system of the second camera. The first camera can generate a first image at a first time point. Generation of the first image can include storing the first image in the memory of the first camera in the form of a first image file. Similarly, the second camera can generate a second image at a second time point. Generation of the second image can include storing the second image in the memory of the second camera in the form of a second image file.

[0015] The first camera can be arranged at a first position on the road such that the optical system of the first camera captures vehicles passing by the first position on the road. The first position can be defined by a first structure of the road, such as a pillar of a road bridge intersection, or a first additional structure arranged adjacent to the road. The first position can be defined by first GPS coordinates. Similarly, the second camera can be arranged at a second position on the road such that the optical system of the second camera captures vehicles passing by the second position on the road. The second position can be defined by a second structure of the road, such as a pillar of a road bridge intersection, or a second additional structure arranged adjacent to the road. The second position can be defined by second GPS coordinates.

[0016] It can be configured to detect a first set of characters depending on the first image. For example, the first camera can include a character recognition module for recognizing the first set of characters. The recognition module may be configured to read and process the first image file and execute a pattern recognition algorithm for recognizing each character of several pull rates constituted by the first image file. The characters of the license plate detected by means of the first camera are referred to as the first set of characters of the present disclosure.

[0017] Similarly, the second camera can be configured to detect a second set of license plate characters depending on the second image. For example, the second camera can include a character recognition module or a further character recognition module for recognizing the second set of license plate characters. The recognition module may be configured to read and process the first image file and execute a pattern recognition algorithm for recognizing each character of the license plate constituted by the second image file. The characters of the license plate detected by means of the second camera are referred to as the second set of characters of the present disclosure.

[0018] As used herein, the term "masked version of the first set of characters" refers to a version of the first set of characters from which the first set of characters generally cannot be restored, or can only be restored by means of the first character code or a decryption key corresponding to the first character code. The term "masked" means that the first set of characters cannot be read by simply reading the masked version of the first set of characters. Further, the masked version of the first set of characters may depend on the first set of characters such that a change in the first set of characters can cause a change in the masked version of the first set of characters. Since the first set of characters cannot be read by the protection file alone, the protection file is considered to be secure. Generation of the protection file may include generating a masked version of the first set of characters using the first set of characters and the first character code.

[0019] The first camera can be configured to generate a protected file by, for example, using a transformation function to calculate a masked version of the first set of characters depending on the first set of characters and the first character code, and writing the masked version of the first set of characters of the license plate to the protected file. The transformation function may be a one-way function or an encryption function.

[0020] In one example, the first character code could be uniquely generated for the first camera. This may increase the confidence that the protected file was generated by the first camera. In another example, the first character code is generated by a random seed. This may increase the likelihood that the first character code is a unique character code.

[0021] The persistent memory device of the first camera (hereinafter also referred to as the first persistent memory) can be designed in the form of read-only memory (ROM). The first character code stored in the first persistent memory cannot be electronically modified after the first persistent memory is installed in the first camera. The first persistent memory can store the first character code in a hardwired manner. For example, the first persistent memory can be designed in the form of a diode matrix or mask ROM integrated circuit installed in the first camera. The first persistent memory can store the first character code in a hardwired manner such that the electronic connection of the first persistent memory is designed to read the first character code from the first persistent memory. The first character code can be written to the first persistent memory during the manufacturing process of the first persistent memory, for example, by generating the electronic connection of the first persistent memory. In one example, the first persistent memory may be programmable read-only memory (PROM).

[0022] Generally, data stored in a first persistent memory containing a first character code may be unmodifiable from outside the first camera. However, in one example, the first persistent memory can be designed to be unmodifiable from outside the first camera in the form of an erasable programmable read-only memory (EPROM) installed in the first camera. For example, the EPROM may be covered by the case of the first camera. In this case, the first camera may include a seal that must be broken to open the case of the first camera in order to penetrate the inside of the first camera and expose the first persistent memory to ultraviolet light for reprogramming the EPROM. A broken seal may indicate that the first persistent memory has been modified according to this example.

[0023] The first persistent memory stores the first character code in a manner that prevents access from outside the first camera. This may implicitly indicate that the first character code is readable only by the processing unit of the first camera, which is located inside the first camera. Thus, the first character code cannot be read by further devices located outside the first camera and having short- or long-range radio connections to the first camera. In one example, the first camera may be designed so that it cannot establish radio wave connections to further devices or other devices. In this case, the output signals of the first camera can only be transmitted by wire. In a further example, the first camera may be configured so that data can only be transmitted from the first camera to further devices, and not from further devices to the first camera.

[0024] In the following, we may refer to verifying that the first set of characters is equal to the second set of characters as simply "verifying."

[0025] Information regarding the vehicle's average speed may, in one example, represent a value for the vehicle's average speed. In another example, information regarding the average speed may indicate that this information is greater than the speed limit. The value for the average speed can be obtained by measuring the time it takes for the vehicle to travel from a first position to a second position. The first camera may record a first time point when generating a first image, and the second camera may record a second time point when generating a second image. The first and second cameras may be stationary. Thus, the length of the road between the first and second positions can be considered a fixed length. The evaluation unit can calculate the vehicle's average value depending on the fixed length and the time difference between the first and second time points. The evaluation unit may be installed on the first or second camera, or it may be located outside of the first and second cameras.

[0026] According to one embodiment, generating a protected file may include generating a first string. The first string may include a first character code and a first set of characters. Furthermore, generating a protected file may include calculating a hash value of the first string by a first camera using a hash function, and the protected file may include the hash value of the first string. According to this embodiment, the hash value of the first string may be a masked version of the first set of characters, and the hash function may be a conversion function. Furthermore, according to this embodiment, generating a protected file may further include generating a second string. The second string may include a first character code and a second set of characters. Furthermore, generating a protected file may include calculating a hash value of the second string by a second camera using a hash function. Verification may include comparing the hash value of the first string with the hash value of the second string. The second camera may include a persistent memory device that hardwires and permanently stores the first character code inaccessible from outside the second camera. Thus, according to this embodiment, the first character code can be considered a shared secret that is simultaneously stored in the first persistent memory and the persistent memory of the second camera.

[0027] As used herein, the term "hash value" may mean the output value of a hash function. A hash function may be configured to compute its output value as the corresponding hash value of the input data, depending on the input data of the hash function and the algorithm of the hash function. The algorithm of the hash function may be a secure hash algorithm (SHA)-256, unless otherwise specified. In particular, the hash function may be a cryptographic hash function.

[0028] A hash function can calculate a hash value of input data in such a way that the original data cannot be obtained (unhash) from the hash value of the input data. Hash functions and their algorithms can be designed so that even slight changes in the input data result in a hash value that is entirely different from the hash value of the input data. The output value of a hash function can have a fixed length that depends on the size of the input data. The length of the output value of a hash function may be 256 bits, in which case the algorithm of the hash function is the secure hash algorithm (SHA)-256. The input data for a hash function can be a binary file. A binary file can represent characters and / or numbers in binary format.

[0029] According to the embodiment described above, for example, the input data of the hash function may be a first string, and the output value of the hash function may be the hash value of the first string. The hash value of the first string can be thought of as the salted hash value of a first set of characters. To calculate the hash value of a second string, the input data of the hash function may be a second string. In this case, the output value of the hash function may be the hash value of the second string. The hash value of the second string can be thought of as the salted hash value of a second set of characters.

[0030] The persistent memory device of the second camera, hereinafter also referred to as the second memory, can be designed in the form of read-only memory (ROM). The first character code stored in the second persistent memory cannot be electronically modified after the second persistent memory is installed in the second camera. The second persistent memory can store the first character code in a hardwired manner. For example, the second persistent memory can be designed in the form of a diode matrix or mask ROM integrated circuit installed in the second camera. The second persistent memory can store the first character code in a hardwired manner such that the electronic connection of the second persistent memory is designed to read the first character code from the second persistent memory. The first character code can be written to the second persistent memory during the manufacturing process of the second persistent memory, for example, by generating the electronic connection of the second persistent memory. In one example, the second persistent memory is programmable read-only memory (PROM).

[0031] Generally, data stored in a second persistent memory containing a first character code may be unmodifiable from outside the second camera. However, in one example, the second persistent memory can be designed to be unmodifiable from outside the second camera in the form of an erasable programmable read-only memory (EPROM) installed in the second camera. For example, the EPROM may be enclosed by the case of the second camera. In this case, the second camera may include a seal that must be broken to open the case of the second camera in order to penetrate the inside of the second camera and expose the second persistent memory to ultraviolet light for reprogramming the EPROM. A broken seal may indicate that the second persistent memory has been modified according to this example.

[0032] A second persistent memory may store the first character code in a manner that prevents access from outside the second camera. This may implicitly indicate that the first character code is readable only by the processing unit of the second camera, which is located inside the second camera. Thus, the first character code cannot be read by further devices located outside the second camera and having short- or long-range radio connections to the second camera. In one example, the first camera may be designed so that it cannot establish radio wave connections to further devices or other devices. In this case, the output signals of the second camera can only be transmitted by wire. In a further example, the second camera may be configured so that data can only be transmitted from the second camera to further devices, and not from further devices to the first camera.

[0033] The advantage of verifying the hash values ​​of the first and second strings by means of hash values ​​is that these hash values ​​can be computed using a known hash function such as the secure hash algorithm (SHA)-256, which is available as open-source software. The first camera can store the hash function on its first persistent memory or on an additional memory device of the first camera, and the second camera can store it on its second persistent memory or on an additional memory device of the second camera. The first character code can be used to create hash values ​​of the first and second strings in the form of salted hash values, and the first character code can be considered as the salt value.

[0034] Furthermore, according to the embodiments described above, if the first character code is used as a shared secret key and the second camera also uses a hash function to generate a hash value of the second string, it is not necessary to demask information about the first set of characters in order to perform verification. This can enhance data protection of the first set of characters. A speeding ticket may include a hash value of the first or second string.

[0035] According to one embodiment, a first character code is uniquely generated for each pair of cameras, where each pair of cameras includes a first camera and a second camera. For example, the first character code can be uniquely generated for each pair of cameras by generating the first character code using the random seed described above. This embodiment may enhance the confidence that a vehicle has passed through first and second locations on the road. The verification server may store information regarding the fact that the first character code was uniquely generated for the first and second cameras.

[0036] According to one embodiment, the generation of a protected file may include generating a signature of a first set of characters (hereinafter referred to as the first signature) using a first character code as a common secret key for the first and second cameras. The protected file may contain the first signature. According to this embodiment, the first signature may be a masked version of the first set of characters, and the signature algorithm may be a conversion function. According to this embodiment, the method may further include generating a signature of a second set of characters (hereinafter referred to as the second signature) using the first character code. Verification may include comparing the first signature and the second signature. According to this embodiment, the second camera includes the second persistent memory described above, which stores the first character code permanently in a hardwired manner and inaccessible from outside the second camera, as described above. In one example, a speeding ticket may include the first signature and / or the second signature.

[0037] For example, generating a first signature might involve signing the hash value of a first set of characters using a first character code as a common secret key. In this case, the signed hash value of the first set of characters could be the first signature. A first camera can generate the hash value of the first set of characters using the first character code and a hash function. Similarly, generating a second signature might involve signing the hash value of a second set of characters using the first character code as a common secret key. In this case, the signed hash value of the second set of characters could be the second signature. A second camera can generate the hash value of the second set of characters using the first character code and a hash function.

[0038] Using the first signature further strengthens the confidence that the protected file was generated by either the first or second camera. This is because the involvement of a Certificate Authority is necessary to obtain the common secret key and the corresponding common public key. For example, the first signature can be considered the protected file. A further advantage of using the first and second signatures is that the first character code does not need to verify that the first signature was created by the first camera or that the second signature was created by the second camera. Such verification can be done using the common public key. Therefore, the first character code does not need to be stored on the verification server in order to verify that the protected file was generated by the first camera. Instead, the common public key can be stored on the verification server. The common public key can be shared without losing data protection for the first character set.

[0039] A further advantage of using first and second signatures for verification is that a common public key is not required for verification. However, not using a common public key in general may make it impossible to prove that a protected file was generated by the first or second camera. If the common public key is not published, i.e., unavailable to the public, it may be advantageous to use a common secret key and not use a common public key in general. In this case, data protection for the first set of characters may be further enhanced. This may be especially true if the signed hash value of the first set of characters is the first signature.

[0040] According to one embodiment, the method may further include storing the hash value of the first string locally in the first camera and transmitting the hash value of the second string from the second camera to the first camera.

[0041] Similarly, according to one embodiment, the method may further include locally storing the first signature in the first camera and transmitting the second signature from the second camera to the first camera. This embodiment and the embodiments described above may have the advantage that neither the hash value of the first string nor the first signature needs to be transmitted to a device outside the first camera in order to perform verification. As a result, data protection of information about the first set of characters may be increased.

[0042] According to one embodiment, the method may further include storing a protection file in a memory device and automatically deleting the protection file in the memory device after a predetermined time has elapsed. The predetermined time may be equal to the shortest possible time required to travel along the road from a first location to a second location without violating a speed limit. According to this embodiment, checking whether the vehicle is violating a speed limit may include successfully reading the protection file from the memory device. In one example, the first camera may include the memory device.

[0043] Since the length of the road and the speed limit between the first and second positions can be considered predetermined, the predetermined time can be calculated depending on the length of the road and the speed limit between the first and second positions. The method may further include executing a read command to read a protected file from a memory device in response to the first camera receiving a hash value of a second string or a second signature from the second camera. In this case, the protected file is not deleted, and the read command can be executed successfully. A successful read of the protected file may implicitly indicate that the vehicle is in violation of the speed limit. In this case, the read of the protected file fails because the protected file is deleted, which may implicitly indicate that the vehicle is not in violation of the speed limit. Thus, this embodiment may cause a first set of characters or information about a first set of characters, for example, a hash value of a first set of characters or a first signature, not to be stored for longer than a predetermined time. As a result, this embodiment may enhance data protection for the first set of characters.

[0044] According to one embodiment, generating a protected file may involve generating a first further signature of a first set of characters using a first character code as the private key of a first camera, and the protected file includes the first further signature. In this embodiment, the first further signature can be considered a masked version of the first set of characters. According to this embodiment, verification may involve verifying the first further signature with the public key of the first camera corresponding to the private key of the first camera and a second set of characters. In this embodiment, the first character code can be stored only in first persistent memory, which allows for enhanced protection of the first character code. The first camera can transmit the first further signature to a second camera. In one example, the second camera can perform verification of the first further signature depending on the public key, the first further signature of characters, and the second set of characters. According to this example, verification of the first further signature may succeed if the first set of characters is equal to the second set of characters.

[0045] In one example, generating a first additional signature might involve using a first character code as the secret key of the first camera to sign the hash value of a first set of characters. In this case, the signed hash value of the first set of characters could be the first additional signature. The first camera can use the first set of characters and a hash function to create the hash value of the first set of characters. The first camera can then send the first additional signature to the second camera. In one example, the second camera can perform verification of the first additional signature, relying on a public key, the first additional signature, and the hash value of a second set of characters. The second camera can use the second set of characters and a hash function to create the hash value of a second set of characters. According to this example, verification might succeed if the hash value of the first set of characters is equal to the hash value of the second set of characters.

[0046] Using a first additional signature can further strengthen the confidence that the protected file was generated by the first camera. This is because a certificate authority would need to be involved to obtain the first camera's private key and the first camera's public key corresponding to the first camera's private key. For example, the first additional signature can be considered a protected file. Another advantage of using the first additional signature is that the first character code does not need to verify that the first additional signature was created by the first camera. Such verification can be done using the first camera's public key. Therefore, the first character code does not need to be stored on the verification server in order for it to be possible to verify that the protected file was generated by the first camera. Instead, the first camera's public key may be stored on the verification server.

[0047] According to one embodiment, generating a protected file may include generating an encrypted version of a first set of characters using a first character code as a symmetric encryption key for a first camera and a second camera. In this case, the encrypted version of the first set of characters may be a masked version of the encrypted version of the first set of characters. According to this embodiment, the protected file may include the encrypted version of the first set of characters. Verification may include decrypting the encrypted version of the first set of characters using the first character code. Furthermore, according to this embodiment, the second camera may include a persistent memory device that permanently stores the first character code in a hardwired manner and inaccessible from outside the second camera. The first camera can transmit the encrypted version of the first set of characters to the second camera. The second camera can decrypt the encrypted version of the first set of characters. This embodiment can present a version based on the proposed method, according to which the first set of characters can have high protection. Providing a symmetric encryption key may be simpler than providing a common secret key.

[0048] According to one embodiment, the method further includes storing the hash value of a first string in the local memory of a first camera and encrypting the hash value of a second string depending on the public key of the first camera. According to this embodiment, the method further includes transmitting the encrypted hash value of the second string to the first camera and decrypting the encrypted hash value of the second string. The first camera can decrypt the encrypted hash value of the second camera. According to this embodiment, verification may include the first camera comparing the hash value of the second string with the hash value of the first string. Firstly, this embodiment may have the advantage that the hash value of the first string is not transmitted anywhere on the first camera. This can enhance data protection for the first set of characters. Secondly, by encrypting the hash value of the second string, data protection for the second set of characters can be enhanced. Therefore, in addition to providing tamper-proof evidence that the vehicle passed a first or second location by using a first character code to hash a first string, this embodiment can enhance data protection for the first and second sets of characters.

[0049] According to one embodiment, the method may further include calculating an approximate timestamp by a first camera and calculating an approximate timestamp by a second camera. In this embodiment, the first string may include an approximate timestamp and a first set of characters, and may also be called the extended first string. Similarly, the second string may include an approximate timestamp and a second set of characters, and may also be called the extended second string. The first camera can calculate a general timestamp by rounding the actual timestamp of the first camera's clock to the next minute or second. Similarly, the second camera can calculate an approximate timestamp by rounding the actual time of the second camera's clock to the next minute or second. In this case, the clocks of the first camera and the second camera can be synchronized to the exact minute or second.

[0050] An approximate timestamp may prove that the vehicle passed through the first and second locations at approximately the same time indicated by the approximate timestamp. Furthermore, according to this embodiment, since the first and second strings include a first character code in addition to the approximate timestamp, this embodiment can provide a tamper-proof method for including an approximate timestamp in a protected file. Moreover, according to this embodiment, since the first and second strings are extended, it can be made more difficult to compromise the hash values ​​of the first and second strings.

[0051] In another example, the first signature may be the signature of an extended first string generated by a first character code as a common secret key for the first and second cameras. Similarly, the second signature may be the signature of an extended second string generated by a first character code as a common secret key.

[0052] According to one embodiment, the method may further include generating a first string and a second string such that the first string includes information about the location of a road section and the second string includes information about the location of a road section. According to this embodiment, a road section may include a first location and / or a second location. In one example, the information about the location of a road section may include the GPS coordinates of the first location and / or the GPS coordinates of the second location. The information about the location of a road section may allow a vehicle driver to prove that they have driven through a road section. Furthermore, according to this embodiment, the first string and the second string include a first character code in addition to the information about the location of a road section, and this embodiment can provide a tamper-proof method for including information about the location of a road section in a protected file. Furthermore, according to this embodiment, the first and second strings are extended, making it more difficult to compromise the hash values ​​of the first and second strings.

[0053] In a further modification of this embodiment, the first string may include an approximate timestamp, information about the location of a section of road, and a first set of characters, and may also be referred to as the further extended first string. Similarly, according to this modification of the embodiment, the second string may include an approximate timestamp, information about the location of a section of road, and a second set of characters, and may also be referred to as the further extended second string. Thus, according to this modification of the embodiment, the first and second strings can be further extended, making it more difficult to compromise the hash values ​​of the first and second strings.

[0054] In another example, the first signature may be a signature of a further extended first string generated by a first character code as a common secret key for the first and second cameras. Similarly, the second signature may be a signature of a further extended second string generated by a first character code as a common secret key.

[0055] According to one embodiment, the method may further include generating a further file containing the license plate characters and a protection file. According to this embodiment, the generation of the speeding ticket includes encrypting the further file using a public key of the national authority, and the speeding ticket includes the encrypted further file. In one example of this embodiment, the speeding ticket is designed as the encrypted further file. In another example, the speeding ticket is the further file, and the encrypted further file may represent the encrypted speeding ticket.

[0056] As used herein, the term “national authority” may refer to any government agency responsible for administering speeding tickets. Encryption can further enhance the data protection of license plate characters. Furthermore, in this embodiment, additional files may include a protected file, allowing the use of a speeding ticket to prove that a vehicle passed a first location. To this end, the encrypted additional files can be decrypted using the national authority’s private key.

[0057] Evidence that a vehicle has passed a first location can be created by duplicating a protective file containing the hash value of a first string. This can be achieved by duplicating the protective file using a further decrypted file and the license plate characters given by the first character code and hash function. As mentioned above, the first character code may, for example, be stored on a verification server of a national authority.

[0058] Furthermore, evidence that a vehicle has passed a first location can be created by verifying a protected file if the protected file contains a first signature. This can be achieved by verifying that a first set of characters was signed by a first camera. Such verification can be performed using the license plate characters provided by a further decrypted file and the public key of the first camera, or a common public key for the first and second cameras. As mentioned above, in one example, the public key of the first camera or the common public key may be stored on a verification server of the national authority.

[0059] According to one embodiment, the generation of a further file may include generating a masked version of the first or second image depending on the first or second image and a first character code, and writing the masked version of the first or second image to a further file. The first or second image may be used to prove that a vehicle driver has passed a first location. The masked version of the first or second image generated by the first character code may represent a tamper-proof version of the first or second image.

[0060] In one example, the first camera can generate a masked version of the first or second image in the form of a salted hash value of the first or second image. The first camera can execute the hash function or the first further hash function such that the input data for the hash function or the first further hash function is a third string containing the pixel values ​​and first character codes of the first or second image, and the output value of the hash function or the first further hash function can be the hash value of the third string. In this example, the hash value of the third string can be the salted hash value of the first or second image.

[0061] In another example, the first camera can use the first character code as the secret key of the first camera to generate a masked version of the first or second image in the form of a second further signature. In this example, the second further signature may be a signature of the pixel values ​​of the first or second image.

[0062] According to one embodiment, the method may further include measuring the average speed of the vehicle, generating a masked version of the average speed depending on the average speed and a first character code, and writing the masked version of the average speed to a further file.

[0063] The evaluation unit can calculate the average speed as described above. The average speed can serve as proof that the vehicle violated the speed limit. A masked version of the average speed generated by the first character code may represent a tamper-proof version of the average speed.

[0064] As an example, the first camera can generate a masked version of the average speed in the form of a salted hash value of the average speed. The first camera can execute a hash function or a second further hash function such that the input data for the hash function or a second further hash function is a fourth string containing the average speed and a first character code, and the output value of the hash function or the second further hash function can be the hash value of the fourth string. In this example, the hash value of the fourth string could be the salted hash value of the average speed.

[0065] In another example, the first camera can use the first character code as the secret key of the first camera to generate a masked version of the average speed in the form of a third further signature. In this example, the third further signature may be a signature of the average speed.

[0066] According to one embodiment, the method may further include repeating the method for generating speeding tickets, resulting in the generation of multiple speeding tickets. The method may further include permanently storing the speeding tickets together as a whole so that they cannot be deleted or altered. Permanently storing the speeding tickets together can increase the level of protection against the forgery of a single speeding ticket among multiple tickets.

[0067] According to one embodiment, speeding tickets can be permanently stored together as a whole in the form of a blockchain. Each copy of the blockchain can be stored on each node of the blockchain network. Using a blockchain to store speeding tickets has the advantage that to invalidate a single speeding ticket, the entire blockchain would have to be rebuilt, which is virtually impossible. Rebuilding the entire blockchain would require half of the nodes to be compromised.

[0068] According to one embodiment, speeding tickets can be permanently stored together as a whole in the form of an insert-only database. The insert-only database may be configured solely for adding information to the insert-only database. Using an insert-only database to permanently store speeding tickets may require fewer resources compared to storing speeding tickets in the form of a blockchain.

[0069] In one example, a repetition of the method for generating speeding tickets, also referred to below as a repetition or iteration of the method for generating multiple speeding tickets, may involve using the first and second cameras each time the method is repeated. In each iteration of the method, each additional speeding ticket may be created. Each additional speeding ticket may be assigned to each additional vehicle passing the first and second locations on the road. Each additional speeding ticket may include each additional protection file, which is generated according to the first character code in this example. Each additional protection file can be created according to one of the modifications described above.

[0070] In another example, repeating the method may involve using multiple pairs of cameras, each pair of which includes a first camera and a second camera.Each iteration of the method for generating each further speeding ticket comprises generating each further first image of at least a portion of each further vehicle by the first camera of each pair of cameras, the first camera of each pair of cameras being positioned at each further first location on the road and comprising each further persistent memory device that permanently stores each further first character code in a hardwired manner and is inaccessible from outside the first camera of each pair of cameras, the portion of each further vehicle including the license plate of each further vehicle, the license plate of each further vehicle including characters, and depending on each further first image, detecting each further first set of characters on the license plate of each further vehicle, and using each further first set of characters and each further first character code, generating each further protection file by the first camera of each pair of cameras, the further protection file being a mass of the first set of characters of each further character The system may include: including a version; generating a further second image of a portion of each further vehicle by the second camera of each pair of cameras, wherein the second camera of each pair of cameras is positioned at each further second location on the road; detecting a further second set of characters on the license plate of each further vehicle depending on the further second image; verifying that a first set of characters is equal to a second set of characters using each further protection file and each further second set of characters; checking whether each further vehicle is in violation of a speed limit depending on information regarding the average speed of each further vehicle between each further first location and each further second location; and if each further vehicle is in violation of a speed limit, and if it is verified that a first set of characters is equal to a second set of characters, generating a further speed ticket for each further vehicle.

[0071] Figure 1 shows a system 10 for generating a speeding ticket 80 (indicated as 10). The system 10 may include a first camera 1 and a second camera 2. The first camera 1 may be configured to generate a first image 11 (shown in Figure 2) of at least a portion 3 of a vehicle 4. The first camera 1 may be positioned at a first location 21 on the road 23 and includes a persistent memory device 31 that stores a first character code 41 permanently in a hardwired manner, making it inaccessible from outside the first camera 1. In one example, the persistent memory device 31 (hereinafter also referred to as the first persistent memory 31) may be designed in the form of a diode memory or a mask ROM.

[0072] As shown in Figure 2, a portion 3 of vehicle 4 is equipped with vehicle 4's license plate 5, and the license plate 5 is equipped with characters 6. The first camera 1 may be configured to detect a first set 51 (shown in Figure 3) of the characters on vehicle 4's license plate 5, depending on a first image 11 shown in Figure 2. Furthermore, the first camera 1 may be configured to generate a protection file 61 using the first set 51 (shown in Figure 3) of the characters on license plate 5 and a first character code 41. The protection file 61 depicted in Figure 4 may include a masked version 71 of the first set of characters on license plate 5.

[0073] The second camera 2 may be configured to generate a second image 12 (shown in Figure 5) of at least a portion 3 of the vehicle 4. The second camera 2 may be positioned at a second location 22 on the road 23. The second camera 2 may be configured to detect a second set 52 (shown in Figure 6) of the characters on the vehicle 4's license plate 5, depending on the second image 12 (shown in Figure 5).

[0074] System 10, and in one example, evaluation unit 7 of System 10, may be configured to use the protected file 61 and a second set of characters 52 (shown in Figure 6) to verify that the first set of characters 51 (shown in Figure 3) is equal to the second set of characters 52 (shown in Figure 6).

[0075] Furthermore, the system 10, and in this example the evaluation unit 7, can be configured to check whether the vehicle 4 is in violation of a speed limit, depending on information regarding the average speed of the vehicle 4 between a first position 21 and a second position 22. The first position 21 and the second position 22 are depicted in the form of sections of road 23, each including a first camera 1 and a second camera 2.

[0076] In addition, the system 10 can be configured to generate a speeding ticket 80 (shown in Figures 10 to 13) if vehicle 4 violates a speed limit and verifies that the first set of letters 51 is equal to the second set of letters 52.

[0077] Figure 7 shows an example of the first camera 1. In this example, the first camera 1 may include a computer system 112, which will be referred to below as the first computer system 112.

[0078] The first computer system 112 can be described in the general context of computer system executable instructions, such as program modules, that are executed by the computer system. Generally, a program module may include routines, programs, objects, components, logic, data structures, etc., that perform a specific task or implement a specific abstract data type.

[0079] The components of the first computer system 112 may include, but are not limited to, one or more processors or processing units 16, system memory 228, and a bus 18 that connects various components, including the system memory 228, to the processor 16. The bus 18 represents one or more of several types of bus structures, including a memory bus or memory controller, peripheral buses, accelerated graphics ports, and processor or local buses using any of various bus architectures. Such architectures, not limited to, but as examples, include the Industry Standard Architecture (ISA) bus, MicroChannel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus.

[0080] The first computer system 112 typically includes various computer system-readable media. Such media can be any valid media accessible by the first computer system 112, and may include both volatile and non-volatile media.

[0081] The system memory 28 may use a readable medium in the form of volatile memory, such as random access memory (RAM) 30 and / or cache memory 32. The first computer system 112 may further include other volatile / non-volatile computer system storage media. As further illustrated and described below, the memory 28 may be included in at least one program product having a set (e.g., at least one) of program modules configured to perform at least some of the functions of embodiments of the present invention.

[0082] A program utility 40 of a first computer system 112 having a set (at least one) of program modules 90 can, for example, be stored in memory 28. The program / utility may include an operating system, further program modules and / or program data. The program modules 90 can generally be configured to perform some of the functions and / or methodologies of the embodiments of the present invention described herein.

[0083] Figure 7 shows a modified example in which the first persistent memory 31 is part of the system memory 28. For example, the first memory 31 can be mounted on a circuit board that includes RAM 30 and cache 32. In a further modification, the first persistent memory 31 may be installed in the first camera 1 and may be mounted externally from the first computer system 112, having a connection to the first computer system 112.

[0084] In one example, the first camera 1 may include an optical system 72 having at least one lens 73 and a photodiode 74. The lens 73 captures light reflected by part 3 of the vehicle 4, directs the captured light to the photodiode 74, and can generate an electronic output signal of the optical system 72 depending on the design of part 3 of the vehicle 4. The optical system 72 can transmit the electronic output signal of the optical system 72 to the interface 24 of the first computer system 112.

[0085] The first computer system 112 may include an image generation module 91. When the image generation module 91 is executed, the processor 16 can calculate a first pixel value-dependent first image 11 (shown in Figure 2) depending on the electronic output signals of the optical system 72. In response to generating the first image 11, the processor 16 can generate a first timestamp and store the first image 11 in the form of a first image file, for example, in RAM 30.

[0086] Furthermore, the first camera 1 may include a character recognition module 92 for recognizing the characters 6 of the license plate 5 (shown in Figure 2). When the processor 16 executes the recognition module 92, it can read and process a first image file and execute a pattern recognition algorithm to recognize each character 6 of the license plate 5. The characters 6 of the license plate 5 detected, i.e., recognized by the first camera 1, are labeled as a first set 51 of characters (shown in Figure 3).

[0087] In addition, the first camera 1 may include a conversion module 293 for generating a protected file 61 depending on a first set of characters 51 and a first character code 41.

[0088] Figure 8 shows an example of the second camera 2. In this example, the second camera 2 may include a computer system 212, which will be referred to as the second computer system 212 below, as shown in Figure 8.

[0089] The second computer system 212 can be described in the general context of computer system executable instructions, such as program modules, that are executed by the computer system. Generally, a program module may include routines, programs, objects, components, logic, data structures, etc., that perform a specific task or implement a specific abstract data type.

[0090] The components of the second computer system 212 may include, but are not limited to, one or more processors or processing units 216, system memory 228, and a bus 218 that connects various components, including the system memory 228, to the processor 216. The bus 218 represents one or more of several types of bus structures, including a memory bus or memory controller, peripheral buses, accelerated graphics ports, and processor or local buses using any of the various bus architectures. Examples, but not limited to, such architectures include the Industry Standard Architecture (ISA) bus, MicroChannel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus.

[0091] The second computer system 212 typically includes various computer system-readable media. Such media can be any valid media accessible by the second computer system 212, and may include both volatile and non-volatile media.

[0092] The system memory 228 may use a readable medium in the form of volatile memory, such as random access memory (RAM) 230 and / or cache memory 232. The second computer system 212 may further include other volatile / non-volatile computer system storage media. As further illustrated and described below, the memory 228 may be included in at least one program product having a set (e.g., at least one) of program modules configured to perform at least some of the functions of embodiments of the present invention.

[0093] A program utility 240 of a second computer system 212 having a set (at least one) of program modules 290 can, for example, be stored in memory 228. The program / utility may include an operating system, further program modules, and / or program data. The program module 290 can generally be configured to perform some of the functions and / or methodologies of the embodiments of the present invention described herein.

[0094] In one example, the second camera 2 may include an optical system 272 comprising at least one lens 273 and a photodiode 274. The lens 273 can capture light reflected by part 3 of the vehicle 4 as the vehicle passes through the second position 22. Furthermore, depending on the design of part 3 of the vehicle 4, the lens 273 can direct the captured light to the photodiode 274 to generate an electrical output signal for the optical system 272. The optical system 272 can transmit its electrical output signal to an interface 224 of the second computer system 212.

[0095] The second computer system 212 may include an image generation module 291. When the image generation module 291 is executed, the processor 216 can calculate a second image 12 (shown in Figure 5) in the form of a second pixel value, depending on the electronic output signal of the optical system 272. In response to generating the second image 12, the processor 216 can generate a second timestamp and store the second image 12 in the form of a second image file, for example, in RAM 230.

[0096] Furthermore, the second camera 2 may include a character recognition module 292 for recognizing the characters 6 of the license plate 5 (shown in Figure 5). When the recognition module 292 is running, the processor 216 may read and process a second image file and execute a pattern recognition algorithm to recognize each character 6 of the license plate 5. The characters 6 of the license plate 5 detected, i.e., recognized by the second camera 2, are labeled as a second set 52 of characters (shown in Figure 6).

[0097] In addition, the first camera 1 may include a conversion module 293 for generating a protected file 261 depending on a first set of characters 51 and a first character code 41.

[0098] Figure 9 is a flowchart of a method for generating a speeding ticket, such as speeding ticket 80.

[0099] In procedure 1001, a first image 11 of at least a portion 3 of the vehicle 4 may be generated by a first camera 1. The first camera 1 may be located at a first position 21 on the road 23 and may include a persistent memory device 31 that stores a first character code 41 permanently in a hardwired manner, making it inaccessible from outside the first camera 1. The portion 3 of the vehicle 4 may include the vehicle's license plate 5, and the license plate 5 may include characters 6.

[0100] In step 1002, a first set 51 of the characters on the license plate 5 of vehicle 4 can be detected depending on the first image 11.

[0101] In step 1003, the protection file 61 may be generated by the first camera 1 using a first set 51 of the characters of the license plate 5 and a first character code 41. The protection file 61 may include a masked version 71 of the first set of characters of the license plate 5.

[0102] In step 1004, the second image 12 of part 3 of the vehicle 4 may be generated by the second camera 2. The second camera 2 may be positioned at a second location 22 on the road 23.

[0103] In step 1005, the second set of characters 52 of license plate 5 can be detected depending on the second image 12.

[0104] In step 1006, the first set of characters 51 and the second set of characters 52 are verified to be equal using the protected file 61 and the second set of characters 52.

[0105] In step 1007, the check to determine whether vehicle 4 is in violation of the speed limit may be performed in a manner dependent on information regarding the average speed of vehicle 4 between the first position 21 and the second position 22.

[0106] In procedure 1008, if vehicle 4 is in violation of the speed limit and it is verified that the first set of letters 51 and the second set of letters 52 are equal, a speeding ticket 80 can be generated.

[0107] The numerical representations of steps 1001, 1002, 1003, 1004, 1005, 1006, 1007, and 1008 do not prescribe the order in which these steps are performed. For example, steps 1004 and 1005 can be performed before steps 1001, 1002, and 1003. In this case, the first camera 1 and the second camera 2 can be positioned on the road 23 such that vehicle 4 can pass the second camera 2 before it can pass the first camera 1.

[0108] In one example, step 1001 can be performed using the optical system 72 and image generation module 91 described above. Furthermore, in one example, the processor 16 may perform step 1002, which executes the recognition module 92. Step 1003 can be performed using the conversion module 93. Step 1004 can be performed using the optical system 272 and image generation module 291 described above. Furthermore, in one example, the processor 216 may perform step 1005, which executes the recognition module 292.

[0109] The following describes, with several examples, how the first character code 41 can be used to generate the protected file 61. Verification can be performed by how the protected file 61 is generated by the first camera 1.

[0110] According to the first modification, the conversion module 93 may include a hash function, such as the Secure Hash Algorithm (SHA)-256. The processor 16 can construct a first string by concatenating a first set of characters 51 with a first character code 41. Furthermore, the processor 16 can generate a hash value of the first string by executing the hash function. According to the first modification, the hash value of the first string may represent a masked version 71 of the first set of characters. The processor 16 can write the hash value of the first string to a protected file 61 according to the first modification. As an example, the processor 16 can store the protected file 61 in RAM 30.

[0111] Alternatively, or additionally, the first camera 1 may transmit the protection file 61 to the evaluation unit 7. The evaluation unit 7 may store the protection file 61 in its memory device 70. The evaluation unit 7 may be configured to automatically delete the protection file 61 from the memory device 70 after a predetermined time has elapsed. The predetermined time is equal to the shortest possible time for the vehicle 4 to travel along the road 23 from the first position 21 to the second position 22 without violating the speed limit.

[0112] For example, processor 16 can calculate an approximate timestamp by, for instance, rounding the actual timestamp of processor 16's clock to the next minute or second. In this example, processor 16 can construct a first string by concatenating a first set of characters 51, a first character code 41, and the approximate timestamp.

[0113] Furthermore, in a further modification, the processor 16 can construct a first string by concatenating a first set of characters 51, a first character code 41, an approximate timestamp, and information regarding the location of a section of road 23. The section of road may include a first location 21 and / or a second location 22. In one example, the information regarding the location of a section of road 23 may be the GPS coordinates of the region including the first location 21 and the second location 22.

[0114] According to the first modification, the second camera 2 may include a conversion module 293 and a persistent memory device 231 that stores the first character code 41 permanently in a hardwired manner, making it inaccessible from outside the second camera 2. In one example, the persistent memory device 231 (hereinafter also referred to as the second persistent memory 231) may be designed in the form of a diode matrix or a mask ROM.

[0115] According to the first modification, the conversion module 293 may include a hash function. The processor 216 can construct a second string by concatenating a second set of characters 52 with the first character code 41. Furthermore, the processor 16 can generate a hash value of the second string, also called the second hash value 1000, by executing the hash function. According to the first modification, the second hash value 1000 may represent a masked version of the second set of characters 52. The second camera 2 can transmit the second hash value 1000 to the evaluation unit 7.

[0116] For example, processor 216 can calculate an approximate timestamp by, for instance, rounding the actual timestamp of processor 216's clock to the next minute or second. In this example, processor 216 can construct a second string by concatenating a second set of characters 52, a first character code 41, and the approximate timestamp.

[0117] Furthermore, according to further modifications, the processor 216 can construct a second string by concatenating a second set of characters 52, a first character code 41, an approximate timestamp, and information about the location of a section of road 23. The processor 16 may be configured to calculate the GPS coordinates of a region containing the first location 21 and the second location 22 based on the GPS coordinates of the first location 21 and a predetermined size of the region using a rounding algorithm. Similarly, the processor 216 may be configured to calculate the GPS coordinates of a region containing the first location 21 and the second location 22 based on the GPS coordinates of the second location 22 and a predetermined size of the region using a rounding algorithm.

[0118] According to the first modification, the evaluation unit 7 can perform verification of whether a first set of characters 51 is equal to a second set of characters 52 by comparing the hash value of a first string with a second hash value 1000. To achieve this, the processing unit 75 of the evaluation unit 7 can send a read command to the memory device 70 to read the protected file 61 from the memory device 70 to the processing unit 75. If the read command is executed successfully, it may indicate that the vehicle 4 is in violation of the speed limit. The read command can only be executed successfully if the protected file 61 has not been deleted before the read command is executed. In response to reading the protected file 61, the processing unit 75 can compare the hash value of the first string with the second hash value 1000. The processing unit 75 can read the hash value of the first string by reading the protected file 61 from the memory device 70. If the hash value of the first string is equal to the second hash value 1000, the verification can be completed. If the hash value of the first string is not equal to the hash value of the second string, 1000, the verification may not be completed.

[0119] In one modification, step 1007, namely checking whether vehicle 4 is in violation of the speed limit, may be performed by performing step 1006, namely verifying that the first set of characters 51 is equal to the second set of characters 52. Such a modification can be provided by providing an evaluation unit 7 configured to automatically delete the protected file 61 in the memory device 70 after a predetermined time has elapsed, as described above. If a read command to read the protected file 61 from the memory device 70 is successful and the read command is initiated after the generation of the second image 12, the successful safe reading of the file 61 may be considered as information about the average speed of vehicle 4 between the first position 21 and the second position 22. In this case, the information about the average speed of vehicle 4 may be such that the average speed of vehicle 4 between the first position 21 and the second position 22 is higher than the speed limit.

[0120] In a further example, system 10 may be configured to calculate a value for the average speed 81 of vehicle 4. In one example, system 10, for example, evaluation unit 7, can calculate the value for the average speed 81 of vehicle 4 as the quotient of a fixed length between a first position 21 and a second position 22 and the time difference between a first time point indicated by a first timestamp and a second time point indicated by a second timestamp. In one example, the first camera 1 can send a first timestamp to evaluation unit 7, and the second camera 2 can send a second timestamp to evaluation unit 7.

[0121] If the evaluation unit 7 has completed verification, i.e., if it has verified that the first set of characters 51 is equal to the second set of characters 52, then if vehicle 4 has violated the speed limit, it can generate a speeding ticket 80. As described above, in one example, if the protection file 61 is successfully read after the second image 12 has been generated, then vehicle 4 has violated the speed limit. In another example, to check whether vehicle 4 has violated the speed limit, the evaluation unit 7 can calculate the value of vehicle 4's average speed 81 and compare the average speed with the speed limit.

[0122] The speeding ticket 80 may include, for example, a masked version 71 of a first set of characters in the form of a protection file 61, as shown in Figure 10. According to a further example shown in Figure 11, the speeding ticket 80 may include the characters 6 of the license plate 5 in the form of a first set of characters 51 or a second set of characters 52. Figure 12 shows a further example in which the speeding ticket 80 may include the characters 6 of the license plate 5 in the form of a first set of characters 51 or a second set of characters 52 and the value of the average speed 81.

[0123] In most cases, the evaluation unit 7 can generate a speeding ticket 80 such that the speeding ticket may include a masked version 71 of a first set of characters, a value of average speed 81, characters 6 of license plate 5 in the form of a first set of characters 51 or a second set of characters 52, a first timestamp and / or a second timestamp not shown in Figure 13. Furthermore, the speeding ticket 80 may include geographical location information not shown, such as a first image 11 and / or a second image 12 and / or a first location 21 and / or a second location 22.

[0124] Generally, a speeding ticket 80 may include a first timestamp, an average speed 81 value, a first image 11, and / or geolocation information of a first location, each in its hashed form. To achieve this, the first camera 1 may generate each concatenated string by concatenating the first timestamp, the average speed 81 value, the first image 11, and / or geolocation information of a first location with a first character code 41. To create each hash form, the first camera 1 can use a hash function to calculate the hash value of each concatenated string containing the first timestamp, the average speed 81 value, the first image 11, and geolocation information of a first location, respectively.

[0125] In Figure 1, the evaluation unit 7 is depicted in the external environment of the first camera 1 and the second camera 2, but this is not mandatory. The evaluation unit 7 can be located within the first camera 1, for example, in the form of an evaluation module 94 shown by a dashed line in Figure 7. The evaluation module 94 may be configured to verify, check whether vehicle 4 is in violation of the speed limit, and write a speeding ticket 80. In this case, the processor 16 performs the functions of the processing unit 75, and the second camera 2 can send a second hash value 1000 to the first camera 1. In a further example, the evaluation unit 7 may be located within the second camera 2, for example, in the form of an evaluation module 94 shown by a dashed line in Figure 8. In this case, the first camera 1 can send a protection file 61 to the second camera 2. Similarly, the evaluation module 94 in the second camera 2 may be configured to verify, check whether vehicle 4 is in violation of the speed limit, and write a speeding ticket 80.

[0126] In one example, system 10 can transmit a speeding ticket 80 to verification server 140, for example, via evaluation unit 7 or first camera 1 or second camera 2. National authorities can access verification server 140 to verify the speeding ticket 80. Verification server 140 can store a first character code 41 in order to perform verification of the speeding ticket 80.

[0127] Figure 15 is a flowchart of a method for verifying a speeding ticket 80. In step 2001, with respect to a first modification, a control string can be created by concatenating the characters 6 of the license plate 5 given by the speeding ticket 80 with a first character code 41. In step 2002, a control hash value can be generated according to the control string using a hash function. The control hash value may be the hash value of the control string. In step 2003, the control hash value can be compared with the hash value of the first string which may be given by a masked version 71 of the first set of characters according to the first modification. The masked version 71 of the first set of characters may be included in the speeding ticket 80. If the control hash value is equal to the hash value of the first string, the speeding ticket 80 can be considered verified. Furthermore, the verification that the control hash value is equal to the hash value of the first string can be considered to verify that the vehicle 4 passed the first location 21, i.e., that the masked version 71 of the first set of characters was generated by the first camera 1. The verification of each of the hashed formats described above can be performed using similar methods.

[0128] For example, evaluation unit 7 can encrypt the speeding ticket 80 using the national authority's public key 82. Verification server 140 may store the national authority's private key 83 and use the private key 83 to decrypt the encrypted speeding ticket 80.

[0129] According to a second modification, the conversion module 93 may include a signature algorithm for signing a first set of characters 51. According to the second modification, the first character code 41 may be designed in the form of a common secret key shared between the first camera 1 and the second camera 2. The processor 16 can sign the first set of characters 51, relying on the common secret key to execute the signature algorithm of the conversion module 93. The processor 16 can compute a first signature as a result of signing the first set of characters 51 by the common secret key. According to the second modification, the first signature may represent a masked version 71 of the first set of characters. The processor 16 can write the first signature to a protection file 61 according to the second modification. As an example, the processor 16 can store the protection file 61 in RAM 30.

[0130] According to a second modification, the conversion module 293 may include a signature algorithm for signing a first set of characters 51. Furthermore, according to a second modification, the second camera 2 may include a persistent memory device 231 that stores the first character code 41 as a hardwired, persistent common secret key, and inaccessible from outside the second camera 2. The processor 216 may sign a second set of characters 52 in reliance on the common secret key to perform the algorithmic signing of the conversion module 293. As a result of signing the second set of characters 52 by the common secret key, the processor 16 can compute a second signature 2000.

[0131] According to the second modification, the second signature 2000 can represent a masked version of the second set of characters 52. The second camera 2 can transmit the second signature 2000 to the evaluation unit 7, as shown by the dashed line in Figure 1.

[0132] According to a second modification, the evaluation unit 7 may perform verification of whether a first set of characters 51 is equal to a second set of characters 52 by comparing the first signature with a second signature 2000. To achieve this, the processing unit 75 of the evaluation unit 7 can send a read command to the memory device 70 to read the protected file 61 from the memory device 70 to the processing unit 75. In response to reading the protected file 61, the processing unit 75 can compare the first signature with the second signature 2000. If the first signature is equal to the second signature 2000, the verification can be completed. If the first signature is not equal to the second signature 2000, the verification cannot be completed.

[0133] In both the first and second modifications, the first camera 1 and the second camera 2 can together represent an individual pair of cameras, and the first character code is uniquely generated for this individual pair.

[0134] In a further example, the first character code 41 may be the private key of the first camera 1. In this case, the evaluation unit 7 may store, for example, in a second persistent memory 231, the public key of the first camera 1 corresponding to the private key of the first camera. In this further example, the processor 16 can generate a protected file 61 such that the protected file 61 contains a first further signature. The processor 16 can compute the first further signature by signing a first set of characters 51 using the private key of the first camera 1. The first camera 1 can send the protected file to the evaluation unit 7. The evaluation unit 7 can verify the first further signature. The evaluation unit 7 can verify the first further signature by the first further signature, the public key of the first camera, and a second set of characters 52. The second camera 2 can send the second set of characters 52 to the evaluation unit 7. In another example, if the evaluation unit 7 is configured, for example, in the form of an evaluation module 294, the first camera 1 may transmit the protected file 61 to the second camera 2.

[0135] In a further example, the processor 16 may store the hash value of the first string locally in the system memory 28. The second camera 2 may encrypt the hash value of the second string using the public key of the first camera 1 and send the encrypted hash value of the second string to the first camera 1. The processor 16 may decrypt the encrypted hash value of the second string and perform verification by comparing the hash value of the second string with the hash value of the first string. According to this further example, the evaluation unit 7 may be configured by the first camera 1, for example, in the form of an evaluation module 94.

[0136] Figure 16 shows a modified version of System 10, according to the fact that System 10 may include multiple pairs 16 of cameras, where each pair of camera pairs 16 includes a first camera and a second camera. For example, the first pair of cameras 16-1 may include a first camera 1 and a second camera 2. The nth pair of cameras 16-n may include a first camera 1-n and a second camera 2-n, the second pair of cameras 16-2 may include a first camera 1-2 and a second camera 2-2, and the ith pair of cameras 16-i may include a first camera 1-i and a second camera 2-i.

[0137] Multiple pairs of cameras can be used to generate speeding tickets. For example, in addition to speeding ticket 80, further speeding tickets 80-2, ..., 80-i, ..., 80-n (shown in Figures 17 and 18) can be generated for further vehicles 4-2, ..., 4-i, ..., 4-n. The index "i" is used to represent one of each of the further pairs of cameras 16-2, ..., 16-i, ..., 16-n, one of each of the speeding tickets 80-2, ..., 80-i, ..., 80-n, or one of each of the further vehicles 4-2, ..., 4-i, ..., 4-n. Further speeding tickets 80-2, ..., 80-i, ..., 80-n can be generated as follows, for example, according to the first or second modification described above, similar to speeding ticket 80.

[0138] In one example, each further first image of at least a portion of each further vehicle 4-i may be generated by the first camera 1-i of each pair of cameras 16-i. The first cameras 1, 1-2, ..., 1-i, ..., 1-n of each pair of cameras 16, 16-2, ..., 16-i, ..., 16-n are located at each first position 21, 21-2, ..., 21-i, ..., 21-n on the road 23 and include each persistent memory device 31, 31-2, ..., 31-i, ..., 31-n that is not accessible from outside the first camera and stores each first character code 41, 41-2, ..., 41-i, ..., 41-n in a persistent hardwired manner. A portion of each further vehicle 4-i may include the license plate of each further vehicle 4-i, and the license plate of each further vehicle 4-i includes characters.

[0139] Furthermore, in one example, each further first set of the characters on the license plate of each further vehicle 4-i may be detected depending on each further first image.

[0140] Furthermore, in one example, each further protection file may be generated by the first camera 1-i of each pair of cameras 16-i using each further first set of characters and each further first character code 41-i. Each further protection file may include a masked version of each further first set of characters.

[0141] Furthermore, in one example, each further second image of a portion of each further vehicle 4-i may be generated by a second camera 2-i of each pair of cameras 16-i. The second camera 2-i of each pair of cameras 16-i may be positioned at each further second position 22-i of the road 23.

[0142] Furthermore, in one example, each further second set of the license plate characters of each further vehicle 4-i may be detected depending on each further second image.

[0143] Furthermore, in one example, each further verification that each further first set of characters is equal to each further second set of characters may be performed using the protected file and each further second set of characters. In one example, evaluation units 7, 7-2, ..., 7-i, ..., 7-n (shown in Figure 17) can perform each further verification. Each further evaluation unit 7-i may be located within the first or second camera of each pair of cameras 16-i, or outside the first and second cameras of each pair of cameras 16-i.

[0144] Furthermore, in one example, each further check to determine whether each further vehicle 4-i is in violation of the speed limit may be performed depending on information regarding the average speed of each further vehicle 4-i between each further first position and each further second position.

[0145] Furthermore, in one example, each further speeding ticket 80-i may be generated in a case where each further vehicle 4-i violates the speed limit and it is verified that each further first set of characters is equal to each further second set of characters. Evaluation unit 7 or each further evaluation unit 7-i may generate each further speeding ticket 80-i.

[0146] Figure 17 shows a modification illustrating that each further evaluation unit 7-i may be located outside the first and second cameras of each pair of cameras 16-i. Similar to evaluation unit 7, each further evaluation unit 7-i may encrypt each further speed ticket 80-i using the national authority's public key 82 and transmit each further speed ticket 80-i to the national authority's storage system 170. The storage system 170 may be configured to permanently store the speed tickets 80, 80-2, ..., 80-i, ..., 80-n together as a whole so that they cannot be deleted or altered.

[0147] In one example, the verification server 140 may store the respective further first character codes 41-i of each pair 16-i of the first camera. In this example, the national authority can verify that each further protection file was generated by the respective pair 16-i of the first camera.

[0148] For example, the storage system 170 may include an insert-only database 180, as shown in Figure 18. The insert-only database may be configured to only add information to the insert-only database. Once each speeding ticket 80-i is added to the insert-only database 180, it is not possible to modify or remove each speeding ticket 80-i from the insert-only database 180.

[0149] In a further example, the memory system 170 can be designed in the form of a blockchain network 190, as shown in Figure 19. The blockchain network 190, including entities 190-1, 190-2, ..., 190-i, ..., 190-m, can store multiple copies of speed tickets 80, 80-2, ..., 80-i, ..., 80-n. Each copy of speed tickets 80, 80-2, ..., 80-i, ..., 80-n may be arranged in the form of a blockchain 200, as shown in Figure 20, and can be stored in each entity 190-i of the blockchain network 190. Each entity 190-i may, for example, be a server for a respective county of a state.

[0150] Blockchain 200 may contain blockchain elements 201-1, ..., 201-i, ..., 201-m. Blockchain elements 201-1, ..., 201-i, ..., 201-m may contain header files 202-1, ..., 202-i, ..., 202-m and data blocks 203-1, ..., 203-i, ..., 203-m. Each data block 203-i may contain each set of speeding tickets 80, 80-2, ..., 80-i, ..., 80-n. The sets of speeding tickets 80, 80-2, ..., 80-i, ..., 80-n in different data blocks of data blocks 203-1, ..., 203-i, ..., 203-m may be discontinuous. Each header file 202-1, ..., 202-i, ..., 202-m can contain its respective block hash value. Each block hash value may also be the hash value of the data given by the set of speed tickets 80, 80-2, ..., 80-i, ..., 80-n in each data block 203-i.

[0151] Each header file 202-i may contain descriptive data such as the timestamp of each blockchain element 201-i, and the chain element hash value of each preceding blockchain element 201-(i-1). A preceding blockchain element 201-(i-1) precedes each blockchain element 201-i in blockchain 200. The chain element hash value of each preceding blockchain element 201-(i-1) may be the hash value of the data containing descriptive data in the header file of each preceding blockchain element 201-(i-1), such as the timestamp of each preceding blockchain element 201-(i-1), and the block hash value of each preceding blockchain element 201-(i-1). The block hash value of each preceding blockchain element 201-(i-1) is the data block 201 of each preceding blockchain element 201-(i-1) i-1 This may also be the hash value of the data given by the set of speeding tickets 80, 80-2, ..., 80-i, ..., 80-n.

Claims

1. A computer implementation method for generating speeding tickets by computer information processing, wherein the method is: The first camera generates a first image of at least a portion of a vehicle, wherein the first camera is positioned at a first location on the road, the portion of the vehicle includes the vehicle's license plate, and the license plate includes characters, and the first image is generated accordingly. The first set of characters on the license plate of the vehicle is detected depending on the first image, The first camera generates a protection file using the first set of characters of the license plate and a first character code, wherein the protection file includes a masked version of the first set of characters of the license plate. The second camera generates a second image of the part of the vehicle, wherein the second camera is positioned at a second location on the road, and the second image is generated. The detection of a second set of characters on the license plate, depending on the second image, Using the aforementioned protected file, verify whether the first set of characters is equal to the second set of characters, The vehicle is checked to determine whether it is in violation of the speed limit, depending on information regarding the average speed of the vehicle between the first position and the second position. In response to determining that the vehicle is in violation of the speed limit, and in response to verifying that the first set of characters is equal to the second set of characters, the speeding ticket is generated. The first character code is used as a common secret key for the first camera and the second camera to generate a signature of the first set of characters, wherein the protected file generates a signature of the first set, which includes the signature of the first set of characters. Using the first character code, generate a signature for the second set of characters, Comparing the signature of the first set of characters with the signature of the second set of characters, Includes, The first camera includes a first persistent memory device that stores the first character code and is inaccessible from outside the first camera. The second camera includes a second persistent memory device that stores the first character code and is inaccessible from outside the second camera. Computer implementation method.

2. A computer implementation method according to claim 1, The aforementioned protection file is stored in the memory device, After a predetermined time has elapsed, the protected file in the memory device will be automatically deleted. It further includes, A computer implementation method wherein the predetermined time is equal to the shortest possible time to travel along the road from the first position to the second position without violating the speed limit, and checking whether the vehicle is violating the speed limit includes successfully reading the protection file from the memory device.

3. A computer implementation method for generating a speeding ticket by computer information processing, wherein the method is: The first camera generates a first image of at least a portion of a vehicle, wherein the first camera is positioned at a first location on the road, the portion of the vehicle includes the vehicle's license plate, and the license plate includes characters, and the first image is generated accordingly. The first set of characters on the license plate of the vehicle is detected depending on the first image, The first camera generates a protection file using the first set of characters of the license plate and a first character code, wherein the protection file includes a masked version of the first set of characters of the license plate. The second camera generates a second image of the part of the vehicle, wherein the second camera is positioned at a second location on the road, and the second image is generated. The detection of a second set of characters on the license plate, depending on the second image, Using the aforementioned protected file, verify whether the first set of characters is equal to the second set of characters, The vehicle is checked to determine whether it is in violation of the speed limit, depending on information regarding the average speed of the vehicle between the first position and the second position. In response to determining that the vehicle is in violation of the speed limit, and in response to verifying that the first set of characters is equal to the second set of characters, the speeding ticket is generated. To generate a first string including the first character code and the first set of characters, The first camera uses a hash function to calculate the hash value of the first string, wherein the protected file includes the hash value of the first string. To generate a second string including the first character code and the second set of the characters, The hash value of the second string is calculated by the second camera using the hash function, Comparing the hash value of the first string with the hash value of the second string, Includes, The first camera includes a first persistent memory device that stores the first character code and is inaccessible from outside the first camera. The second camera includes a second persistent memory device that stores the first character code and is inaccessible from outside the second camera. A computer implementation method wherein the first character code is uniquely generated for the first camera and the second camera.

4. A computer implementation method according to claim 3, The hash value of the first string is stored locally in the first camera, The hash value of the second string is transmitted from the second camera to the first camera, Computer implementation methods, including further details.

5. A computer implementation method according to claim 1, The signature of the first set of characters is stored locally in the first camera, Transmitting the signature of the second set of characters from the second camera to the first camera, Computer implementation methods, including further details.

6. A computer implementation method for generating a speeding ticket by computer information processing, wherein the method is: The first camera generates a first image of at least a portion of a vehicle, wherein the first camera is positioned at a first location on the road, the portion of the vehicle includes the vehicle's license plate, and the license plate includes characters, and the first image is generated accordingly. The first set of characters on the license plate of the vehicle is detected depending on the first image, The first camera generates a protection file using the first set of characters of the license plate and a first character code, wherein the protection file includes a masked version of the first set of characters of the license plate. The second camera generates a second image of the part of the vehicle, wherein the second camera is positioned at a second location on the road, and the second image is generated. The detection of a second set of characters on the license plate, depending on the second image, Using the aforementioned protected file, verify whether the first set of characters is equal to the second set of characters, The vehicle is checked to determine whether it is in violation of the speed limit, depending on information regarding the average speed of the vehicle between the first position and the second position. In response to determining that the vehicle is in violation of the speed limit, and in response to verifying that the first set of characters is equal to the second set of characters, the speeding ticket is generated. Includes, A computer implementation method wherein the first character code is uniquely generated for the first camera and the second camera.

7. A computer implementation method for generating a speeding ticket by computer information processing, wherein the method is: The first camera generates a first image of at least a portion of a vehicle, wherein the first camera is positioned at a first location on the road, the portion of the vehicle includes the vehicle's license plate, and the license plate includes characters, and the first image is generated accordingly. The first set of characters on the license plate of the vehicle is detected depending on the first image, The first camera generates a protection file using the first set of characters of the license plate and a first character code, wherein the protection file includes a masked version of the first set of characters of the license plate. The second camera generates a second image of the part of the vehicle, wherein the second camera is positioned at a second location on the road, and the second image is generated. The detection of a second set of characters on the license plate, depending on the second image, Using the aforementioned protected file, verify whether the first set of characters is equal to the second set of characters, The vehicle is checked to determine whether it is in violation of the speed limit, depending on information regarding the average speed of the vehicle between the first position and the second position. In response to determining that the vehicle is in violation of the speed limit, and in response to verifying that the first set of characters is equal to the second set of characters, the speeding ticket is generated. The first character code is used as the secret key of the first camera to generate a signature of the first set of characters, wherein the protected file generates a signature of the first set, which includes the signature of the first set of characters. The signature of the first set of characters is verified by the public key of the first camera, which corresponds to the private key of the first camera, Includes, A computer implementation method wherein the first character code is uniquely generated for the first camera and the second camera.

8. A computer implementation method for generating a speeding ticket by computer information processing, wherein the method is: The first camera generates a first image of at least a portion of a vehicle, wherein the first camera is positioned at a first location on the road, the portion of the vehicle includes the vehicle's license plate, and the license plate includes characters, and the first image is generated accordingly. The first set of characters on the license plate of the vehicle is detected depending on the first image, The first camera generates a protection file using the first set of characters of the license plate and a first character code, wherein the protection file includes a masked version of the first set of characters of the license plate. The second camera generates a second image of the part of the vehicle, wherein the second camera is positioned at a second location on the road, and the second image is generated. The detection of a second set of characters on the license plate, depending on the second image, Using the aforementioned protected file, verify whether the first set of characters is equal to the second set of characters, The vehicle is checked to determine whether it is in violation of the speed limit, depending on information regarding the average speed of the vehicle between the first position and the second position. In response to determining that the vehicle is in violation of the speed limit, and in response to verifying that the first set of characters is equal to the second set of characters, the speeding ticket is generated. The first character code is used as a symmetric encryption key for the first camera and the second camera to generate an encrypted version of the first set of characters, wherein the protected file generates a signature of the first set, which includes the encrypted version of the first set of characters. Decrypting the encrypted version of the first set of characters using the first character code, Includes, The first camera includes a first persistent memory device that stores the first character code and is inaccessible from outside the first camera. The second camera includes a second persistent memory device that stores the first character code and is inaccessible from outside the second camera. A computer implementation method wherein the first character code is uniquely generated for the first camera and the second camera.

9. A computer implementation method according to claim 3, The hash value of the first string is stored in the local memory of the first camera, Encrypting the hash value of the second string depending on the public key of the first camera, The encrypted hash value of the second string is transmitted to the first camera, Decrypting the encrypted hash value of the second string, The hash value of the second string is compared with the hash value of the first string obtained by the first camera, Computer implementation methods, including further details.

10. A computer implementation method according to claim 3, The first camera is used to calculate an approximate timestamp, The approximate timestamp is calculated using the second camera, A computer implementation method further comprising the first string including the approximate timestamp and the second string including the approximate timestamp.

11. A computer implementation method according to claim 3, The first string and the second string are generated such that the first string contains information relating to the location of the section of the road and the second string contains the information relating to the location of the section of the road. A computer implementation method further comprising the section of the road including the first location and the second location.

12. A computer implementation method for generating a speeding ticket by computer information processing, wherein the method is: The first camera generates a first image of at least a portion of a vehicle, wherein the first camera is positioned at a first location on the road, the portion of the vehicle includes the vehicle's license plate, and the license plate includes characters, and the first image is generated accordingly. The first set of characters on the license plate of the vehicle is detected depending on the first image, The first camera generates a protection file using the first set of characters of the license plate and a first character code, wherein the protection file includes a masked version of the first set of characters of the license plate. The second camera generates a second image of the part of the vehicle, wherein the second camera is positioned at a second location on the road, and the second image is generated. The detection of a second set of characters on the license plate, depending on the second image, Using the aforementioned protected file, verify whether the first set of characters is equal to the second set of characters, The vehicle is checked to determine whether it is in violation of the speed limit, depending on information regarding the average speed of the vehicle between the first position and the second position. In response to determining that the vehicle is in violation of the speed limit, and in response to verifying that the first set of characters is equal to the second set of characters, the speeding ticket is generated. To generate a file containing the characters of the license plate and the protection file, Encrypting the file using the public key of the national authority and generating the speeding ticket, Includes, A computer implementation method comprising the aforementioned speeding ticket, including the encrypted file.

13. A computer implementation method according to claim 12, A masked version of the first image or the second image is generated depending on the first image or the second image and the first character code, Writing a masked version of the first image or the second image to the file, It further includes, A computer implementation method wherein the first character code is uniquely generated for the first camera and the second camera.

14. A computer implementation method according to claim 12, To measure the average speed of the vehicle, The masked version of the average speed is generated depending on the average speed and the first character code, Writing the masked version of the average speed to the file, It further includes, A computer implementation method wherein the first character code is uniquely generated for the first camera and the second camera.

15. A computer implementation method according to claim 1, To generate multiple speeding tickets, To prevent the aforementioned multiple speeding tickets from being deleted or modified, the aforementioned multiple speeding tickets are permanently stored together as a whole, Computer implementation methods, including further details.

16. The computer implementation method of claim 15, wherein the plurality of speeding tickets are permanently stored as a whole in blockchain format.

17. The computer implementation method according to claim 15, wherein the plurality of speeding tickets are permanently stored together as a whole in the form of an insert-only database, and the insert-only database is configured solely for adding information to the insert-only database.

18. A system for generating speeding tickets, wherein the system includes a first camera and a second camera, The first camera generates a first image of at least a portion of a vehicle, wherein the first camera is positioned at a first location on the road, the portion of the vehicle includes the vehicle's license plate, and the license plate includes characters, and the first image is generated accordingly. The first set of characters on the license plate of the vehicle is detected depending on the first image, The first camera generates a protection file using the first set of characters of the license plate and a first character code, wherein the protection file includes a masked version of the first set of characters of the license plate. The second camera generates a second image of the part of the vehicle, wherein the second camera is positioned at a second location on the road, and the second image is generated. The detection of a second set of characters on the license plate, depending on the second image, Using the aforementioned protected file, verify whether the first set of characters is equal to the second set of characters, The vehicle is checked to determine whether it is in violation of the speed limit, depending on information regarding the average speed of the vehicle between the first position and the second position. In response to determining that the vehicle is in violation of the speed limit, and in response to verifying that the first set of characters is equal to the second set of characters, the speeding ticket is generated. The first character code is used as a common secret key for the first camera and the second camera to generate a signature of the first set of characters, wherein the protected file generates a signature of the first set, which includes the signature of the first set of characters. Using the first character code, generate a signature for the second set of characters, Comparing the signature of the first set of characters with the signature of the second set of characters, It is configured to perform, The first camera includes a first persistent memory device that stores the first character code and is inaccessible from outside the first camera. The second camera includes a second persistent memory device that stores the first character code and is inaccessible from outside the second camera. system.