Generating speeding tickets using character codes permanently stored in the camera to mask information about the characters on the vehicle's license plate
The method uses cameras with a permanently stored character code to generate protected files for license plate characters, addressing data protection issues in speeding ticket systems by ensuring secure storage and verification of vehicle speed violations.
Patent Information
- Application Number
- JP2024532190
- Authority / Receiving Office
- JP · JP
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2021-11-30
- Filing Date
- 2022-11-25
- Publication Date
- 2024-11-21
- Estimated Expiration
- 2042-11-25
AI Technical Summary
Existing systems for generating speeding tickets lack robust data protection for vehicle license plate information, particularly when measuring average speed, making them vulnerable to tampering and unauthorized access.
A method and system using cameras with a permanently stored character code in a secure memory to generate a protected file containing masked versions of license plate characters, ensuring data integrity and authenticity through hash functions and secure storage, allowing verification of vehicle speed violations.
Enhances data protection and tamper-proof evidence of vehicle location and speed violations by securely storing and verifying license plate information, reducing the risk of fraud and unauthorized access.
Smart Images

Figure 2024543563000001_ABST
Abstract
Description
[Technical field]
[0001] The present invention relates generally to traffic monitoring, and more particularly, to a method, system, and camera for generating speeding tickets.
[0002] A system for issuing speeding tickets may measure the actual or average speed of a vehicle. If an average speed is measured, it may be necessary to store first data about 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 about the vehicle may be transferred within a communication network for processing this data together with second data about the vehicle generated by a second measurement component of the system. To enhance data protection of this data, it is known to generate a hash value of the data about the vehicle. Summary of the Invention
[0003] In one aspect, a computer-implemented method for generating a speeding ticket 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 being disposed at a first location on a road, where the portion of the vehicle includes a vehicle license plate, the license plate including characters. The computer-implemented method further includes detecting a first set of characters on the vehicle license plate in dependence on the first image. The computer-implemented method further includes generating a protected file by the first camera using the first set of characters on the license plate and the first character code, the protected file including a masked version of the first set of characters on the license plate. The computer-implemented method further includes generating a second image of the portion of the vehicle by a second camera, the second camera being disposed at a second location on the road. The computer-implemented method further includes detecting a second set of characters on the license plate in dependence on the second image. The computer-implemented method further includes verifying whether the first set of characters is equal to the second set of characters using the protected file. The computer-implemented method further includes checking whether the vehicle is violating a speed limit dependent on information about an average speed of the vehicle between the first location and the second location. The computer-implemented 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.
[0004] In another aspect, a camera for generating a protected file is provided, the camera configured to: generate a first image of at least a portion of a vehicle, the camera comprising a memory device that persistently stores a first character code inaccessible externally to the camera, the portion of the vehicle including a vehicle license plate, the license plate including characters, detect a first set of the vehicle license plate in dependence on the first image, and generate a protected file by the camera using the first set of license plate characters and the first character code, the protected file including a masked version of the first set of license plate characters.
[0005] In yet another aspect, a system for generating a speeding ticket 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 the vehicle by a first camera, the first camera being positioned at a first location on a road, the portion of the vehicle including a vehicle license plate, the license plate including characters; detect a first set of characters of the vehicle license plate in dependence on the first image; generate a protected file by the first camera using the first set of characters of the license plate and a first character code, the protected file including a masked version of the first set of characters of the license plate; generate a second image of the portion of the vehicle by a second camera, the second camera being positioned at a second location on the road; detect the second set of characters of the license plate in dependence on the second image; verify using the protected file whether the first set of characters is equal to the second set of characters; check whether the vehicle violates a speed limit in dependence on information about an average speed of the vehicle between the first location and the second location; and generate a speeding ticket in response to determining that the vehicle violates the speed limit and in response to verifying that the first set of characters is equal to the second set of characters.
[0006] Embodiments of the invention will now be described in more detail, by way of example only, with reference to the drawings in which: [Brief description of the drawings]
[0007] [Figure 1] 1 is a block diagram that illustrates a schematic of a system for generating speeding tickets for a vehicle including a first camera and a second camera. [Diagram 2] FIG. 2 shows a first image capturing the license plate of the vehicle shown in FIG. 1. [Diagram 3] FIG. 3 illustrates a first set of detected characters of the license plate shown in FIG. 2. [Figure 4] FIG. 4 shows a protected file created using the first set of characters shown in FIG. 3. [Diagram 5] FIG. 2 shows a second image capturing the license plate of the vehicle shown in FIG. 1. [Figure 6] FIG. 6 illustrates a second set of detected characters of the license plate shown in FIG. 5. [Figure 7] 2 shows a block diagram of the first camera shown in FIG. 1. [Figure 8] 2 shows a block diagram of the second camera shown in FIG. 1. [Figure 9] 1 is a flow chart of a method for generating a speeding ticket for a vehicle. [Figure 10] FIG. 1 shows an example of a speeding ticket. [Figure 11] FIG. 13 shows a further example of a speeding ticket. [Figure 12] FIG. 13 shows a further example of a speeding ticket. [Figure 13] FIG. 13 shows a further example of a speeding ticket. [Figure 14] FIG. 11 illustrates a national authority validation server for validating the speeding ticket shown in FIG. 10. [Figure 15] 11 is a flow chart of the method for validating a speeding ticket shown in FIG. 10. [Figure 16]FIG. 19 shows a further example of the system shown in FIG. 1 with multiple pairs of cameras for generating multiple speeding tickets as shown in FIG. 18. [Figure 17] FIG. 19 illustrates multiple evaluation units for generating multiple speeding tickets as shown in FIG. 18. [Figure 18] FIG. 17 illustrates a number of speeding tickets generated by the system shown in FIG. 16. [Figure 19] FIG. 19 illustrates a blockchain network for persistently storing multiple speeding tickets as shown in FIG. [Figure 20] FIG. 19 illustrates a blockchain including a blockchain element for persistently storing multiple speeding tickets as shown in FIG. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0008] The description of various embodiments of the present invention is presented for purposes of illustration, but is not intended to be exhaustive or limiting of 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 terms used in this specification have been selected to best explain the principles of the embodiments, practical applications, or technical improvements to the technology found in the market, or to enable other skilled in the art to understand the embodiments disclosed herein.
[0009] The proposed method can enable higher data protection of the first set of characters of the license plate (hereinafter also referred to as the first set of characters) because the first character code generates a protected file that includes a masked version of the first set of characters. The data protection of the first set of characters that can be achieved using the proposed method can be higher than that achieved using a method that can simply hash the first set of characters, for example using a Secure Hash Algorithm (SHA)-256. In this case, the first set of characters can be restored using a "rainbow table" that can include 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, the data protection of the first set of characters can be further increased because the first character code is persistently stored in a persistent memory device of the first camera in a hardwired manner and cannot be accessed outside the first camera.
[0010] Data protection of the first set of characters may be useful for transferring information about the first set of characters from the first camera to the second camera. For example, such a transfer may be performed for checking whether the vehicle violates a speed limit. This transfer may be performed by sending a protection 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 speeding ticket. In this case, the proposed method may make higher data protection information available also for the first set of characters. The proposed method may further include deleting the protection file if checking whether the vehicle violates a speed limit indicates that the vehicle does not violate a speed limit.
[0011] Furthermore, the protection file can also be used to prove that the protection file was generated by the first camera. This is because the protection file is generated using the first character code, the first character code is stored in a hardwired manner in the persistent memory device of the first camera, and the first character code is stored in the memory device of the first camera in such a way that it is not accessible from outside the first camera. In addition, since the first camera is placed at a first position on the road, the protection file may serve to prove that the vehicle passed the first position on the road. In one example, the national authority, and only the national authority, may have access to a verification server that stores the first character code to verify that the protection file is generated by the first camera. According to a further example, the national authority may have access to a verification server that stores the public key of the first camera to verify that the protection file is generated by the first camera. According to one example, a speeding ticket includes the protection file. In a further example, the speeding ticket may be designed in the form of a protection file.
[0012] Since the protected file is generated using the first character code, the first character code is persistently stored in a hardwired manner in a persistent memory device of the first camera, and the first character code is stored in the memory device of the first camera in a manner that is inaccessible from outside the first camera, the proposed method can be considered as a highly tamper-proof method for generating a protected file. As a result, the proposed method can be used to generate a tamper-proof certificate indicating that a vehicle has passed a first position on a road, for example, by generating a protected file. As an example, if the first character code is stored in a validation server, the first character code is stored in the memory device of the first camera in a manner that is inaccessible from outside the first camera, and therefore is accessible only to national authorities, away from the respective processing units of the first or second camera.
[0013] The first and second images may include the front or rear of the vehicle. Thus, the part of the vehicle may be a part of the front or rear of the vehicle. In most cases, the part of the vehicle may include a part of the lower front or rear of the vehicle, such that a license plate may be constituted by a part of the vehicle.
[0014] The first camera and the second camera may include an optical system and respective processing units for generating a first image in dependence on electronic signals of the optical system of the first camera and for generating a second image in dependence on electronic signals of the optical system of the second camera, respectively. The first camera may generate the first image at a first time. The generation of the first image may include storing the first image in the memory of the first camera in the form of a first image file. Similarly, the second camera may generate a second image at a second time. The generation of the second image may 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 positioned at a first location on the road such that the optical system of the first camera captures vehicles passing by the first location on the road. The first location can be defined by a first structure of the road, for example a support post of a bridge crossing of the road, or a first further structure positioned adjacent to the road. The first location can be defined by a first GPS coordinate. Similarly, the second camera can be positioned at a second location on the road such that the optical system of the second camera captures vehicles passing by the second location on the road. The second location can be defined by a second structure of the road, for example a support post of a bridge crossing of the road, or a second further structure positioned adjacent to the road. The second location can be defined by a second GPS coordinate.
[0016] The first camera may be configured to detect the first set of characters depending on the first image. For example, the first camera may 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 the several pull rates constituted by the first image file. The characters of the license plate detected by the means of the first camera are referred to as the first set of characters in this disclosure.
[0017] Similarly, the second camera can be configured to detect the second set of license plate characters depending on the second image. For example, the second camera may 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 license plate characters detected by the means of the second camera are referred to as the second set of characters in the present disclosure.
[0018] The term "masked version of the first set of characters" as used herein refers to a version of the first set of characters from which the first set of characters is generally not recoverable or can only be recovered by a first character code or by a decryption key corresponding to the first character code. The term "masked" means that the first set of characters cannot be read by reading only the masked version of the first set of characters. Furthermore, the masked version of the first set of characters may be dependent on the first set of characters such that a change in the first set of characters may cause a change in the masked version of the first set of characters. Since the first set of characters is not readable by the protected file alone, the protected file is considered secure. Generating the protected 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 may be configured to generate the protected file, for example by calculating a masked version of the first set of characters depending on the first set of characters and the first character code using a transformation function, and writing the masked version of the first set of characters of the license plate into the protected file. The transformation function may be a one-way function or may be an encryption function.
[0020] In one example, the first character code may be uniquely generated for the first camera, which may increase the confidence that the protected file is generated by the first camera. In one example, the first character code is generated by a random seed, which 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 a read-only memory (ROM). The first character code stored in the first persistent memory cannot be electronically changed 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 a 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 connections of the first persistent memory are 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 procedure of the first persistent memory, for example, by generating the electronic connections of the first persistent memory. In one example, the first persistent memory can be a programmable read-only memory (PROM).
[0022] Generally, data stored in the first persistent memory, including the first character code, may be unalterable from outside the first camera. However, according to one example, the first persistent memory may be designed to be unalterable 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 a 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 to penetrate the interior of the first camera and expose the first persistent memory to ultraviolet light to reprogram the EPROM. The broken seal may indicate that the first persistent memory has been altered according to this example.
[0023] The first persistent memory stores the first character code in such a way that it is not accessible from outside the first camera. This may imply that the first character code is only readable by a processing unit of the first camera located inside the first camera. Thus, the first character code is not readable by further devices located outside the first camera and having a short or long range radio connection to the first camera. In one example, the first camera may be designed such that it is not able to establish a radio wave connection to further devices or other devices. In this case, the output signal of the first camera is only transferable by wires. According to a further example, the first camera may be configured such that data can only be transmitted from the first camera to further devices and not from the further devices to the first camera.
[0024] In the following, verifying that a first set of characters is equal to a second set of characters may also be referred to as verifying.
[0025] The information on the average speed of the vehicle may be such that, according to one example, it may represent a value of the average speed of the vehicle. In another example, the information on the average speed may be such that it indicates that the information is greater than the speed limit. The value of the average speed may be obtained by measuring the time it takes the vehicle to travel from a first position to a second position. The first camera may record a first time point when generating the first image and the second camera may record a second time point when generating the second image. The first and second cameras may be stationary. Thus, the length of the road between the first and second positions of the road may be considered as a fixed length. The evaluation unit may calculate the average value of the vehicle depending on the fixed length and the time difference between the first and second time points. The evaluation unit may be installed in the first or second camera or may be located outside the first and second cameras.
[0026] According to an embodiment, the generation of the protected file may include generating a first string. The first string may include a first character code and a first set of characters. Furthermore, the generation of the protected file may include calculating a hash value of the first string by the first camera using a hash function, and the protected file may include the hash value of the first string. The hash value of the first string may be a masked version of the first set of characters according to this embodiment, and the hash function may be a transformation function. Furthermore, according to this embodiment, the generation of the protected file may further include generating a second string. The second string may include the first character code and a second set of characters. Furthermore, the generation of the protected file may include calculating a hash value of the second string by the hash function of the second camera using a hash function. The verification may include comparing the hash value of the first string and the hash value of the second string. The second camera may include a persistent memory device that persistently stores the first character code in a hardwired manner and inaccessible outside the second camera. Thus, according to this embodiment, the first character code can be considered as a shared secret that is stored simultaneously in the first persistent memory and in the persistent memory of the second camera.
[0027] The term "hash value" as used herein may refer to an output value of a hash function. The hash function may be configured to calculate the output value of the hash function as a corresponding hash value of the input data of the hash function depending on the input data of the hash function and the algorithm of the hash function. The algorithm of the hash function may be, without any restrictions, a Secure Hash Algorithm (SHA)-256. In particular, the hash function may be a cryptographic hash function.
[0028] A hash function can compute a hash value of input data such that the input data cannot be un-hashed from the hash value of the input data. Hash functions and their algorithms can be designed such that a slight change in the input data of the hash function results in a completely different hash value compared to the hash value of the input data. The output value of the hash function can have a fixed length that depends on the size of the input data of the hash function. The length of the output value of the hash function can be 256 bits, in which case the algorithm of the hash function is Secure Hash Algorithm (SHA)-256. The input data of the hash function can be a binary file. A binary file can represent letters and / or numbers in binary form.
[0029] According to the above-mentioned embodiment, as an example, the input data of the hash function may be a first string and the output value of the hash function may be a hash value of the first string. The hash value of the first string may be considered as a salted hash value of a first set of characters. To calculate a 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 a hash value of the second string. The hash value of the second string may be considered as a 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 a read-only memory (ROM). The first character code stored in the second persistent memory cannot be electronically changed 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 a 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 connections of the second persistent memory are 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 procedure of the second persistent memory, for example by generating the electronic connections of the second persistent memory. In one example, the second persistent memory is a programmable read-only memory (PROM).
[0031] Generally, the data stored in the second persistent memory, including the first character code, may be unalterable from outside the second camera. However, according to one example, the second persistent memory may be designed to be unalterable from outside the second camera in the form of an erasable programmable read-only memory (EPROM) that is installed in the second camera. For example, the EPROM may be covered by a 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 to penetrate the interior of the second camera and expose the second persistent memory to ultraviolet light to reprogram the EPROM. The broken seal may indicate that the second persistent memory has been altered according to this example.
[0032] The second persistent memory may store the first character code in such a way that it is not accessible from outside the second camera. This may imply that the first character code is only readable by a processing unit of the second camera located inside the second camera. Thus, the first character code is not readable by a further device located outside the second camera and having a short or long range radio connection to the second camera. In one example, the first camera may be designed such that it is not able to establish a radio wave connection to the further device or other devices. In this case, the output signal of the second camera is only transferable by wires. According to a further example, the second camera may be configured such that data can only be transmitted from the second camera to the further device and not from the further device to the first camera.
[0033] The advantage of performing the verification by means of hash values of the first string and the second string is that these hash values can be calculated using known hash functions such as Secure Hash Algorithm (SHA)-256 available as open source software. The first camera can store the hash function on the first persistent memory or on a further memory device of the first camera, and the second camera can store the hash function on the second persistent memory or on a further 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 a salted hash value, the first character code being considered as a salt value.
[0034] Furthermore, according to the above-mentioned embodiment, 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, there is no need to unmask information about the first set of characters to perform verification. This may enhance data protection of the first set of characters. The speeding ticket may include the hash value of the first string or the second string.
[0035] According to one embodiment, the first character code is uniquely generated for each pair of cameras, the each pair of cameras including a first camera and a second camera. For example, the first character code can be uniquely generated for each pair of cameras by using a random seed as described above to generate the first character code. This embodiment may enhance the confidence that the vehicle passed the first and second positions on the road. The verification server may store information regarding the fact that the first character code was uniquely generated for the first camera and the second camera.
[0036] According to one embodiment, the generation of the protected file may include generating a signature of a first set of characters (hereinafter referred to as a first signature) using the first character code as a common secret key of the first camera and the second camera. The protected file may include 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 transformation function. According to this embodiment, the method may further include generating a signature of a second set of characters (hereinafter referred to as a second signature) using the first character code. The verification may include comparing the first signature and the second signature. According to this embodiment, the second camera includes the above-mentioned second persistent memory that stores the first character code in a persistent hardwired manner and inaccessible from outside the second camera, as described above. In one example, the speeding ticket may include the first signature and / or the second signature.
[0037] In one example, generating the first signature may include signing a hash value of the first set of characters using the first character code as a common secret key. In this case, the signed hash value of the first set of characters may be the first signature. The first camera may generate a hash value of the first set of characters using the first character code and a hash function. Similarly, generating the second signature may include signing a hash value of the 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 may be the second signature. The second camera may generate a hash value of the second set of characters using the first character code and a hash function.
[0038] The use of the first signature can further increase the confidence that the protected file was generated by the first or second camera. This is due to the need to involve a certificate authority to obtain the common private key and the common public key corresponding to the common private key. According to one example, the first signature can be considered as 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 generated by the first camera or that the second signature was generated by the second camera. Such verification can be performed using the common public key. Thus, the first character code does not need to be stored in the verification server to be able to verify that the protected file was generated by the first camera. Instead, the common public key can be stored in the verification server. The common public key can be shared without losing the data protection of the first character set.
[0039] A further advantage of using the first and second signatures for verification is that the common public key is not required for verification. However, by not using the common public key in public, it may not be possible to prove that the protected file was generated by the first or second camera. If the common public key is not published, i.e. not available to the public, it may be advantageous to use a common private key and not use the common public key in public. In this case, data protection of the first set of characters may be further strengthened. 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 a hash value of the first string locally on the first camera and transmitting a 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 storing the first signature locally in the first camera and transmitting the second signature from the second camera to the first camera. This embodiment and the previously described embodiment 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 to perform the verification. As a result, data protection of the information about the first set of characters may be increased.
[0042] According to one embodiment, the method may further include storing the protection file in a memory device and automatically deleting the protection file in the memory device after a predetermined time. The predetermined time may be equal to the shortest possible time to travel the road from the first location to the 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 a memory device.
[0043] Since the length of the road between the first location and the second location and the speed limit can be considered as predetermined, the predetermined time can be calculated depending on the length of the road between the first location and the second location and the speed limit. The method may further include executing a read command to read the protection file from the memory device in response to receiving by the first camera from the second camera the hash value of the second string or the second signature. In this case, the protection file is not deleted and the read command may be executed normally. A successful read of the protection file may imply that the vehicle violates the speed limit. In this case, a failure to read the protection file because the protection file is deleted may imply that the vehicle does not violate the speed limit. Thus, this embodiment may cause the first set of characters or information about the first set of characters, for example the hash value of the first set of characters or the first signature, to not be stored for longer than the predetermined time. As a result, this embodiment may enhance data protection of the first set of characters.
[0044] According to one embodiment, generating the protected file may include generating a first further signature of the first set of characters using the first character code as a private key of the first camera, the protected file including the first further signature. In this embodiment, the first further signature may be considered as a masked version of the first set of characters. According to this embodiment, verifying may include verifying the first further signature by a public key of the first camera corresponding to the private key of the first camera and the second set of characters. In this embodiment, the first character code may be made storable only in the first persistent memory, which allows for enhanced protection of the first character code. The first camera may transmit the first further signature to the second camera. In one example, the second camera may perform a verification of the first further signature depending on the public key, the first further signature and the second set of characters. According to this example, if the first set of characters is equal to the second set of characters, the verification of the first further signature may be successful.
[0045] In one example, generating the first further signature may include signing a hash value of the first set of characters using the first character code as the private key of the first camera. In this case, the signed hash value of the first set of characters may be the first further signature. The first camera may create a hash value of the first set of characters using the first set of characters and a hash function. The first camera may transmit the first further signature to the second camera. In one example, the second camera may perform a verification of the first further signature depending on the public key, the first further signature and the hash value of the second set of characters. The second camera may create a hash value of the second set of characters using the second set of characters and a hash function. According to this example, if the hash value of the first set of characters is equal to the hash value of the second set of characters, the verification may be successful.
[0046] The use of the first further signature can further strengthen the confidence that the protected file was generated by the first camera. This is because a certificate authority needs to be involved to obtain the private key of the first camera and the public key of the first camera corresponding to the private key of the first camera. According to an example, the first further signature can be considered as the protected file. A further advantage of using the first further signature is that the first character code does not need to verify that the first further signature is created by the first camera. Such verification can be performed using the public key of the first camera. Therefore, the first character code does not need to be stored in the verification server in order to be able to verify that the protected file was generated by the first camera. Instead, the public key of the first camera can be stored in the verification server.
[0047] According to an embodiment, the generation of the protected file may include generating an encrypted version of the first set of characters using a first character code as a symmetric encryption key for the first camera and the 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. The verification may include decrypting the encrypted version of the first set of characters by the first character code. Furthermore, according to this embodiment, the second camera may include a persistent memory device that stores the first character code in a persistent hardwired manner and inaccessible from outside the second camera. The first camera may transmit the encrypted version of the first set of characters to the second camera. The second camera may perform the decryption of the encrypted version of the first set of characters. This embodiment may present a version based on the proposed method, according to which the first set of characters may have a high protection. Providing a symmetric encryption key may be simpler than providing a common secret key.
[0048] According to one embodiment, the method further comprises storing a hash value of the first string in a local memory of the first camera and encrypting the hash value of the second string in dependence on the public key of the first camera. According to this embodiment, the method further comprises 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, the verification can comprise comparing the hash value of the second string with the hash value of the first string by the first camera. First, this embodiment can have the advantage that the hash value of the first string is not transmitted anywhere in the first camera. This can enhance data protection of the first set of characters. Second, encrypting the hash value of the second string can enhance data protection of the second set of characters. Thus, in addition to providing tamper-proof evidence that a vehicle passed through a first location or a second location by using the first character code in the hash of the first string, this embodiment provides increased data protection for the first and second sets of characters.
[0049] According to an embodiment, the method may further include calculating a coarse timestamp by the first camera and a coarse timestamp by the second camera. In this embodiment, the first string may include a coarse timestamp and a first set of characters, and may also be referred to as an extended first string. Similarly, the second string may include a coarse timestamp and a second set of characters, and may also be referred to as an extended second string. The first camera may calculate a general timestamp by rounding the actual timestamp of the clock of the first camera to the next minute or second. Similarly, the second camera may calculate a coarse timestamp by rounding the actual time of the clock of the second camera to the next minute or second. In this case, the clock of the first camera and the clock of the second camera may be synchronized to the exact minute or second.
[0050] The approximate time stamp may be able to prove that the vehicle passed the first and second locations at approximately the same time indicated by the approximate time stamp. Furthermore, according to this embodiment, since the first string and the second string include the first character code in addition to the approximate time stamp, this embodiment can provide a tamper-resistant method of including the approximate time stamp in the protected file. Furthermore, 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] According to another example, the first signature may be a signature of an extended first string generated by a first character code as a common secret key of the first camera and the second camera. Similarly, the second signature may be a signature of an extended second string generated by the first character code as a common secret key.
[0052] According to an embodiment, the method may further include generating the first string and the second string such that the first string includes information regarding the location of the section of the road and the second string includes information regarding the location of the section of the road. According to this embodiment, the section of the road may include a first location and / or a second location. In one example, the information regarding the location of the section of the road may include a first location GPS coordinate and / or a second location GPS coordinate. The information regarding the location of the section of the road may allow to prove that the driver of the vehicle has traveled the section of the road. Furthermore, according to this embodiment, the first string and the second string include a first character code in addition to the information regarding the location of the section of the road, and this embodiment may provide a tamper-proof method for including the information regarding the location of the section of the road in the protected file. Furthermore, according to this embodiment, since the first and second strings are extended, it may be more difficult to compromise the hash values of the first and second strings.
[0053] In a further variation of this embodiment, the first string may include a rough timestamp, information about the location of the section of the road, and a first set of characters, and may also be referred to as an extended first string. Similarly, according to a variation of this embodiment, the second string may include a rough timestamp, information about the location of the section of the road, and a second set of characters, and may also be referred to as an extended second string. Thus, according to this variation of the embodiment, the first and second strings may be further extended, making it more difficult to compromise the hash values of the first and second strings.
[0054] According to another example, the first signature may be a signature of a further extended first string generated by the first character code as a common secret key of the first camera and the second camera. Similarly, the second signature may be a signature of a further extended second string generated by the first character code as a common secret key.
[0055] According to one embodiment, the method may further include generating a further file including the license plate character and the protected file. According to this embodiment, generating the speeding ticket includes encrypting the further file using the 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 designated 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] The term "national authority" as used herein may refer to any governmental agency responsible for managing speeding tickets. Encryption may provide additional data protection for the license plate characters. Additionally, in this embodiment, the additional file may include a protected file, allowing the speeding ticket to be used to prove that the vehicle passed the first location. To do so, the encrypted additional file may be decrypted using the private key of the national authority.
[0057] Evidence that the vehicle has passed the first location can be created by duplicating a protected file that contains the hash value of the first string. This can be achieved by duplicating the protected file with the decrypted further file and the first character code and the license plate characters given by the hash function. As mentioned above, the first character code can be stored, according to one example, in a verification server of a national authority.
[0058] Furthermore, evidence that the vehicle has passed the first location may be created by verifying the protected file if it contains a first signature. This may be achieved by verifying that the first set of characters was signed by the first camera. Such verification may be performed using the license plate characters provided by the decrypted further file and the public key of the first camera or the common public key of the first and second cameras. As mentioned above, according to one example, the public key of the first camera or the common public key may be stored in a verification server of a national authority.
[0059] According to one embodiment, the generation of the further file may include generating a masked version of the first or second image in dependence on the first or second image and the first character code, and writing the masked version of the first or second image to the further file. The first or second image may allow to prove that the driver of the vehicle passed the 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 may 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 may perform the hash function or the first further hash function such that input data of the hash function or the first further hash function is a third string including pixel values of the first or second image and the first character code, and an output value of the hash function or the first further hash function may be a hash value of the third string. In this example, the hash value of the third string may be the salted hash value of the first or second image.
[0061] According to another example, the first camera may generate a masked version of the first or second image in the form of a second further signature using the first character code as the first camera's private key. In this example, the second further signature may be a signature of pixel values of the first or second image.
[0062] According to an embodiment, the method may further include measuring an average speed of the vehicle, generating a masked version of the average speed in dependence on the average speed and the first character code, and writing the masked version of the average speed to a further file.
[0063] The evaluation unit may calculate an average speed as described above. The average speed may serve to prove that the vehicle has violated a speed limit. The masked version of the average speed produced by the first character code may represent a tamper-proof version of the average speed.
[0064] As an example, the first camera may generate a masked version of the average velocity in the form of a salted hash value of the average velocity. The first camera may perform the hash function or the second further hash function such that an input data of the hash function or the second further hash function is a fourth string including the average velocity and the first character code, and an output value of the hash function or the second further hash function may be a hash value of the fourth string. In this example, the hash value of the fourth string may be a salted hash value of the average velocity.
[0065] According to another example, the first camera may generate a masked version of the average velocity in the form of a third further signature using the first character code as the first camera's private key. In this example, the third further signature may be a signature of the average velocity.
[0066] According to one embodiment, the method may further include repeating the method of generating speeding tickets, resulting in the generation of a plurality of speeding tickets respectively. The method may further include persistently storing the speeding tickets together as a whole such that the speeding tickets cannot be deleted or altered. Persistently storing the speeding tickets together may provide an increased level of defense against counterfeiting of a single speeding ticket of the plurality of speeding tickets.
[0067] According to one embodiment, the speeding tickets may be stored together as a whole and persistently in the form of a blockchain. Each copy of the blockchain may be stored on each node of the blockchain network. Using a blockchain to store the speeding tickets may have the advantage that to corrupt a single speeding ticket, the entire blockchain would have to be reconstructed, which is nearly impossible. To reconstruct the entire blockchain, half of the nodes would have to be compromised.
[0068] According to one embodiment, the speeding tickets can be persistently stored together as a whole in the form of an insert-only database. The insert-only database may be configured for the sole purpose of appending information to the insert-only database. Using an insert-only database to persistently store the speeding tickets may require fewer resources than storing the speeding tickets in the form of a blockchain.
[0069] In one example, an iteration of the method for generating a speeding ticket, hereinafter also referred to as an iteration or repetition of the method for generating a plurality of speeding tickets, may include using a first camera and a second camera each time the method is repeated. In each iteration of the method, a respective further speeding ticket may be created. Each of the further speeding tickets may be assigned to a respective further vehicle passing through the first and second locations of the road. Each of the further speeding tickets may include a respective further protection file that is generated in dependence on the first character code according to this example. Each of the further protection files may be created according to one of the variations described above.
[0070] In another example, performing the iterations of the method may include using multiple camera pairs, each camera pair including a first camera and a second camera.Each iteration of the method for generating a respective further speeding ticket includes generating, by a first camera of a respective camera pair, a respective further first image of at least a portion of a respective further vehicle, the first camera of the respective camera pair being disposed at a respective further first position of a roadway and comprising a respective further persistent memory device for persistently storing a respective further first character code in a hardwired manner and inaccessible from outside the first camera of the respective camera pair, the portion of the respective further vehicle including a license plate of the respective further vehicle, the license plate of the respective further vehicle including characters; detecting, in dependence on the respective further first image, a respective further first set of characters of the license plate of the respective further vehicle; and generating, by the first camera of the respective camera pair using the respective further first set of characters and the respective further first character code, a respective further protected file, the respective further protected file including a mask of the respective first set of the respective further characters. generating a respective further second image of a part of the respective further vehicle by a second camera of the respective camera pair, the second camera of the respective camera pair being positioned at a respective further second location of the road; detecting a respective further second set of characters of a license plate of the respective further vehicle in dependence on the respective further second image; verifying using the respective further protection file and the respective further second set of characters that the first set of each further character is equal to the respective further second set of characters; checking whether the respective further vehicle violates a speed limit in dependence on information regarding an average speed of the respective further vehicle between the respective further first location and the respective further second location; and generating a respective further speeding ticket if the respective further vehicle violates the speed limit and verifying that the first set of each further character is equal to the respective further second set of each further character.
[0071] FIG. 1 shows a system 10 for generating a speeding ticket 80 (denoted at 10). The system 10 may comprise a first camera 1 and a second camera 2. The first camera 1 may be configured to generate a first image 11 (denoted in FIG. 2) of at least a portion 3 of a vehicle 4. The first camera 1 may be located at a first location 21 of a road 23 and comprises a persistent memory device 31 that stores a first character code 41 in a hardwired manner in a persistent manner and 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 masked ROM.
[0072] As shown in Fig. 2, the part 3 of the vehicle 4 comprises a license plate 5 of the vehicle 4, the license plate 5 comprising characters 6. The first camera 1 may be configured to detect a first set 51 (shown in Fig. 3) of characters of the license plate 5 of the vehicle 4 depending on the first image 11 shown in Fig. 2. Furthermore, the first camera 1 may be configured to generate a protected file 61 using the first set 51 (shown in Fig. 3) of characters of the license plate 5 and the first character code 41. The protected file 61 depicted in Fig. 4 may include a masked version 71 of the first set of characters of the license plate 5.
[0073] The second camera 2 may be configured to generate a second image 12 (shown in FIG. 5 ) of at least a part 3 of the vehicle 4. The second camera 2 may be located at a second location 22 on the road 23. The second camera 2 may be configured to detect a second set of characters 52 (shown in FIG. 6 ) on the license plate 5 of the vehicle 4 in dependence on the second image 12 (shown in FIG. 5 ).
[0074] The system 10, and in one example the evaluation unit 7 of the system 10, may be configured to verify that the first set of characters 51 (shown in FIG. 3) is equal to the second set of characters 52 (shown in FIG. 6) using the protection file 61 and the second set of characters 52 (shown in FIG. 6).
[0075] Furthermore, the system 10, and in one example the evaluation unit 7, can be configured to check whether the vehicle 4 violates a speed limit depending on information about the average speed of the vehicle 4 between a first location 21 and a second location 22. The first location 21 and the second location 22 are depicted in the form of a section of a road 23 comprising a first camera 1 and a second camera 2, respectively.
[0076] Additionally, the system 10 can be configured to generate a speeding ticket 80 (shown in Figures 10-13) when the vehicle 4 violates a speed limit and when the first set of characters 51 is verified to be equal to the second set of characters 52.
[0077] 7 is a diagram showing an example of a first camera 1. According to this example, the first camera 1 may include a computer system 112, referred to as a first computer system 112 in the following.
[0078] The first computer system 112 may be described in the general context of computer system executable instructions, such as program modules, executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, etc. that perform particular tasks or implement particular abstract data types.
[0079] Components of the first computer system 112 may include, but are not limited to, one or more processors or processing units 16, a system memory 228, and a bus 18 that couples 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, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. By way of example and not limitation, such architectures include 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 a variety of computer system readable media. Such media may be any available media that can be accessed by the first computer system 112 and may include both volatile and non-volatile media.
[0081] The system memory 28 may employ a readable medium in the form of a 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 a portion of the functionality of embodiments of the present invention.
[0082] A program utility 40 of the first computer system 112 having a set (at least one) of program modules 90 can be stored in the memory 28, as an example. The programs / utilities can include an operating system, additional program modules and / or program data. The program modules 90 can be generally configured to perform part of the functionality and / or methodology of embodiments of the invention described herein.
[0083] 7 shows a variation according to which the first persistent memory 31 is part of the system memory 28. For example, the first memory 31 may be mounted on a circuit board that includes RAM 30 and cache 32. In a further variation, the first persistent memory 31 may be located within the first camera 1 or may be mounted externally from the first computer system 112 having a connection thereto.
[0084] In one example, the first camera 1 may include an optical system 72 with at least one lens 73 and a photodiode 74. The lens 73 may capture light reflected by the portion 3 of the vehicle 4 and direct the captured light to the photodiode 74, which may generate an electronic output signal of the optical system 72 depending on the design of the portion 3 of the vehicle 4. The optical system 72 may 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. In executing the image generation module 91, the processor 16 may calculate a first pixel value dependent first image 11 (shown in FIG. 2 ) dependent on the electronic output signal of the optical system 72. In response to generating the first image 11, the processor 16 may generate a first time stamp and store the first image 11 in the form of a first image file, for example in the RAM 30.
[0086] Additionally, the first camera 1 may include a character recognition module 92 for recognizing the characters 6 on the license plate 5 (shown in FIG. 2). In executing the recognition module 92, the processor 16 may read and process the first image file and execute a pattern recognition algorithm to recognize each character of the characters 6 on the license plate 5. The characters 6 on the license plate 5 detected, i.e., recognized, by the first camera 1 are labeled as a first set of characters 51 (shown in FIG. 3).
[0087] In addition, the first camera 1 may include a conversion module 293 for generating the protected file 61 depending on the first set of characters 51 and the first character code 41 .
[0088] 8 is a diagram illustrating an example of the second camera 2. According to this example, the second camera 2 may include a computer system 212, hereinafter referred to as a second computer system 212, as shown in FIG.
[0089] The second computer system 212 may be described in the general context of computer system executable instructions, such as program modules, executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, etc. that perform particular tasks or implement particular abstract data types.
[0090] Components of the second computer system 212 may include, but are not limited to, one or more processors or processing units 216, a system memory 228, and a bus 218 that couples various components including the system memory 228 to the processor 216. The bus 218 represents any one or more of several types of bus structures including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. By way of example and not limitation, such architectures include 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 a variety of computer system readable media. Such media may be any available media that can be accessed by the second computer system 212 and may include both volatile and non-volatile media.
[0092] The system memory 228 may employ a readable medium in the form of a volatile memory, such as a random access memory (RAM) 230 and / or a 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 a portion of the functionality of embodiments of the present invention.
[0093] A program utility 240 of the second computer system 212 having a set (at least one) of program modules 290 can be stored in the memory 228, as an example. The programs / utilities can include an operating system, additional program modules and / or program data. The program modules 290 can generally be configured to perform part of the functionality and / or methodology of embodiments of the invention described herein.
[0094] In one example, the second camera 2 may include an optical system 272 with at least one lens 273 and a photodiode 274. The lens 273 may capture light reflected by the part 3 of the vehicle 4 as the vehicle passes the second location 22. Further, the lens 273 may direct the captured light to the photodiode 274 to generate an electrical output signal of the optical system 272, depending on the design of the part 3 of the vehicle 4. The optical system 272 may transmit the electronic output signal of the optical system 272 to the interface 224 of the second computer system 212.
[0095] The second computer system 212 may include an image generation module 291. The processor 216, in executing the image generation module 291, may calculate a second image 12 (shown in FIG. 5 ) in the form of second pixel values dependent on the electronic output signal of the optical system 272. In response to generating the second image 12, the processor 216 may generate a second timestamp and store the second image 12 in the form of a second image file, for example in the RAM 230.
[0096] Additionally, the second camera 2 may include a character recognition module 292 for recognizing the characters 6 on the license plate 5 (shown in FIG. 5). When the processor 216 executes the recognition module 292, it may read and process the second image file and execute a pattern recognition algorithm to recognize each character of the characters 6 on the license plate 5. The characters 6 on the license plate 5 detected, i.e., recognized, by the second camera 2 are labeled as a second set of characters 52 (shown in FIG. 6).
[0097] In addition, the first camera 1 may include a conversion module 293 for generating the protected file 261 depending on the first set of characters 51 and the first character code 41 .
[0098] FIG. 9 is a flow chart of a method for generating a speeding ticket, such as speeding ticket 80.
[0099] In step 1001, a first image 11 of at least a portion 3 of a vehicle 4 may be generated by a first camera 1. The first camera 1 may be located at a first location 21 on a road 23 and may comprise a persistent memory device 31 that stores a first character code 41 in a hard wired manner and inaccessible outside the first camera 1. The portion 3 of the vehicle 4 may include a license plate 5 of the vehicle 4, the license plate 5 may include characters 6.
[0100] In step 1002 , a first set of characters 51 on the license plate 5 of a vehicle 4 can be detected depending on a first image 11 .
[0101] In step 1003, a protected file 61 may be generated by the first camera 1 using the first set 51 of characters of the license plate 5 and the first character code 41. The protected file 61 may include a masked version 71 of the first set of characters of the license plate 5.
[0102] In step 1004, a second image 12 of the part 3 of the vehicle 4 may be generated by a second camera 2. The second camera 2 may be positioned at a second location 22 on the road 23.
[0103] In step 1005 , a second set of characters 52 of the license plate 5 can be detected depending on the second image 12 .
[0104] In step 1006, it is verified that the first set of characters 51 and the second set of characters 52 are equal using the protection file 61 and the second set of characters 52.
[0105] In step 1007 , a check whether the vehicle 4 violates a speed limit may be performed dependently on information regarding the average speed of the vehicle 4 between the first location 21 and the second location 22 .
[0106] In step 1008, a speeding ticket 80 may be generated if the vehicle 4 violates the speed limit and if the first set of characters 51 and the second set of characters 52 are verified to be equal.
[0107] The numerical representation of steps 1001, 1002, 1003, 1004, 1005, 1006, 1007, 1008 does not dictate the order of their execution. For example, steps 1004 and 1005 can be executed before steps 1001, 1002, 1003. In this case, the first camera 1 and the second camera 2 can be positioned on the road 23 such that a vehicle 4 can pass the second camera 2 before the vehicle 4 can pass the first camera 1.
[0108] In one example, procedure 1001 may be performed using optical system 72 and image generation module 91 described above. Further, in one example, procedure 1002 may be performed by processor 16 to execute recognition module 92. Procedure 1003 may be performed by executing conversion module 93. Procedure 1004 may be performed using optical system 272 and image generation module 291 described above. Further, in one example, procedure 1005 may be performed by processor 216 to execute recognition module 292.
[0109] In the following, some examples are given to explain 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 a first variant, the conversion module 93 may include a hash function, such as for example a Secure Hash Algorithm (SHA)-256. The processor 16 may construct the first string by concatenating the first set of characters 51 and the first character code 41. Furthermore, the processor 16 may generate a hash value of the first string by executing the hash function. According to the first variant, the hash value of the first string may represent a masked version 71 of the first set of characters. The processor 16 may write the hash value of the first string to the protected file 61 according to the first variant. As an example, the processor 16 may store the protected file 61 in the 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 a memory device 70 of the evaluation unit 7. The evaluation unit 7 may be configured to automatically delete the protection file 61 in the memory device 70 after a predefined time has elapsed. The predefined time is equal to the shortest possible time for the vehicle 4 to travel along the road 23 from the first location 21 to the second location 22 without violating a speed limit.
[0112] According to one example, processor 16 may calculate an approximate timestamp, for example, by rounding the actual timestamp of the clock of processor 16 to the next minute or second. In this example, processor 16 may construct a first string by concatenating the first set of characters 51, the first character code 41, and the approximate timestamp.
[0113] Moreover, according to a further variant, the processor 16 can construct the first string by concatenating the first set of characters 51, the first character code 41, the approximate timestamp, and information about the location of the section of road 23. The section of road can include the first location 21 and / or the second location 22. In one example, the information about the location of the section of road 23 can be GPS coordinates of an area including the first location 21 and the second location 22.
[0114] According to a first variant, the second camera 2 may comprise a conversion module 293 and a persistent memory device 231 for storing the first character code 41 in a hardwired manner, persistently and inaccessibly 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 masked ROM.
[0115] According to a first variant, the conversion module 293 may include a hash function. The processor 216 may construct the second string by concatenating the second set of characters 52 and the first character code 41. Furthermore, the processor 16 may execute the hash function to generate a hash value of the second string, also called second hash value 1000. According to a first variant, the second hash value 1000 may represent a masked version of the second set of characters 52. The second camera 2 may transmit the second hash value 1000 to the evaluation unit 7.
[0116] According to one example, the processor 216 may calculate an approximate timestamp, for example, by rounding the actual timestamp of the clock of the processor 216 to the next minute or second. In this example, the processor 216 may construct a second string by concatenating the second set of characters 52, the first character code 41, and the approximate timestamp.
[0117] Moreover, according to a further variant, the processor 216 can construct the second string by concatenating the second set of characters 52, the first character code 41, the approximate timestamp, and information about the location of the section of the road 23. The processor 16 can be configured to calculate the GPS coordinates of the area including the first location 21 and the second location 22 based on the GPS coordinates of the first location 21 and the predetermined size of the area using a rounding algorithm. Similarly, the processor 216 can be configured to calculate the GPS coordinates of the area including the first location 21 and the second location 22 based on the GPS coordinates of the second location 22 and the predetermined size of the area using a rounding algorithm.
[0118] According to a first variant, the evaluation unit 7 can perform a verification of whether the first set of characters 51 is equal to the second set of characters 52 by comparing the hash value of the first string with the 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 for reading 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 violates a speed limit. The read command can only be executed successfully if the protected file 61 has not been deleted before executing the read command. 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 second hash value 1000, then verification may not be completed.
[0119] In one variant, step 1007, i.e. checking whether the vehicle 4 violates the speed limit, may be performed by executing step 1006, i.e. by verifying that the first set of characters 51 is equal to the second set of characters 52. Such a variant may be provided by providing an evaluation unit 7 configured to automatically delete the protected file 61 in the memory device 70 after a predefined time has elapsed, as described above. If a read command for reading the protected file 61 from the memory device 70 is successful and is initiated after the generation of the second image 12, the successful execution of the securely executed reading of the file 61 may be considered as information about the average speed of the vehicle 4 between the first position 21 and the second position 22. In this case, the information about the average speed of the vehicle 4 may be such that the average speed of the vehicle 4 between the first position 21 and the second position 22 is higher than the speed limit.
[0120] According to a further example, the system 10 may be configured to calculate a value of an average speed 81 of the vehicle 4. In one example, the system 10, e.g. the evaluation unit 7, may calculate the value of the average speed 81 of the vehicle 4 as a quotient of a fixed length between the first position 21 and the second position 22 and a time difference between a first point in time indicated by a first timestamp and a second point in time indicated by a second timestamp. In one example, the first camera 1 may transmit a first timestamp to the evaluation unit 7 and the second camera 2 may transmit a second timestamp to the evaluation unit 7.
[0121] The evaluation unit 7 may generate a speeding ticket 80 if the vehicle 4 violates a speed limit if the verification is completed, i.e. in case of verifying that the first set of characters 51 is equal to the second set of characters 52. As mentioned above, according to one example, the vehicle 4 violates a speed limit if the protected file 61 is successfully read after the second image 12 is generated. In another example, the evaluation unit 7 may calculate a value of the average speed 81 of the vehicle 4 and compare the average speed with the speed limit in order to check if the vehicle 4 violates a speed limit.
[0122] The speeding ticket 80 may, for example, include a masked version 71 of the first set of characters in the form of a protected 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 the first set of characters 51 or the 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 the first set of characters 51 or the second set of characters 52 and a value for an average speed 81.
[0123] In most cases, the evaluation unit 7 is able to generate a speeding ticket 80, such that the speeding ticket may comprise a masked version 71 of the first set of characters, a value of the average speed 81, the characters 6 of the license plate 5 in the form of the first set of characters 51 or the second set of characters 52, a first timestamp and / or a second timestamp, not shown in Fig. 13. Furthermore, the speeding ticket 80 may comprise not shown geographic location information of the first image 11 and / or the second image 12 and / or the first location 21 and / or the second location 22.
[0124] In general, the speeding ticket 80 may include the first timestamp, the average speed 81 value, the first image 11, and / or the geolocation information of the first location in a respective hashed form. To achieve this, the first camera 1 may generate respective concatenated strings by concatenating the first timestamp, the average speed 81 value, the first image 11, and / or the geolocation information of the first location, respectively, with the first character code 41. To create the respective hashed forms, the first camera 1 may use a hash function to calculate respective hash values of the concatenated strings respectively including the first timestamp, the average speed 81 value, the first image 11, and the geolocation information of the first location.
[0125] In FIG. 1, the evaluation unit 7 is depicted in the position of the external environment of the first camera 1 and the second camera 2, but this is not necessary. The evaluation unit 7 can be arranged in the first camera 1, for example in the form of an evaluation module 94 shown in FIG. 7 with dashed lines. The evaluation module 94 can be configured to verify and check whether the vehicle 4 violates the speed limit and also to 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 transmit the second hash value 1000 to the first camera 1. In a further example, the evaluation unit 7 can be arranged in the second camera 2, for example in the form of an evaluation module 94 shown in FIG. 8 with dashed lines. In this case, the first camera 1 can transmit the protected file 61 to the second camera 2. Similarly, the evaluation module 94 of the second camera 2 can be configured to verify and check whether the vehicle 4 violates the speed limit and to write a speeding ticket 80.
[0126] In one example, the system 10 can transmit the speeding ticket 80, for example by the evaluation unit 7 or the first camera 1 or the second camera 2, to the verification server 140. A national authority can access the verification server 140 to verify the speeding ticket 80. The verification server 140 can store the first character code 41 to perform verification of the speeding ticket 80.
[0127] FIG. 15 is a flow chart of a method for verifying a speeding ticket 80. In step 2001, a control string can be created by concatenating the characters 6 of the license plate 5 and the first character code 41 given by the speeding ticket 80 with respect to the first variant. In step 2002, a control hash value can be generated in response to the control string using a hash function. The control hash value can be a hash value of the control string. In step 2003, the control hash value can be compared with a hash value of a first string, which can be given by a masked version 71 of the first set of characters according to the first variant. The masked version 71 of the first set of characters can 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 to be verified. Furthermore, the verification that the control hash value is equal to the hash value of the first string can be considered to be verifying that the vehicle 4 has passed the first location 21, i.e. that the masked version 71 of the first set of characters has been generated by the first camera 1. Verification of each of the hashed forms discussed above can be done in a similar manner.
[0128] In one example, the evaluation unit 7 may encrypt the speeding ticket 80 using a national authority's public key 82. The validation server 140 may store the national authority's private key 83 and may use the private key 83 to decrypt the encrypted speeding ticket 80.
[0129] According to a second variant, the conversion module 93 may include a signature algorithm for signing the first set of characters 51. According to a second variant, 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 may sign the first set of characters 51 depending on the common secret key, which executes the signature algorithm of the conversion module 93. The processor 16 may calculate a first signature as a result of signing the first set of characters 51 by the common secret key. According to a second variant, the first signature may represent a masked version 71 of the first set of characters. The processor 16 may write the first signature in a protected file 61 according to the second variant. As an example, the processor 16 may store the protected file 61 in the RAM 30.
[0130] According to a second variant, the transformation module 293 may include a signature algorithm for signing the first set of characters 51. Furthermore, according to a second variant, the second camera 2 may include a persistent memory device 231 that stores the first character code 41 in a hardwired manner as a persistent common secret key and inaccessible from outside the second camera 2. The processor 216 may sign the second set of characters 52 in dependence on the common secret key, which performs the algorithm signing of the transformation module 293. The processor 16 may calculate a second signature 2000 as a result of signing the second set of characters 52 by the common secret key.
[0131] According to a second variant, the second signature 2000 may represent a masked version of the second set of characters 52. The second camera 2 may transmit the second signature 2000 to the evaluation unit 7, as depicted by the dashed line in FIG.
[0132] According to a second variant, the evaluation unit 7 may perform a verification of whether the first set of characters 51 is equal to the second set of characters 52 by comparing the first signature with the second signature 2000. To achieve this, the processing unit 75 of the evaluation unit 7 may send a read command to the memory device 70 for reading 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 may compare the first signature with the second signature 2000. If the first signature is equal to the second signature 2000, the verification may be completed. If the first signature is not equal to the second signature 2000, the verification may not be completed.
[0133] With both the first and second variants, the first camera 1 and the second camera 2 together can represent an individual pair of cameras, and a first character code is generated uniquely for this individual pair.
[0134] According to a further example, the first character code 41 may be a private key of the first camera 1. In this case, the evaluation unit 7 may store, for example in the second persistent memory 231, a public key of the first camera 1, which corresponds to the private key of the first camera. According to this further example, the processor 16 may generate the protected file 61 such that the protected file 61 includes a first further signature. The processor 16 may calculate the first further signature by signing the first set of characters 51 with the private key of the first camera 1. The first camera 1 may transmit the protected file to the evaluation unit 7. The evaluation unit 7 may verify the first further signature. The evaluation unit 7 may verify the first further signature by the first further signature, the public key of the first camera and the second set of characters 52. The second camera 2 may transmit the second set of characters 52 to the evaluation unit 7. In another example, the first camera 1 may transmit the protected file 61 to the second camera 2 if the second camera 2 is configured with an evaluation unit 7, for example in the form of an evaluation module 294.
[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 transmit the encrypted hash value of the second string to the first camera 1. The processor 16 may perform the verification by decrypting the encrypted hash value of the second string and 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] 16 illustrates a variation of the system 10 according to which the system 10 may include multiple pairs of cameras 16, each pair of the pairs of cameras 16 including a first camera and a second camera. For example, a first pair of cameras 16-1 may include a first camera 1 and a second camera 2. An nth pair of cameras 16-n may include a first camera 1-n and a second camera 2-n, a second pair of cameras 16-2 may include a first camera 1-2 and a second camera 2-2, and an ith pair of cameras 16-i may include a first camera 1-i and a second camera 2-i.
[0137] A plurality of pairs of cameras 16 may be used to generate speeding tickets. For example, in addition to the speeding ticket 80, further speeding tickets 80-2, ..., 80-i, ..., 80-n (shown in Figs. 17 and 18) may be generated for further vehicles 4-2, ..., 4-i, ..., 4-n. The index "i" is used to represent a respective one of the further pairs of cameras 16-2, ..., 16-i, ..., 16-n, a respective one of the speeding tickets 80-2, ..., 80-i, ..., 80-n, or a respective one of the further vehicles 4-2, ..., 4-i, ..., 4-n. The further speeding tickets 80-2, ..., 80-i, ..., 80-n may be generated in the same manner as the speeding ticket 80, for example according to the first or second variant described above, as follows:
[0138] In one example, the respective further first image of at least a part of each further vehicle 4-i may be generated by a first camera 1-i of a respective pair of cameras 16-i. The first cameras 1, 1-2, ..., 1-i, ..., 1-n of the respective pairs of cameras 16, 16-2, ..., 16-i, ..., 16-n are arranged at respective first positions 21, 21-2, ..., 21-i, ..., 21-n of the road 23 and include respective persistent memory devices 31, 31-2, ..., 31-i, ..., 31-n that store respective first character codes 41, 41-2, ..., 41-i, ..., 41-n in a persistent hardwired manner and that are not accessible outside the first cameras. The part of each further vehicle 4-i may include the license plate of the respective further vehicle 4-i, the license plate of the respective further vehicle 4-i including the character.
[0139] Further, in one example, a respective further first set of characters of the license plate of each further vehicle 4-i may be detected depending on the respective further first image.
[0140] Further, in one example, a respective further protected file may be generated by the first camera 1-i of the respective pair of cameras 16-i using the respective further first set of characters and the respective further first character code 41-i. Each further protected file may include a masked version of the respective further first set of characters.
[0141] Further, in one example, a respective further second image of a part of each further vehicle 4-i may be generated by a second camera 2-i of each pair of cameras 16-i, which may be positioned at a respective further second position 22-i of the road 23.
[0142] Further, in one example, a respective further second set of characters of the license plate of each further vehicle 4-i may be detected depending on the respective further second image.
[0143] Further, in one example, a respective further verification that the respective further first set of characters is equal to the respective further second set of characters may be performed using the protection file and the respective further second set of characters. In one example, evaluation units 7, 7-2, ..., 7-i, ..., 7-n (shown in Figure 17) may perform the respective further verification. Each further evaluation unit 7-i may be located within the first or second camera of the respective camera pair 16-i or may be located outside the first and second cameras of the respective camera pair 16-i.
[0144] Further, in one example, each further check whether the respective further vehicle 4-i violates a speed limit may be performed in dependence on information regarding the average speed of the respective further vehicle 4-i between the respective further first position and the respective further second position.
[0145] Further, in one example, a respective further speeding ticket 80-i may be generated in case the respective further vehicle 4-i violates the speed limit and verifying that the respective further first set of characters is equal to the respective further second set of characters. The evaluation unit 7 or each further evaluation unit 7-i may generate a respective further speeding ticket 80-i.
[0146] 17 shows a variant showing that each further evaluation unit 7-i may be located outside the first and second camera of each camera pair 16-i. Like the evaluation unit 7, each further evaluation unit 7-i may encrypt each further speeding ticket 80-i using the public key 82 of the national authority and transmit each further speeding ticket 80-i to a storage system 170 of the national authority. The storage system 170 may be configured to permanently store the speeding tickets 80, 80-2, ..., 80-i, ..., 80-n together as a whole such that they cannot be deleted or altered.
[0147] In one example, the verification server 140 may store the respective further first character code 41-i of the respective first camera of the respective pair of cameras 16-i. In this example, the national authority can verify that the respective further protected file was generated by the respective first camera of the respective pair of cameras 16-i.
[0148] According to one example, storage system 170 may include an insert-only database 180, depicted in Figure 18. The insert-only database may be configured to only append information to the insert-only database. Once each speeding ticket 80-i is added to the insert-only database 180, each speeding ticket 80-i cannot be modified or deleted from the insert-only database 180.
[0149] According to a further example, the storage system 170 can be designed in the form of a blockchain network 190, as shown in FIG. 19. The blockchain network 190, including entities 190-1, 190-2, ..., 190-i, ..., 190-m, can store multiple copies of the speeding tickets 80, 80-2, ..., 80-i, ..., 80-n. Each copy of the speeding tickets 80, 80-2, ..., 80-i, ..., 80-n can be arranged in the form of a blockchain 200, as shown in FIG. 20, and can be stored in a respective entity 190-i of the blockchain network 190. Each entity 190-i can be, by way of example, a server of a respective county of a state.
[0150] The blockchain 200 may include blockchain elements 201-1, ..., 201-i, ..., 201-m. The blockchain elements 201-1, ..., 201-i, ..., 201-m may include header files 202-1, ..., 202-i, ..., 202-m and data blocks 203-1, ..., 203-i, ..., 203-m. Each data block 203-i may include a respective 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 the data blocks 203-1, ..., 203-i, ..., 203-m may be discontinuous. Each header file 202-1, ..., 202-i, ..., 202-m may include a respective block hash value, which may be a hash value of the data provided by the set of speeding tickets 80, 80-2, ..., 80-i, ..., 80-n of a respective data block 203-i.
[0151] Each header file 202-i may include descriptive data, such as a timestamp of the respective blockchain element 201-i, and a chain element hash value of the respective predecessor blockchain element 201-(i-1). The predecessor blockchain element 201-(i-1) precedes the respective blockchain element 201-i in the blockchain 200. The chain element hash value of each predecessor blockchain element 201-(i-1) may be a hash value of data including descriptive data of the header file of the respective predecessor blockchain element 201-(i-1), such as a timestamp of the respective predecessor blockchain element 201-(i-1), and a block hash value of the respective predecessor blockchain element 201-(i-1). The block hash value of each predecessor blockchain element 201-(i-1) may be a hash value of data including descriptive data of the header file of the respective predecessor blockchain element 201-(i-1), such as a timestamp of the respective predecessor blockchain element 201-(i-1). i-1 , 80-i, . . . , 80-n, may be a hash value of the data provided by the set of speeding tickets 80, 80-2, . . . , 80-i, . . . , 80-n.
Claims
1. 1. A computer-implemented method for generating a speeding ticket, the method comprising: generating a first image of at least a portion of a vehicle with a first camera, the first camera being positioned at a first location on a road, the portion of the vehicle including a license plate of the vehicle, the license plate including character; detecting a first set of characters on the license plate of the vehicle in dependence on the first image; generating a secured file with the first camera using the first set of characters of the license plate and a first character code, the secured file including a masked version of the first set of characters of the license plate; generating a second image of the portion of the vehicle with a second camera, the second camera being positioned at a second location on the road; and detecting a second set of characters on the license plate dependent on the second image; and verifying whether the first set of characters is equal to the second set of characters using the protected file; checking whether the vehicle violates a speed limit in dependence on information about an average speed of the vehicle between the first position and the second position; generating the speeding ticket in response to determining that the vehicle is violating the speed limit and in response to verifying that the first set of characters is equal to the second set of characters; 4. A computer-implemented method comprising:
2. 2. The computer-implemented method of claim 1, further comprising: storing the protected file in a memory device; and automatically deleting the protected file in the memory device after a predetermined time period. The computer-implemented method, wherein the predetermined time is equal to the shortest possible time to travel on the road from the first location to the second location without violating the speed limit, and checking whether the vehicle is violating the speed limit includes successfully reading the protected file from the memory device.
3. 3. A computer-implemented method according to claim 1 or 2, comprising: generating a first string comprising the first character code and the first set of characters; calculating a hash value of the first string by the first camera using a hash function, the protected file including the hash value of the first string; generating a second string comprising the first character code and the second set of characters; calculating a hash value of the second string by the second camera using the hash function; comparing the hash value of the first string with the hash value of the second string; Further comprising: the first camera includes a first persistent memory device that stores the first character code and is inaccessible outside the first camera; the second camera includes a second persistent memory device that stores the first character code and is inaccessible outside the second camera; A computer-implemented method, wherein the first character code is generated uniquely for the first camera and the second camera.
4. 4. The computer-implemented method of claim 3, further comprising: storing the hash value of the first string locally on the first camera; transmitting the hash value of the second string from the second camera to the first camera; The computer-implemented method further comprising:
5. 5. A computer-implemented method according to any one of claims 1 to 4, comprising: generating a signature of the first set of characters using the first character code as a common secret key for the first camera and the second camera, the protected file including the signature of the first set of characters; generating a signature of the second set of characters using the first character code; comparing the signature of the first set of characters with the signature of the second set of characters; Further comprising: 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 not accessible outside of the second camera.
6. 6. The computer-implemented method of claim 5, further comprising: storing the signature of the first set of characters locally on the first camera; transmitting the signature of the second set of characters from the second camera to the first camera; The computer-implemented method further comprising:
7. The computer-implemented method of claim 1 , wherein the first character code is uniquely generated for the first camera and the second camera.
8. 8. A computer-implemented method according to any one of claims 1 to 7, comprising: generating a signature of the first set of characters using the first character code as a private key of the first camera, the protected file including the signature of the first set of characters; verifying the signature of the first set of characters with a public key of the first camera that corresponds to the private key of the first camera; Further comprising: A computer-implemented method, wherein the first character code is generated uniquely for the first camera and the second camera.
9. 9. A computer-implemented method according to any one of claims 1 to 8, comprising: generating an encrypted version of the first set of characters using the first character code as a symmetric encryption key for the first camera and the second camera, the protected file including the encrypted version of the first set of characters; and generating a signature of the first set. decrypting the encrypted version of the first set of characters with the first character code; Further comprising: the first camera includes a first persistent memory device that stores the first character code and is inaccessible outside the first camera; the second camera includes a second persistent memory device that stores the first character code and is inaccessible outside the second camera; A computer-implemented method, wherein the first character code is generated uniquely for the first camera and the second camera.
10. 10. A computer-implemented method according to any one of claims 3 to 9, comprising: storing the hash value of the first string in a local memory of the first camera; encrypting the hash value of the second string in dependence on a public key of the first camera; sending an encrypted hash value of the second string to the first camera; decrypting the encrypted hash value of the second string; and comparing the hash value of the second string with the hash value of the first string from the first camera; The computer-implemented method further comprising:
11. 11. A computer-implemented method according to any one of claims 3 to 10, comprising: Calculating an approximate time stamp by the first camera; calculating the approximate time stamp by the second camera; wherein the first string comprises the approximate timestamp and the second string comprises the approximate timestamp.
12. 12. A computer-implemented method according to any one of claims 3 to 11, comprising: generating said first string and said second string such that said first string contains information regarding a location of said section of road and said second string contains said information regarding said location of said section of road. and wherein the section of the road includes the first location and the second location.
13. 13. A computer-implemented method according to any one of claims 1 to 12, comprising: generating a file containing the character of the license plate and the secured file; encrypting said file using a public key of a state authority to generate said speeding ticket; Further comprising: The speeding ticket comprises the encrypted file.
14. 14. The computer-implemented method of claim 13, further comprising: generating a mask version of the first image or the second image in dependence 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; Further comprising: A computer-implemented method, wherein the first character code is generated uniquely for the first camera and the second camera.
15. 15. A computer-implemented method according to any one of claims 13 to 14, comprising: Measuring the average speed of the vehicle; and generating a masked version of the average velocity in dependence on the average velocity and the first character code image; writing the masked version of the average velocity to the file; Further comprising: A computer-implemented method, wherein the first character code is generated uniquely for the first camera and the second camera.
16. 16. A computer-implemented method according to any one of claims 1 to 15, comprising: generating a plurality of speeding tickets; storing said plurality of speeding tickets together in a permanent manner as a whole such that said plurality of speeding tickets cannot be deleted or altered; The computer-implemented method further comprising:
17. 20. The computer-implemented method of claim 16, wherein the plurality of speeding tickets is persistently stored in its entirety in the form of a block chain.
18. 18. The computer-implemented method of claim 16, wherein the plurality of speeding tickets as a whole are persistently stored together in the form of an insert-only database, the insert-only database being configured for only adding information to the insert-only database.
19. A camera, the camera comprising: generating a first image of at least a portion of a vehicle, the camera including a persistent memory device that persistently stores a first character code in a state that is not accessible outside of the camera, the portion of the vehicle including a license plate of the vehicle, the license plate including characters; detecting a first set of characters on the license plate of the vehicle in dependence on the first image; generating a secured file with the camera using the first set of characters of the license plate and the first character code, the secured file including a masked version of the first set of characters of the license plate; The camera is configured to:
20. 1. A system for generating speeding tickets, the system including a first camera and a second camera, the system comprising: generating a first image of at least a portion of a vehicle with a first camera, the first camera being positioned at a first location on a road, the portion of the vehicle including a license plate of the vehicle, the license plate including character; detecting a first set of characters on the license plate of the vehicle in dependence on the first image; generating a secured file with the first camera using the first set of characters of the license plate and a first character code, the secured file including a masked version of the first set of characters of the license plate; generating a second image of the portion of the vehicle with a second camera, the second camera being positioned at a second location on the road; and detecting a second set of characters on the license plate dependent on the second image; and verifying whether the first set of characters is equal to the second set of characters using the protected file; checking whether the vehicle violates a speed limit in dependence on information about an average speed of the vehicle between the first position and the second position; generating the speeding ticket in response to determining that the vehicle is violating the speed limit and in response to verifying that the first set of characters is equal to the second set of characters; A system configured to run
Citation Information
Patent Citations
Traffic violation handling method and system based on block chain
CN110599774A
Privacy-preserving evidence in alpr application
JP2015119479A
Method and device for detecting whether a vehicle has exceeded a speed limit
US20100302362A1
Accessing information based on privileges
US20200272755A1
