Privacy-protected parking lot information query method, device and equipment and medium
By disturbing and encrypting the coordinates of the target query position in parking lot information query, the problem of low privacy in the prior art is solved, and effective protection of user query needs is achieved.
Patent Information
- Application Number
- CN202411768997.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-12-04
- Publication Date
- 2025-03-28
AI Technical Summary
In the existing parking lot information query method, user privacy cannot be effectively protected, resulting in query requirements that may be stolen by untrusted servers, resulting in information leakage.
By obtaining the actual coordinates of the target query position in the target area, perturbation processing is performed to generate multiple initial perturbation coordinates, calculating the latitude and longitude coordinate density values to obtain the perturbation level, adjusting and encrypting the final perturbation coordinates, and sending the encrypted coordinates to the server for query.
It realizes protection of target query locations, improves the privacy of parking lot information query, and prevents untrusted third parties from stealing query information.
Smart Images
Figure CN119719143A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of information query technology, and in particular to a parking lot information query method, device, equipment and medium with privacy protection. Background Art
[0002] Information query is a core basic function in smart parking services. In smart parking services, users often need to query parking lots (parking spaces, charging piles) and other related information, but do not want their query needs to be leaked. Existing parking lot information query methods usually do not protect user privacy, or only provide simple protection, such as firewalls, which will cause the user's query needs to be stolen by untrusted servers, causing the user's information to be leaked. It can be seen that there is a problem of low privacy in parking lot information query. Summary of the invention
[0003] The present application provides a parking lot information query method, device, equipment and medium with privacy protection, which can solve the problem of low privacy of parking lot information query.
[0004] In a first aspect, an embodiment of the present application provides a privacy-protected parking lot information query method, the parking lot information query method comprising:
[0005] Obtaining the actual coordinates of the target query position in the target area; the target area includes multiple sub-areas;
[0006] Perturbing the actual coordinates of the target query position to obtain multiple initial perturbed coordinates;
[0007] Based on all the initial disturbance coordinates and the actual coordinates of the target query position, the latitude coordinate density value and the longitude coordinate density value are obtained, and the disturbance level is obtained according to the latitude coordinate density value and the longitude coordinate density value; the latitude coordinate density value is used to describe the density of all the initial disturbance coordinates in the latitude direction, and the longitude coordinate density value is used to describe the density of all the initial disturbance coordinates in the longitude direction;
[0008] All initial disturbance coordinates are adjusted according to the disturbance level to obtain multiple final disturbance coordinates;
[0009] Encrypt each final disturbance coordinate to obtain the encrypted coordinate corresponding to each final disturbance coordinate, and send a parking lot information query request carrying all the encrypted coordinates to the server; the encrypted coordinate carries the information of the query area where the corresponding final disturbance coordinate is located, and the query area is a sub-area in the target area;
[0010] Receive all target parking lot information corresponding to each query area sent by the server; the target parking lot information is obtained by the server after querying the parking lot query tree according to the information of the query area. The multiple nodes of the parking lot query tree correspond to the multiple sub-areas in the target area one by one, and the edge between each two nodes is the affiliation relationship between the corresponding two sub-areas. The attribute of each node is all the parking lot information in the corresponding sub-area.
[0011] Optionally, the actual coordinates of the target query location include latitude coordinates and longitude coordinates;
[0012] The actual coordinates of the target query position are disturbed to obtain multiple initial disturbed coordinates, including:
[0013] Add latitude Gaussian noise to the latitude coordinates of the target query location And add longitude Gaussian noise to the longitude coordinates of the target query location Obtain multiple initial perturbation coordinates;
[0014] in, represents the variance of the latitudinal Gaussian noise, Represents the variance of the longitude Gaussian noise. The number of initial perturbation coordinates is the preset number of perturbation coordinates.
[0015] Optionally, based on all initial disturbance coordinates and the actual coordinates of the target query position, obtain the latitude coordinate density value and the longitude coordinate density value, including:
[0016] By formula:
[0017]
[0018] Calculate the latitude coordinate density value D Lat ;
[0019] Among them, w Lat represents the weight, f Lat,Lng,r represents the area of the region with the actual coordinates of the target query location as the center and a radius of r, PL represents the privacy level, and L Lat Represents the sum of the latitude perturbed coordinates of all initial perturbed coordinates:
[0020]
[0021] L BGC =(L1,L2,...,L n )
[0022] Among them, f Lat () indicates that only the latitude disturbance coordinates are obtained, L BGC represents the set of all initial perturbation coordinates, L1 represents the first initial perturbation coordinate, L1=(LLat,1 ,L Lng,1 ), L Lat,1 represents the latitude perturbation coordinate of the first initial perturbation coordinate, L Lng,1 represents the longitude disturbance coordinate of the first initial disturbance coordinate, L2 represents the second initial disturbance coordinate, L2=(L Lat,2 ,L Lng,2 ), L Lat,2 represents the latitude perturbation coordinate of the second initial perturbation coordinate, L Lng,2 represents the longitude perturbation coordinate of the second initial perturbation coordinate, L n represents the nth initial perturbation coordinate, L n =(L Lat,n ,L Lng,n ), L Lat,n represents the latitude perturbation coordinate of the nth initial perturbation coordinate, L Lng,n represents the longitude perturbation coordinate of the nth initial perturbation coordinate;
[0023] By formula:
[0024]
[0025] Calculate the longitude coordinate density value D Lng ;
[0026] Among them, w Lng represents the weight, f Lat,Lng,r represents the area of the region with a radius of r and the actual coordinates of the target query location as the center, L Lng Represents the sum of the longitude perturbed coordinates of all initial perturbed coordinates:
[0027]
[0028] Among them, f Lng () means only longitude disturbance coordinates are obtained.
[0029] Optionally, the disturbance level is obtained based on the latitude coordinate density value and the longitude coordinate density value, including:
[0030] By formula:
[0031]
[0032] Get the disturbance level Dt(D Lat ,D Lng );
[0033] Among them, L d Indicates the lower limit of density, H d Indicates the upper density limit.
[0034] Optionally, all disturbance coordinates are adjusted according to the disturbance level to obtain multiple final disturbance coordinates, including:
[0035] Determine whether the disturbance level reaches a preset level;
[0036] If yes, each perturbed coordinate is taken as a final perturbed coordinate;
[0037] Otherwise, all the perturbed coordinates are discarded, and the actual coordinates of the target query position are perturbed to obtain the steps of multiple initial perturbed coordinates.
[0038] Optionally, query the parking lot query tree based on the query area, including:
[0039] A node corresponding to the query area is obtained in the parking lot query tree, and all parking lot information in the area corresponding to the node is used as target parking lot information.
[0040] Optionally, each final perturbed coordinate is encrypted to obtain an encrypted coordinate corresponding to each final perturbed coordinate, including:
[0041] For each final disturbed coordinate, the information of the sub-region where the final disturbed coordinate is located is obtained, and the sub-region is used as the query region of the final disturbed coordinate. The information of the sub-region is used as the information of the query region, and the information of the query region is encrypted using the public key to obtain the encrypted coordinate corresponding to the final disturbed coordinate.
[0042] In a second aspect, an embodiment of the present application provides a parking lot information query device with privacy protection, including:
[0043] An acquisition module, which acquires the actual coordinates of the target query position in the target area; the target area includes multiple sub-areas;
[0044] The perturbation module perturbs the actual coordinates of the target query position to obtain multiple initial perturbation coordinates;
[0045] The disturbance level acquisition module obtains the latitude coordinate density value and the longitude coordinate density value based on all the initial disturbance coordinates and the actual coordinates of the target query position, and obtains the disturbance level according to the latitude coordinate density value and the longitude coordinate density value; the latitude coordinate density value is used to describe the density of all the initial disturbance coordinates in the latitude direction, and the longitude coordinate density value is used to describe the density of all the initial disturbance coordinates in the longitude direction;
[0046] An adjustment module adjusts all initial disturbance coordinates according to the disturbance level to obtain multiple final disturbance coordinates;
[0047] The encryption module encrypts each final disturbance coordinate, obtains the encrypted coordinate corresponding to each final disturbance coordinate, and sends a parking lot information query request carrying all the encrypted coordinates to the server; the encrypted coordinate carries the information of the query area where the corresponding final disturbance coordinate is located, and the query area is a sub-area in the target area;
[0048] The receiving module receives all target parking lot information corresponding to each query area sent by the server; the target parking lot information is obtained by the server after querying the parking lot query tree according to the information of the query area. The multiple nodes of the parking lot query tree correspond to the multiple sub-areas in the target area one by one, and the edge between each two nodes is the affiliation relationship between the corresponding two sub-areas. The attribute of each node is all the parking lot information in the corresponding sub-area.
[0049] In a third aspect, an embodiment of the present application provides a terminal device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned privacy-protected parking lot information query method when executing the above-mentioned computer program.
[0050] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, which stores a computer program, and when the computer program is executed by a processor, the above-mentioned privacy-protected parking lot information query method is implemented.
[0051] The above solution of the present application has the following beneficial effects:
[0052] In an embodiment of the present application, the actual coordinates of the target query position in the target area are obtained, and then the actual coordinates of the target query position are disturbed to obtain a plurality of initial disturbance coordinates, and then based on all the initial disturbance coordinates and the actual coordinates of the target query position, the latitude coordinate density value and the longitude coordinate density value are obtained, and the disturbance level is obtained according to the latitude coordinate density value and the longitude coordinate density value, and then all the initial disturbance coordinates are adjusted according to the disturbance level to obtain a plurality of final disturbance coordinates, and then each final disturbance coordinate is encrypted to obtain the encrypted coordinates corresponding to each final disturbance coordinate, and a parking lot information query request carrying all the encrypted coordinates is sent to the server, and finally all the target parking lot information corresponding to each query area sent by the server is received. Among them, disturbing the actual coordinates of the target query location can make the initial disturbed coordinates random and achieve protection of the target query location. The latitude coordinate density value and the longitude coordinate density value can describe the density of the coordinates, so that the disturbance level can reflect the randomness of the initial disturbed coordinates and the protection degree of the target query location. Adjusting the initial disturbed coordinates according to the disturbance level can improve the randomness of the disturbed coordinates and make the protection degree of the target query location reach the expected level. At the same time, encrypting the final disturbed coordinates can prevent the final disturbed coordinates from being stolen by an untrusted third party, further improving the privacy of parking information query.
[0053] In addition, by constructing a parking lot query tree to query parking lot information, the corresponding parking lot information can be directly obtained according to the information of the query area, thereby improving the efficiency of parking lot information query.
[0054] Other beneficial effects of the present application will be described in detail in the subsequent specific implementation section. BRIEF DESCRIPTION OF THE DRAWINGS
[0055] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.
[0056] Figure 1 A flowchart of a parking lot information query method with privacy protection provided in one embodiment of the present application;
[0057] Figure 2 A schematic diagram of the structure of a parking lot query tree provided in an embodiment of the present application;
[0058] Figure 3 A schematic diagram of the affiliation relationship between multiple regions provided in one embodiment of the present application;
[0059] Figure 4 A schematic diagram of the structure of a parking lot information query device with privacy protection provided in one embodiment of the present application;
[0060] Figure 5 A schematic diagram of the structure of a terminal device provided in one embodiment of the present application. DETAILED DESCRIPTION
[0061] In the following description, specific details such as specific system structures, technologies, etc. are provided for the purpose of illustration rather than limitation, so as to provide a thorough understanding of the embodiments of the present application. However, it should be clear to those skilled in the art that the present application may also be implemented in other embodiments without these specific details. In other cases, detailed descriptions of well-known systems, devices, circuits, and methods are omitted to prevent unnecessary details from obstructing the description of the present application.
[0062] It should be understood that when used in the present specification and the appended claims, the term "comprising" indicates the presence of described features, wholes, steps, operations, elements and / or components, but does not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or combinations thereof.
[0063] It should also be understood that the term “and / or” used in the specification and appended claims refers to any and all possible combinations of one or more of the associated listed items, and includes these combinations.
[0064] As used in the specification and appended claims of this application, the term "if" can be interpreted as "when" or "uponce" or "in response to determining" or "in response to detecting", depending on the context. Similarly, the phrase "if it is determined" or "if [described condition or event] is detected" can be interpreted as meaning "uponce it is determined" or "in response to determining" or "uponce [described condition or event] is detected" or "in response to detecting [described condition or event]", depending on the context.
[0065] In addition, in the description of the present application specification and the appended claims, the terms "first", "second", "third", etc. are only used to distinguish the descriptions and cannot be understood as indicating or implying relative importance.
[0066] References to "one embodiment" or "some embodiments" etc. described in the specification of this application mean that one or more embodiments of the present application include specific features, structures or characteristics described in conjunction with the embodiment. Therefore, the statements "in one embodiment", "in some embodiments", "in some other embodiments", "in some other embodiments", etc. that appear in different places in this specification do not necessarily refer to the same embodiment, but mean "one or more but not all embodiments", unless otherwise specifically emphasized in other ways. The terms "including", "comprising", "having" and their variations all mean "including but not limited to", unless otherwise specifically emphasized in other ways.
[0067] In response to the problem of low privacy in existing parking lot information queries, an embodiment of the present application provides a privacy-protected parking lot information query method, which obtains the actual coordinates of a target query position in a target area, then perturbs the actual coordinates of the target query position to obtain multiple initial perturbation coordinates, and then obtains latitude coordinate density values and longitude coordinate density values based on all initial perturbation coordinates and the actual coordinates of the target query position, and obtains a disturbance level according to the latitude coordinate density value and the longitude coordinate density value, and then adjusts all initial perturbation coordinates according to the perturbation level to obtain multiple final perturbation coordinates, and then encrypts each final perturbation coordinate to obtain the encrypted coordinates corresponding to each final perturbation coordinate, and sends a parking lot information query request carrying all encrypted coordinates to a server, and finally receives all target parking lot information corresponding to each query area sent by the server. Among them, disturbing the actual coordinates of the target query location can make the initial disturbed coordinates random and achieve protection of the target query location. The latitude coordinate density value and the longitude coordinate density value can describe the density of the coordinates, so that the disturbance level can reflect the randomness of the initial disturbed coordinates and the protection degree of the target query location. Adjusting the initial disturbed coordinates according to the disturbance level can improve the randomness of the disturbed coordinates and make the protection degree of the target query location reach the expected level. At the same time, encrypting the final disturbed coordinates can prevent the final disturbed coordinates from being stolen by an untrusted third party, further improving the privacy of parking information query.
[0068] In addition, by constructing a parking lot query tree to query parking lot information, the corresponding parking lot information can be directly obtained according to the query area, thereby improving the efficiency of parking lot information query.
[0069] Next, an exemplary description is given of the privacy-protected parking lot information query method provided in this application.
[0070] like Figure 1 As shown, the privacy-protected parking lot information query method provided by this application includes the following steps:
[0071] Step 11, obtaining the actual coordinates of the target query position in the target area.
[0072] It should be noted that the above-mentioned target area is an area where parking information query is required, which can be an area in a province or a city. The above-mentioned target query location is the location where the user requests to query parking information. The above-mentioned actual coordinates are the latitude and longitude coordinates in the earth coordinate system. The actual coordinates of the target query location include latitude coordinates and longitude coordinates. The target area includes multiple sub-areas. For example, if the target area belongs to a certain urban area, then a large area of 50 kilometers (KM) × 50KM is divided with the center point of the urban area as the center (the scale is set according to the actual size of the urban area to cover as much of the urban area as possible) as the target area, and then the target area is evenly divided into grid areas at a scale of 10KM, and each grid area is used as a middle area, and then each middle area is evenly divided into small grid areas at a scale of 1KM, and each small grid area is used as a small area. Each of the above-mentioned middle areas and each small area is a sub-area of the target area.
[0073] In some embodiments of the present application, the actual coordinates of the target query location can be obtained using a positioning system such as a global positioning system and a Beidou system. After obtaining the actual coordinates, the actual coordinates can be converted using the Beidou grid coding rules to utilize the enhanced positioning capability of the Beidou system, enhance the accuracy of the actual coordinates and achieve preliminary privacy protection. The converted actual coordinates can use a latitude and longitude coordinate to describe the location of a grid, and the converted actual coordinates are used as the actual coordinates of the target query location to participate in the calculation of subsequent steps.
[0074] Step 12: perturb the actual coordinates of the target query position to obtain a plurality of initial perturbed coordinates.
[0075] Specifically, add latitude Gaussian noise to the latitude coordinates of the target query location And add longitude Gaussian noise to the longitude coordinates of the target query location Get multiple initial perturbation coordinates.
[0076] in, represents the variance of the latitudinal Gaussian noise, Represents the variance of the longitude Gaussian noise. The number of initial perturbation coordinates is the preset number of perturbation coordinates.
[0077] It should be noted that the preset number of disturbance coordinates is set by the user who initiates the parking lot information query request, and may be related to the preset level of the disturbance level. For example, if the preset level is low, the preset number of disturbance coordinates is 4, if the preset level is medium, the preset number of disturbance coordinates is 6, and if the preset level is high, the preset number of disturbance coordinates is 8. According to the preset number of disturbance coordinates, multiple initial disturbance coordinates are regularly generated using Gaussian noise, and each initial disturbance coordinate is converted using the Beidou grid coding rule.
[0078] Exemplarily, computer software such as MATLAB may be used to perturb the actual coordinates to obtain a plurality of initial perturbed coordinates.
[0079] It is worth mentioning that Gaussian noise is random. Using Gaussian noise to perturb the actual coordinates of the target query position can make the initial perturbation coordinates random, thereby protecting the target query position.
[0080] Step 13, based on all the initial disturbance coordinates and the actual coordinates of the target query position, obtain the latitude coordinate density value and the longitude coordinate density value, and obtain the disturbance level according to the latitude coordinate density value and the longitude coordinate density value.
[0081] The above latitude coordinate density value is used to describe the density of all initial perturbation coordinates in the latitude direction, and the longitude coordinate density value is used to describe the density of all initial perturbation coordinates in the longitude direction.
[0082] In some embodiments of the present application, the steps of obtaining the latitude coordinate density value and the longitude coordinate density value based on all the initial disturbance coordinates and the actual coordinates of the target query position, and obtaining the disturbance level according to the latitude coordinate density value and the longitude coordinate density value are specifically as follows:
[0083] In the first step, based on all the initial disturbance coordinates and the actual coordinates of the target query position, the latitude coordinate density value and the longitude coordinate density value are obtained.
[0084] Specifically, through the formula:
[0085]
[0086] Calculate the latitude coordinate density value D Lat .
[0087] Among them, w Lat represents the weight, f Lat,Lng,r represents the area of the region with the actual coordinates of the target query location as the center and a radius of r, P L Indicates the privacy level, L Lat Represents the sum of the latitude perturbed coordinates of all initial perturbed coordinates:
[0088]
[0089] L BGC =(L1,L2,...,L n )
[0090] Among them, f Lat () indicates that only the latitude disturbance coordinates are obtained, L BGG represents the set of all initial perturbation coordinates, L1 represents the first initial perturbation coordinate, L1=(L Lat,1 ,L Lng,1 ), L Lat,1 represents the latitude perturbation coordinate of the first initial perturbation coordinate, L Lng,1 represents the longitude disturbance coordinate of the first initial disturbance coordinate, L2 represents the second initial disturbance coordinate, L2=(L Lat,2 ,L Lng,2 ), L Lat,2 represents the latitude perturbation coordinate of the second initial perturbation coordinate, L Lng,2 represents the longitude perturbation coordinate of the second initial perturbation coordinate, L n represents the nth initial perturbation coordinate, L n =(L Lat,n ,L Lng,n ), L Lat,n represents the latitude perturbation coordinate of the nth initial perturbation coordinate, L Lng,n represents the longitude perturbation coordinate of the nth initial perturbation coordinate.
[0091] By formula:
[0092]
[0093] Calculate the longitude coordinate density value D Lng .
[0094] Among them, w Lng represents the weight, f Lat,Lng,r represents the area of the region with a radius of r and the actual coordinates of the target query location as the center, L Lng Represents the sum of the longitude perturbed coordinates of all initial perturbed coordinates:
[0095]
[0096] Among them, f Lng () means only longitude disturbance coordinates are obtained.
[0097] The second step is to obtain the disturbance level based on the latitude coordinate density value and the longitude coordinate density value.
[0098] Specifically, through the formula:
[0099]
[0100] Get the disturbance level Dt(D Lat ,D Lng ).
[0101] Among them, L d Indicates the lower limit of density, H d Indicates the upper density limit.
[0102] For example, the lower density limit is 4, the upper density limit is 13, the latitude coordinate density value is 6, which is greater than the lower density limit, and the longitude coordinate density value is 8, which is less than the upper density limit. The disturbance level is medium, indicating that the disturbance level and protection level of the target query location are medium at this time.
[0103] Exemplarily, the above steps can be implemented by constructing and running a disturbance level pseudo code, where the disturbance level pseudo code is:
[0104] Input: User u i The grid to be blurred (i.e. the actual coordinates of the target query position above) i represents the i-th user, with the preset level PrivacyLevel;
[0105] Output: Determine whether the fuzzy grid meets the disturbance level;
[0106] 1. / / All latitude coordinates in the grid;
[0107] 2. / / All longitude coordinates in the grid;
[0108] / / f Lat,Lng,r is the area of the region with a radius of r near the actual coordinates;
[0109] 3.
[0110] / / Separate sets and Conduct density determination;
[0111] 4.If(D Lat <L d &&D Lng <L d )&&PL==low;
[0112] 5.return true;
[0113] 6.else if(L d <D Lat &&D Lng <H d )&&PL==medium;
[0114] 7.returntrue;
[0115] 8.else(D Lat &&D Lng ≥H d )&&PL==medium;
[0116] 9.return true;
[0117] return false.
[0118] Among them, PID 1 Represents user u i The first initial disturbance coordinate, PID 2 Represents user u i The second initial perturbation coordinates, PID n Represents user u i The nth initial perturbation coordinate of .
[0119] It is worth mentioning that the latitude coordinate density value and the longitude coordinate density value can describe the density of the coordinates, so that the disturbance level can reflect the randomness of the initial disturbance coordinates and the degree of protection of the target query location.
[0120] Step 14: adjust all initial disturbance coordinates according to the disturbance level to obtain a plurality of final disturbance coordinates.
[0121] Specifically, it is determined whether the disturbance level reaches a preset level.
[0122] If so, each perturbed coordinate is taken as a final perturbed coordinate.
[0123] Otherwise, all the perturbed coordinates are discarded, and the actual coordinates of the target query position are perturbed to obtain the steps of multiple initial perturbed coordinates.
[0124] It should be noted that due to the randomness of Gaussian noise, when the actual coordinates of the target query position are disturbed again, the multiple disturbed coordinates obtained are different from the multiple disturbed coordinates that have been discarded. The preset level is set by the user who requests to query the parking lot information.
[0125] Exemplarily, the preset level is high and the disturbance level is medium. If the preset level is not reached, it means that the protection level does not meet the user's expectations. In this case, all disturbed coordinates are discarded, and the actual coordinates of the target query position are disturbed again. The disturbance level at this time is calculated to be high, which reaches the preset level, indicating that the protection level at this time meets the user's expectations. In this case, each disturbed coordinate is used as a final disturbed coordinate.
[0126] It is worth mentioning that adjusting the initial disturbance coordinates according to the disturbance level can improve the randomness of the disturbance coordinates and achieve the expected degree of protection for the target query location.
[0127] Step 15: encrypt each final disturbed coordinate to obtain the encrypted coordinate corresponding to each final disturbed coordinate, and send a parking lot information query request carrying all the encrypted coordinates to the server.
[0128] The encrypted coordinates carry information about the query area where the corresponding final disturbance coordinates are located. The query area is a sub-area in the target area. The information about the query area may be an identifier, a name, etc. of the query area.
[0129] Specifically, for each final disturbed coordinate, the information of the sub-region where the final disturbed coordinate is located is obtained, and the sub-region is used as the query region of the final disturbed coordinate, and the information of the sub-region is used as the information of the query region, and the information of the query region is encrypted using the public key to obtain the encrypted coordinate corresponding to the final disturbed coordinate.
[0130] It should be noted that the above public key is pre-distributed to the client (i.e., the device end that executes the parking lot information query method provided by this application) and is used to match the private key of the server (i.e., the device end that receives the parking lot query request, obtains and sends the target parking lot information). The parking lot information query request also includes the public key. When encrypting the final perturbed coordinates, an encryption algorithm such as an information digest algorithm can be used for encryption.
[0131] Exemplarily, the information of the query area where the final disturbance coordinates are located can be obtained by using a geographic information system. If the first final disturbance coordinate is in small area A, the information of the query area of the first final disturbance coordinate is "small area A". "Small area A" is encrypted to obtain the encrypted coordinates L = {0, 0, ..., 0, 1, 0, small area A}, where 1 is a specific query value, which is used to indicate the information of the query area, such as the specific query value of "small area A" is 1, and the specific query value of "small area B" is 2.
[0132] Exemplarily, the above steps can be implemented by constructing and running an encrypted pseudo code, the encrypted pseudo code is:
[0133] Input: target query location L = (lat, lng), PrivacyLevel;
[0134] Output: Result;
[0135] 1. Public key h PK 、Private key h SK / / The client generates a public key h PK 、Private key h SK ;
[0136] 2.L Info =gridCode(L) / / Convert L using grid coding
[0137] / / Get the blurred L' BGC ={L 1 ,L 2 ,...,L n};
[0138] 3.L * =isValid(L Info ,PrivacyLevel);
[0139] 4.Q=encode(L * ) / / Use public key to encrypt;
[0140] 5.Send(Q,h PK ) / / Q and public key are sent to the server;
[0141] 6. The client obtains the response from the server and decrypts it to obtain the parking lot information P = {S, T, ..., α, β}.
[0142] Among them, lat represents the latitude coordinate, lng represents the longitude coordinate, PrivacyLevel represents the preset level, L' BGC represents the initial perturbation coordinate set of the target query position, L 1 represents the first initial perturbation coordinate, L 2 represents the second initial perturbation coordinate, L n represents the nth initial perturbation coordinate, L * represents the final set of disturbance coordinates, isValid() represents all formulas for calculating the disturbance level, L Info It represents the actual coordinates after Beidou grid encoding, Q represents all encrypted coordinates, encode() represents the encryption algorithm, and S, T, α, and β all represent the information of a single parking lot.
[0143] It is worth mentioning that encrypting the final disturbance coordinates can prevent the final disturbance coordinates from being stolen by an untrusted third party, further improving the privacy of parking lot information query.
[0144] Step 16: Receive all target parking lot information corresponding to each query area sent by the server.
[0145] The target parking lot information is obtained by the server after querying the parking lot query tree based on the information of the query area. The multiple nodes of the parking lot query tree correspond to the multiple sub-areas in the target area. The edge between each two nodes is the affiliation between the corresponding two sub-areas. The attribute of each node is all the parking lot information in the corresponding sub-area. The parking lot information can be the actual information of the parking lot, such as the empty parking space information, the charging pile information in use, the unused charging pile information, etc.
[0146] In some embodiments of the present application, after the server receives the parking lot information query request sent by the client, the server matches the public key with the private key in the parking lot information query request. If the match is successful, the server is allowed to decrypt. Since the client and the server have pre-agreed on the encryption and decryption methods, when the server decrypts the encrypted coordinates, it uses the algorithm corresponding to the encryption to decrypt the encrypted coordinates.
[0147] Exemplarily, if the query area information carried in the first encrypted coordinate is "small area A", the node corresponding to small area A is selected in the parking lot query tree, and all parking lot information of the node is used as the target parking lot information; if the query area information carried in the second encrypted coordinate is "small area B", the node corresponding to small area B is selected in the parking lot query tree, and all parking lot information of the node is used as the target parking lot information. The server sends all target parking lot information corresponding to small area A and all target parking lot information corresponding to small area B to the client.
[0148] Exemplarily, the above steps can be implemented by constructing and running a query pseudo code, where the query pseudo code is:
[0149] Input: Q = {L 1* ,L 2* ,...,L n*}, h PK / / The location set queried by the client, (each L 1* is a coordinate (x,y));
[0150] Output: query result matrix R;
[0151] 1.R-Tree=Build-Tree(D) / / Build R-Tree tree;
[0152] 2. Traverse the set foriin Q;
[0153] 3. Result = Query (R-Tree, Q[i]) / / Use each item of Q to do the vector inner product in R-Tree to get the result;
[0154] 4. Return the result.
[0155] Among them, L 1 Indicates the first encrypted coordinate, L 2 Indicates the second encrypted coordinate, L n represents the nth encrypted coordinate, D represents the parking information of all sub-areas of the target area, and Q[i] represents the set of all query locations.
[0156] It should be noted that when querying the query area, in order to improve query efficiency, the query can be performed based on the affiliation between sub-areas. For example, small area A belongs to middle area A, and middle area A belongs to large area A. When querying in the parking lot query tree, the query is performed in the order of large area A, middle area A, and small area A to quickly locate the node corresponding to small area A.
[0157] The above parking lot query tree is exemplarily described below with reference to a specific example.
[0158] The parking lot query tree is actually an R-tree, which can be constructed by the server using a commonly used R-tree construction method. Figure 2 As shown, the first layer of the parking lot query tree is the large area level (with a scale of 50KM), and the areas corresponding to the nodes include large area A, large area B, etc. The second layer is the medium area (with a scale of 10KM), and the nodes corresponding to large area A are the nodes corresponding to medium area A and other medium areas. The third layer is the small area (with a scale of 1KM), and the nodes corresponding to medium area A are the nodes corresponding to small area A, small area AB, etc. When querying parking lot information, obtain the node corresponding to the query area, and perform vector inner product on the node (the inner product is to multiply and add each item of the two arrays, for example, array 1 = [1,2,3], array 2 = [4,5,6], inner product = 1*4+2*5+3*6, the array is all the target parking lot information corresponding to the query area above, and the values in the array are used to refer to each corresponding target parking lot information) to obtain the target parking lot information.
[0159] The edges of the parking lot query tree, i.e., the affiliation between multiple areas of the target area, are as follows Figure 3 As shown, the xx large area includes the xx medium area and area R1, and the xx medium area includes the small area Domain A , Community Domain B , area R2, area R1 includes area R3 and area R4, cell Domain A The area R10, R9 and R8 are included in the area R2, and the area R5 and R6 are included in the area R2. Domain BThe area R13 and the area R14 are included in the area R3, the area R7 and the area R8 are included in the area R4, the area R9 and a parking lot are included in the area R4. Figure 3 The middle rectangular box indicates the corresponding area.
[0160] It is worth mentioning that constructing a parking lot query tree for parking lot information query can directly obtain the corresponding parking lot information according to the query area, thereby improving the efficiency of parking lot information query.
[0161] The following is an exemplary description of the privacy-protected parking lot information query device provided by the present application.
[0162] like Figure 4 As shown, the embodiment of the present application provides a parking lot information query device with privacy protection, and the parking lot information query device 400 includes:
[0163] Acquisition module 401, acquiring actual coordinates of a target query position in a target area; the target area includes multiple sub-areas;
[0164] A disturbance module 402 disturbs the actual coordinates of the target query position to obtain a plurality of initial disturbance coordinates;
[0165] The disturbance level acquisition module 403 acquires the latitude coordinate density value and the longitude coordinate density value based on all the initial disturbance coordinates and the actual coordinates of the target query position, and acquires the disturbance level according to the latitude coordinate density value and the longitude coordinate density value; the latitude coordinate density value is used to describe the density of all the initial disturbance coordinates in the latitude direction, and the longitude coordinate density value is used to describe the density of all the initial disturbance coordinates in the longitude direction;
[0166] An adjustment module 404 adjusts all initial disturbance coordinates according to the disturbance level to obtain a plurality of final disturbance coordinates;
[0167] The encryption module 405 encrypts each final disturbance coordinate to obtain the encrypted coordinate corresponding to each final disturbance coordinate, and sends a parking lot information query request carrying all the encrypted coordinates to the server; the encrypted coordinate carries the information of the query area where the corresponding final disturbance coordinate is located, and the query area is a sub-area in the target area;
[0168] The receiving module 406 receives all target parking lot information corresponding to each query area sent by the server; the target parking lot information is obtained by the server after querying the parking lot query tree according to the information of the query area. The multiple nodes of the parking lot query tree correspond to the multiple sub-areas in the target area one by one, and the edge between each two nodes is the affiliation relationship between the corresponding two sub-areas. The attribute of each node is all the parking lot information in the corresponding sub-area.
[0169] It should be noted that the information interaction, execution process, etc. between the above-mentioned devices / units are based on the same concept as the method embodiment of the present application. Their specific functions and technical effects can be found in the method embodiment part and will not be repeated here.
[0170] The technicians in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional units and modules is used as an example for illustration. In practical applications, the above-mentioned function allocation can be completed by different functional units and modules as needed, that is, the internal structure of the device can be divided into different functional units or modules to complete all or part of the functions described above. The functional units and modules in the embodiment can be integrated in a processing unit, or each unit can exist physically separately, or two or more units can be integrated in one unit. The above-mentioned integrated unit can be implemented in the form of hardware or in the form of software functional units. In addition, the specific names of the functional units and modules are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of this application. The specific working process of the units and modules in the above-mentioned system can refer to the corresponding process in the aforementioned method embodiment, which will not be repeated here.
[0171] like Figure 5 As shown, an embodiment of the present application provides a terminal device. The terminal device D10 of this embodiment includes: at least one processor D100 ( Figure 5 Only one processor is shown in the figure), a memory D101, and a computer program D102 stored in the memory D101 and executable on the at least one processor D100, wherein the processor D100 implements the steps of any of the above-mentioned method embodiments when executing the computer program D102.
[0172] Specifically, when the processor D100 executes the computer program D102, it obtains the actual coordinates of the target query position in the target area, and then disturbs the actual coordinates of the target query position to obtain multiple initial disturbance coordinates, and then obtains the latitude coordinate density value and the longitude coordinate density value based on all the initial disturbance coordinates and the actual coordinates of the target query position, and obtains the disturbance level according to the latitude coordinate density value and the longitude coordinate density value, and then adjusts all the initial disturbance coordinates according to the disturbance level to obtain multiple final disturbance coordinates, and then encrypts each final disturbance coordinate to obtain the encrypted coordinates corresponding to each final disturbance coordinate, and sends a parking lot information query request carrying all encrypted coordinates to the server, and finally receives all target parking lot information corresponding to each query area sent by the server. Among them, disturbing the actual coordinates of the target query location can make the initial disturbed coordinates random and achieve protection of the target query location. The latitude coordinate density value and the longitude coordinate density value can describe the density of the coordinates, so that the disturbance level can reflect the randomness of the initial disturbed coordinates and the protection degree of the target query location. Adjusting the initial disturbed coordinates according to the disturbance level can improve the randomness of the disturbed coordinates and make the protection degree of the target query location reach the expected level. At the same time, encrypting the final disturbed coordinates can prevent the final disturbed coordinates from being stolen by an untrusted third party, further improving the privacy of parking information query.
[0173] In addition, by constructing a parking lot query tree to query parking lot information, the corresponding parking lot information can be directly obtained according to the query area, thereby improving the efficiency of parking lot information query.
[0174] The processor D100 may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor, etc.
[0175] In some embodiments, the memory D101 may be an internal storage unit of the terminal device D10, such as a hard disk or memory of the terminal device D10. In other embodiments, the memory D101 may also be an external storage device of the terminal device D10, such as a plug-in hard disk, a smart memory card (SMC, SmartMedia Card), a secure digital (SD, Secure Digital) card, a flash card (Flash Card), etc. equipped on the terminal device D10. Further, the memory D101 may also include both an internal storage unit of the terminal device D10 and an external storage device. The memory D101 is used to store an operating system, an application program, a boot loader (BootLoader), data and other programs, such as the program code of the computer program, etc. The memory D101 may also be used to temporarily store data that has been output or is to be output.
[0176] An embodiment of the present application further provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps in the above-mentioned method embodiments can be implemented.
[0177] An embodiment of the present application provides a computer program product. When the computer program product runs on a terminal device, the terminal device can implement the steps in the above-mentioned method embodiments when executing the computer program product.
[0178] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the present application implements all or part of the processes in the above-mentioned embodiment method, which can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a computer-readable storage medium. When the computer program is executed by the processor, the steps of the above-mentioned various method embodiments can be implemented. Among them, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium may at least include: any entity or device, recording medium, computer memory, read-only memory (ROM, Read-Only Memory), random access memory (RAM, RandomAccess Memory), electric carrier signal, telecommunication signal and software distribution medium that can carry the computer program code to the privacy-protected parking information query method device / terminal device. For example, a USB flash drive, a mobile hard disk, a magnetic disk or an optical disk. In some jurisdictions, according to legislation and patent practice, computer-readable media cannot be electric carrier signals and telecommunication signals.
[0179] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described or recorded in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.
[0180] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.
[0181] The above is a preferred embodiment of the present application. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles described in the present application. These improvements and modifications should also be regarded as the scope of protection of the present application.
Claims
1. A parking lot information query method with privacy protection, characterized in that: include: Acquire the actual coordinates of the target query position in the target area; the target area includes multiple sub-areas; Perturbing the actual coordinates of the target query position to obtain a plurality of initial perturbed coordinates; Based on all the initial disturbance coordinates and the actual coordinates of the target query position, a latitude coordinate density value and a longitude coordinate density value are obtained, and a disturbance level is obtained according to the latitude coordinate density value and the longitude coordinate density value; the latitude coordinate density value is used to describe the density of all the initial disturbance coordinates in the latitude direction, and the longitude coordinate density value is used to describe the density of all the initial disturbance coordinates in the longitude direction; Adjusting all initial disturbance coordinates according to the disturbance level to obtain a plurality of final disturbance coordinates; Encrypt each final disturbance coordinate to obtain the encrypted coordinate corresponding to each final disturbance coordinate, and send a parking lot information query request carrying all the encrypted coordinates to the server; the encrypted coordinate carries the information of the query area where the corresponding final disturbance coordinate is located, and the query area is a sub-area in the target area; Receive all target parking lot information corresponding to each query area sent by the server; The target parking lot information is obtained by the server after querying the parking lot query tree according to the information of the query area. The multiple nodes of the parking lot query tree correspond to the multiple sub-areas one by one, the edge between each two nodes is the affiliation relationship between the corresponding two sub-areas, and the attribute of each node is all the parking lot information in the corresponding sub-area.
2. The parking lot information query method according to claim 1, characterized in that: The actual coordinates of the target query location include latitude coordinates and longitude coordinates; The actual coordinates of the target query position are disturbed to obtain a plurality of initial disturbed coordinates, including: Add latitude Gaussian noise to the latitude coordinates of the target query location And add longitude Gaussian noise to the longitude coordinates of the target query location Obtain multiple initial perturbation coordinates; in, represents the variance of the latitude Gaussian noise, represents the variance of the longitude Gaussian noise, and the number of the initial disturbance coordinates is a preset disturbance coordinate number.
3. The parking lot information query method according to claim 2, characterized in that: The obtaining of the latitude coordinate density value and the longitude coordinate density value based on all the initial disturbance coordinates and the actual coordinates of the target query position includes: By formula: Calculate the latitude coordinate density value D Lat ; Among them, w Lat represents the weight, f Lat,Lng,r represents the area of the region with the actual coordinates of the target query location as the center and a radius of r, PL represents the privacy level, and L Lat Represents the sum of the latitude perturbation coordinates of all the initial perturbation coordinates: L BGC (L1,L2,...,L) n ) Among them, f Lat () indicates that only the latitude disturbance coordinates are obtained, L BGC represents the set of all initial perturbation coordinates, L1 represents the first initial perturbation coordinate, L1=(L Lat,1 ,L Lng,1 ), L Lat,1 represents the latitude disturbance coordinate of the first initial disturbance coordinate, L Lng,1 represents the longitude disturbance coordinate of the first initial disturbance coordinate, L2 represents the second initial disturbance coordinate, L2=(L Lat,2 ,L Lng,2 ), L Lat,2 represents the latitude disturbance coordinate of the second initial disturbance coordinate, L Lng,2 represents the longitude disturbance coordinate of the second initial disturbance coordinate, L n represents the nth initial perturbation coordinate, L n =(L Lat,n ,L Lng,n ), L Lat,n represents the latitude perturbation coordinate of the nth initial perturbation coordinate, L Lng,n represents the longitude disturbance coordinate of the nth initial disturbance coordinate; By formula: Calculate the longitude coordinate density value D Lng ; Among them, w Lng represents the weight, f Lat,Lng,r represents the area of the region with the actual coordinates of the target query location as the center and a radius of r, L Lng Represents the sum of the longitude perturbation coordinates of all the initial perturbation coordinates: Among them, f Lng () means only longitude disturbance coordinates are obtained.
4. The parking lot information query method according to claim 3, characterized in that: The obtaining of the disturbance level according to the latitude coordinate density value and the longitude coordinate density value includes: By formula: Get the disturbance level Dt(D Lat ,D Lng ); Among them, L d Indicates the lower limit of density, H d Indicates the upper density limit.
5. The parking lot information query method according to claim 1, characterized in that: The step of adjusting all disturbance coordinates according to the disturbance level to obtain a plurality of final disturbance coordinates includes: Determining whether the disturbance level reaches a preset level; If yes, each perturbed coordinate is taken as a final perturbed coordinate; Otherwise, all the disturbed coordinates are discarded, and the process returns to the step of disturbing the actual coordinates of the target query position to obtain a plurality of initial disturbed coordinates.
6. The parking lot information query method according to claim 1, characterized in that: The querying in the parking lot query tree according to the query area includes: A node corresponding to the query area is obtained in the parking lot query tree, and all parking lot information in the area corresponding to the node is used as target parking lot information.
7. The parking lot information query method according to claim 1, characterized in that: The step of encrypting each final disturbed coordinate to obtain an encrypted coordinate corresponding to each final disturbed coordinate includes: For each of the final disturbed coordinates, the information of the sub-area where the final disturbed coordinate is located is obtained, and the sub-area is used as the query area of the final disturbed coordinate, the information of the sub-area is used as the information of the query area, and the information of the query area is encrypted using a public key to obtain the encrypted coordinates corresponding to the final disturbed coordinates.
8. A parking lot information query device with privacy protection, characterized in that: include: An acquisition module, which acquires the actual coordinates of the target query position in the target area; the target area includes multiple sub-areas; A disturbance module is used to disturb the actual coordinates of the target query position to obtain a plurality of initial disturbance coordinates; A disturbance level acquisition module, based on all initial disturbance coordinates and the actual coordinates of the target query position, acquires a latitude coordinate density value and a longitude coordinate density value, and acquires a disturbance level according to the latitude coordinate density value and the longitude coordinate density value; the latitude coordinate density value is used to describe the density of all initial disturbance coordinates in the latitude direction, and the longitude coordinate density value is used to describe the density of all initial disturbance coordinates in the longitude direction; An adjustment module adjusts all initial disturbance coordinates according to the disturbance level to obtain a plurality of final disturbance coordinates; The encryption module encrypts each final disturbance coordinate to obtain the encrypted coordinate corresponding to each final disturbance coordinate, and sends a parking lot information query request carrying all the encrypted coordinates to the server; the encrypted coordinate carries the information of the query area where the corresponding final disturbance coordinate is located, and the query area is a sub-area in the target area; A receiving module receives all target parking lot information corresponding to each query area sent by the server; The target parking lot information is obtained by the server after querying the parking lot query tree according to the information of the query area. The multiple nodes of the parking lot query tree correspond to the multiple sub-areas one by one, the edge between each two nodes is the affiliation relationship between the corresponding two sub-areas, and the attribute of each node is all the parking lot information in the corresponding sub-area.
9. A terminal device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the parking lot information query method with privacy protection as described in any one of claims 1 to 7 is implemented.
10. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the parking lot information query method with privacy protection as described in any one of claims 1 to 7 is implemented.