A data processing method, device and medium for updating a mobile terminal ID
By generating a random-length associated ID and a mobile terminal ID that combines the version number and validity period, the problem of easy tracking and forgery of existing device identifiers is solved, achieving secure and unified device ID management and reducing enterprise costs.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- TEER ZHUOXIN TECH (BEIJING) CO LTD
- Filing Date
- 2022-10-21
- Publication Date
- 2026-06-26
Smart Images

Figure CN115422553B_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of communication technology, and specifically to a data processing method, device, and medium for updating mobile terminal IDs. Background Technology
[0002] The existing device identification designs are flawed, making them easy targets for long-term tracking of personal information without considering personal data protection or obtaining user authorization. Furthermore, these ID designs are easily forged, resulting in a flood of counterfeit traffic on the mobile internet and significantly impacting the healthy development of the industry.
[0003] As the internet environment tightens its scrutiny of application software, it's becoming increasingly difficult for applications to obtain traditional, immutable unique device identifiers, while the acquisition rate of variable advertising identifiers is also declining. Current ID solutions operate independently, lacking a cohesive system and hindering data integration. Preventing fraudulent activity while comprehensively protecting user information places higher demands on enterprise solutions and incurs significant costs. Therefore, a widely accepted, tamper-proof, variable, and unified device ID is essential for the entire industry. Summary of the Invention
[0004] To address the aforementioned technical problems, the present invention adopts the following technical solution: a data processing method for updating a mobile terminal ID, the method comprising the following steps:
[0005] S600. Obtain the original mobile terminal ID list ZZ = {ZZ1, ..., ZZ} λ ..., ZZ u}, among which, ZZ λ It refers to the λth original mobile terminal ID provided by the target device, where λ = 1...u, and u is the number of original mobile terminal IDs provided by the target device;
[0006] S610. Based on ZZ, obtain the intermediate mobile terminal ID list ZZ';
[0007] S620. Obtain the ratio K of the number of intermediate mobile terminal IDs h corresponding to ZZ' and the number of abnormal mobile terminal IDs corresponding to ZZ', where K meets the following condition: K = h0 / h, h0 refers to the number of abnormal mobile terminal IDs corresponding to ZZ';
[0008] S630. When h ≤ the preset threshold h' for the number of mobile terminal IDs or K ≤ the preset ratio threshold K', a prompt message is sent to the target device.
[0009] S640. When h > preset mobile terminal ID quantity threshold h' and K > preset ratio threshold K', obtain the target mobile terminal ID list.
[0010] The present invention also protects a non-transitory computer-readable storage medium storing at least one instruction or at least one program, wherein the at least one instruction or the at least one program is loaded and executed by a processor to implement the above-described data processing method for updating the mobile terminal ID.
[0011] The present invention also protects an electronic device, including a processor and the aforementioned non-transitory computer-readable storage medium.
[0012] Compared with the prior art, the present invention has significant advantages and beneficial effects. Through the above technical solution, the data processing method for updating mobile terminal ID provided by the present invention achieves considerable technical progress and practicality, and has broad application value. It has at least the following advantages:
[0013] This invention obtains an original mobile terminal ID list and, based on that, an intermediate mobile terminal ID list. The ratio of the number of mobile terminal IDs in the intermediate list to the number of abnormal mobile terminal IDs in the intermediate list is compared with its corresponding threshold to determine whether to send a notification to the target device or update the original mobile terminal ID list to the target list. When updating the original mobile terminal ID list, this ensures that the third-party server obtains a many-to-many relationship between the mobile terminal IDs and their corresponding associated IDs. This prevents a third party from obtaining multiple mobile terminal IDs from the same device, which could lead to third-party decryption of the mobile terminal IDs and compromise device security, thereby improving the security of the mobile terminal.
[0014] The above description is merely an overview of the technical solution of the present invention. In order to better understand the technical means of the present invention and to implement it in accordance with the contents of the specification, and to make the above and other objects, features and advantages of the present invention more apparent and understandable, preferred embodiments are described in detail below with reference to the accompanying drawings. Attached Figure Description
[0015] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.
[0016] Figure 1A flowchart illustrating a data processing method for updating a mobile terminal ID, provided in an embodiment of the present invention;
[0017] Figure 2 A flowchart illustrating a data processing method for updating a mobile terminal ID, as provided in another embodiment of the present invention;
[0018] Figure 3 A flowchart illustrating a data processing method for updating a mobile terminal ID, as provided in another embodiment of the present invention;
[0019] Figure 4 A flowchart illustrating a data processing method for updating a mobile terminal ID, as provided in another embodiment of the present invention;
[0020] Figure 5 A flowchart illustrating a data processing method for updating a mobile terminal ID, as provided in another embodiment of the present invention;
[0021] Figure 6 A flowchart of a data processing method for updating a mobile terminal ID, provided in another embodiment of the present invention. Detailed Implementation
[0022] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.
[0023] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of the invention described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or server that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or devices.
[0024] like Figure 1 As shown in the figure, this embodiment of the invention provides a data processing method for obtaining a mobile terminal ID, the method comprising the following steps:
[0025] S100. Obtain the first fingerprint list A = {A1, ..., A...} i , ..., Am}, A i It refers to the i-th first fingerprint, i = 1...m, where m is the number of first fingerprints.
[0026] Specifically, the following steps are included before step S100:
[0027] S1. Obtain the preset fingerprint configuration list T = {T1, ..., T2}. j , ..., T M}, where T j It refers to the j-th fingerprint type corresponding to the mobile terminal, where j = 1...M, and M is the preset number of features for the fingerprint type.
[0028] Furthermore, the method also obtains T through the following steps:
[0029] S11. Obtain the original fingerprint list V = {V1, ..., V...} r , ..., V s}, V r =(V r1 V r2 V r3 V r1 V refers to the first degree value of the r-th original fingerprint. r2 V refers to the second degree value of the r-th original fingerprint. r3 It refers to the third degree value of the r-th original fingerprint, where r = 1...s, and s is the number of original fingerprints.
[0030] Furthermore, the first degree value characterizes the degree of uniqueness of the original fingerprint, which can be understood as uniqueness. Those skilled in the art know that uniqueness can be obtained by any method in the prior art, and will not be elaborated here.
[0031] Furthermore, the second degree value characterizes the stability of the original fingerprint, which can be understood as stability. Those skilled in the art know that stability can be obtained by any method in the prior art, and will not be elaborated here.
[0032] Furthermore, the third degree value characterizes the saturation of the original fingerprint. Those skilled in the art know that saturation can be obtained by any method in the prior art, and will not be elaborated here.
[0033] S12, Traversing V r And when V r1 >First-level threshold V 1 0, V r2 >Second-degree threshold V 2 0 and V r3 >Third-degree threshold V 3 At 0, V r The corresponding fingerprint type of the original fingerprint is inserted into T.
[0034] Specifically, the original fingerprint refers to a fingerprint that cannot reflect the identity of the mobile terminal.
[0035] Specifically, V 1 0 is the threshold for uniqueness. Those skilled in the art can set the threshold for uniqueness according to actual needs, which will not be elaborated here.
[0036] Specifically, V 2 0 represents the stability threshold. Those skilled in the art can set the stability threshold according to actual needs, which will not be elaborated here.
[0037] Specifically, V 3 0 represents the saturation threshold. Those skilled in the art can set the saturation threshold according to actual needs, which will not be elaborated here.
[0038] Furthermore, m ≤ M, preferably m = M = 10.
[0039] S3. Obtain the initial fingerprint A′ = {A′1, ..., A′} x , ..., A′ z}, where A′ x It refers to the x-th initial fingerprint, where x = 1...z, and z is the number of initial fingerprints.
[0040] Specifically, the initial fingerprint refers to the original fingerprint corresponding to the mobile terminal with the target application software installed. The initial fingerprint is an anonymous fingerprint. Those skilled in the art know that any method in the prior art can be used to obtain an anonymous fingerprint, which will not be elaborated here. The use of anonymous fingerprints can avoid the leakage of terminal information and improve the security of the mobile terminal.
[0041] Furthermore, those skilled in the art will select application software as the target application software according to their needs, which will not be elaborated here.
[0042] S5. When the mobile terminal is authorized and uploads its fingerprint for the first time, when A′ x Corresponding fingerprint type and T j When they match, A′ x As the first fingerprint.
[0043] The above steps S1-S3 can select fingerprints suitable for determining similarity, which is beneficial for accurately determining similarity.
[0044] S120. Obtain the second fingerprint list B = {B1, ..., B...} i , ..., B m}, B i It refers to the i-th second fingerprint.
[0045] Specifically, the first associated ID refers to the associated ID generated when the mobile terminal uploads its fingerprint for the first time. The associated ID is an identity identifier associated with the mobile terminal ID. Furthermore, the associated ID is a randomly generated string of a preset length. Those skilled in the art know that the preset length of the string can be set according to requirements, which will not be elaborated here.
[0046] Specifically, the second fingerprint refers to the original fingerprint of the mobile terminal with the target application software installed at a time other than the first time point, wherein the non-first time point refers to any time point other than the time point corresponding to the first fingerprint.
[0047] S140. Obtain the second application software ID. If the second associated ID corresponding to the second application software ID is not null, use the second terminal ID as the target terminal ID. Here, the second terminal ID refers to the identity identifier of the mobile terminal corresponding to the second associated ID.
[0048] S160. When the second associated ID corresponding to the second application software ID is null, obtain the target terminal ID based on A and B.
[0049] Specifically, step S160 includes the following steps:
[0050] S1601. Obtain the first terminal ID corresponding to the first associated ID.
[0051] Specifically, the first terminal ID represents the unique identity of the mobile terminal corresponding to the first associated ID.
[0052] S1602, when any B i ≠A i At that time, obtain the number of first intermediate fingerprints n and the number of second intermediate fingerprints N.
[0053] Furthermore, the first intermediate fingerprint refers to B in B. i ≠A i The second fingerprint.
[0054] Furthermore, the second intermediate fingerprint refers to any second fingerprint in B other than the first intermediate fingerprint.
[0055] Furthermore, n + N = m.
[0056] S1603. Based on m, n, and N, obtain the first similarity F. 1 0, where F 1 0 meets the following conditions:
[0057]
[0058] S1604, when F1 If 0 > the first similarity threshold F0, the first terminal ID is used as the target terminal ID, so that the target terminal ID is sent to the mobile terminal corresponding to B.
[0059] S1605, when F 1 If 0 ≤ F0, regenerate the third association ID and use the third terminal ID corresponding to the third association ID as the target terminal ID, so that the target terminal ID is sent to the mobile terminal corresponding to B; further understanding: when F 1 When 0 > F0, it indicates that the first fingerprint list and the second fingerprint list are highly similar, and can be identified as belonging to the same mobile terminal. The first terminal ID is then sent to the corresponding mobile terminal as the target terminal ID. When F... 1 If 0 ≤ F0, it means that the first fingerprint list and the second fingerprint list are not very similar, and it can be determined that they are not the same mobile terminal. A third terminal ID can be regenerated and sent to the corresponding mobile terminal.
[0060] Alternatively, in a specific embodiment, step S160 includes the following steps:
[0061] S1601. Obtain the first terminal ID corresponding to the first associated ID.
[0062] S1602, when any B i ≠A i At that time, obtain the number of first intermediate fingerprints n and the number of second intermediate fingerprints N in the second intermediate fingerprint list.
[0063] Furthermore, the first intermediate fingerprint refers to B in B. i ≠A i The second fingerprint.
[0064] Furthermore, the second intermediate fingerprint refers to any second fingerprint in B other than the first intermediate fingerprint.
[0065] Furthermore, n + N = m.
[0066] S1603. Based on A, obtain the first fingerprint count list D = {D1, ..., D2}. t , ..., D k}, D t It refers to the number of fingerprints of the first fingerprint of type t, where t = 1...k, and k is the number of types of the first fingerprint.
[0067] Furthermore, D1 + ... + D t +……+D k =m.
[0068] S1604. Based on all the second intermediate fingerprints, obtain the list of second fingerprint counts D' = {D'1, ..., D''}.t , ..., D' s},D' t This refers to the number of fingerprints in the second intermediate fingerprint of type t.
[0069] Furthermore, D'1+……+D' t +……+D' k =N.
[0070] S1605, according to D t and D' t Obtain the second similarity F 2 0, where F 2 0 meets the following conditions:
[0071] Among them, W t It refers to D t The corresponding weight value.
[0072] S1606, when F 2 When 0 > the second similarity threshold F'0, the first terminal ID is used as the target terminal ID, so that the target terminal ID is sent to the mobile terminal corresponding to B.
[0073] S1607, when F 2 If 0 ≤ F'0, a fourth associated ID is regenerated and the fourth terminal ID corresponding to the fourth associated ID is used as the target terminal ID, so that the target terminal ID is sent to the mobile terminal corresponding to B. Compared with determining whether to regenerate the associated ID through the first similarity, fingerprints are classified and different weights are set according to different fingerprint classifications, so that the similarity between two fingerprint lists can be obtained more accurately, so that the second similarity can be used to accurately determine whether they are the same mobile terminal. When different mobile terminals give new mobile terminal IDs, the security of the device is improved, thereby improving the security of user information.
[0074] Preferably, F'0 = F0.
[0075] In the above embodiments, the similarity between two uploaded fingerprints is obtained through the fingerprint of the mobile terminal to determine whether the fingerprints were uploaded by the same mobile terminal. Then, based on the similarity, it is determined whether to update the mobile terminal ID, thereby improving the security of the mobile terminal.
[0076] like Figure 2 As shown, in one specific embodiment, the method further includes the following steps:
[0077] S200, Get the initial mapping list H0.
[0078] Specifically, the initial mapping list includes either a first mapping list or an intermediate mapping list.
[0079] Furthermore, the first mapping table refers to a list of relationships constructed based on the mapping relationship between each first fingerprint and the first application software ID and the first associated ID, wherein the first application software ID refers to the identifier used to characterize the identity of the target application software when the mobile terminal uploads the fingerprint for the first time.
[0080] Further, the intermediate mapping list refers to the mapping table obtained by processing the first mapping table. The update steps for the first mapping table can be referred to as S210-S270. Further understanding: all first fingerprints in the first mapping table are matched with a first associated ID. After steps S210-S270, any fingerprint in the intermediate mapping list can be matched with several associated IDs. Further, before step S200, if the number of associated IDs corresponding to any fingerprint in the intermediate mapping list exceeds a preset threshold for the number of associated IDs, then the fingerprint in the intermediate mapping list is considered an abnormal fingerprint, and H0 is constructed after deleting the abnormal fingerprint. Preferably, those skilled in the art can set the preset threshold for the number of associated IDs according to actual needs, which will not be elaborated here.
[0081] As mentioned above, there are no abnormal fingerprints in H0; this avoids the situation where the number of associated IDs corresponding to any fingerprint in the intermediate mapping list is too large, which would cause excessive load and memory consumption during calculation; at the same time, when the number of associated IDs corresponding to any fingerprint in the intermediate mapping list is too large, it means that a large number of mobile devices have this fingerprint, and thus this fingerprint is an abnormal fingerprint and is deleted.
[0082] S210. Obtain the third fingerprint list C = {C1, ..., C2} i , ..., C m}, C i It refers to the i-th current fingerprint, where each of the third fingerprints in C refers to a fingerprint other than the initial mapped fingerprint in H0. The method for obtaining the key fingerprint can refer to the method for obtaining the initial fingerprint, and will not be repeated here.
[0083] S220, when C i If the fingerprint matches any of the initial mapping fingerprints in H0, the initial mapping fingerprint is used as the third intermediate fingerprint and the associated ID corresponding to the third intermediate fingerprint is obtained from H0.
[0084] Specifically, the initial mapping fingerprint refers to the fingerprint in the initial mapping table.
[0085] S230. Deduplicate all associated IDs corresponding to the third intermediate fingerprints to obtain an intermediate associated ID list R = {R1, ..., R2}. q , ..., R p}, Rq It refers to the q-th intermediate association ID, where q = 1...p, and p is the number of intermediate association IDs.
[0086] Specifically, the intermediate association ID refers to the association ID obtained after deduplicating all the association IDs corresponding to the third intermediate fingerprints. Those skilled in the art can adopt any deduplication method in the prior art.
[0087] S240. Based on R and H0, obtain the first intermediate similarity list F = {F1, ..., F2} corresponding to C. q , ..., F p}, where F refers to R q The corresponding first intermediate similarity.
[0088] Specifically, the first intermediate similarity refers to the similarity between the fingerprints corresponding to any intermediate association ID in C and R, wherein the fingerprints corresponding to the intermediate association ID are obtained through the initial mapping table.
[0089] Furthermore, each F q The method for obtaining it can be found in F. 1 The method to obtain 0 or F 2 The method for obtaining 0 will not be elaborated here.
[0090] Preferably, each F in F q The acquisition method is consistent and each F q The method for obtaining it can be found in F. 1 How to obtain 0.
[0091] S250. Traverse F and obtain the maximum similarity from F, so that the maximum similarity is used as the target similarity F'.
[0092] Specifically, the method described in step S250 further includes the following steps:
[0093] S2501. When the number of maximum similarities in F is equal to 1, the maximum similarity is taken as the target similarity F'.
[0094] S2502. When the number of maximum similarities in F is greater than 1, determine the method for obtaining F.
[0095] Specifically, the method of obtaining F refers to each F in F. q The method for obtaining it.
[0096] S2503. Based on the method for obtaining F, obtain the second intermediate similarity list E = {E1, ..., E...} y , ..., E g}, E y It refers to the y-th second intermediate similarity, y = 1...g, where g is the number of second intermediate similarities.
[0097] Furthermore, the second intermediate similarity refers to the similarity obtained using a method different from the method used to obtain F, based on the intermediate association ID corresponding to the maximum similarity in F; for example, when the method for obtaining the first intermediate similarity refers to F... 1 When obtaining the method for 0, the method for obtaining the second intermediate similarity needs to refer to F. 2 How to obtain 0.
[0098] S2504. Traverse E and obtain the maximum similarity from E, and use the maximum similarity as the target similarity F'.
[0099] As mentioned above, when the number of maximum similarities in F is 1, it can be understood that there is only one ID with the highest similarity to the third intermediate fingerprint, and the maximum similarity is taken as the target similarity. When the number of maximum similarities in F is greater than 1, it can be understood that there are multiple IDs with the highest similarity to the third intermediate fingerprint. At this time, another method of obtaining F is used to obtain the maximum similarity F'. At the same time, the maximum similarity obtained by using both methods is more accurate.
[0100] S260. When F' > the preset target similarity threshold, establish each C i The mapping relationship between the intermediate associated IDs corresponding to F' and each C i The mapping relationship between the intermediate associated IDs corresponding to F' is inserted into H0.
[0101] Specifically, the target similarity threshold is either a first similarity threshold or a second similarity threshold. The determination of the target similarity threshold based on the method for obtaining F can be understood as: F q Refer to F 1 When obtaining 0, the target similarity threshold is the first similarity threshold; or, F q Refer to F 2 When obtaining 0, the target similarity threshold is the second similarity threshold.
[0102] S270. When F' ≤ the preset target similarity threshold, regenerate the association ID and use the regenerated association ID as the specified association ID, and establish each C i The mapping relationship between F' and the specified associated ID, and each C i The mapping relationship between the specified associated ID corresponding to F' is inserted into H0.
[0103] Specifically, the specified association ID refers to any association ID other than all intermediate association IDs in R.
[0104] In the above embodiment, when F' > the preset target similarity threshold, C is established. i The mapping relationship between the intermediate association IDs corresponding to the target similarity and the mapping relationship between the third intermediate fingerprint and the intermediate association IDs corresponding to the target similarity is established and inserted into H0, thereby updating the initial mapping table. Each key fingerprint can correspond to several key association IDs. When F' ≤ the preset target similarity threshold, it means that there is no connection with C. i The list of fingerprints with high similarity corresponds to the associated IDs, thereby generating new associated IDs and assigning each C to an associated ID. i The mapping relationship between the specified associated ID corresponding to F' is inserted into H0, which can continuously update the mapping relationship of the associated ID of the mobile terminal ID, which is beneficial to determine the accurate associated ID of the mobile terminal ID through accurate fingerprint.
[0105] like Figure 3 As shown, in one specific embodiment, the method further includes the following steps:
[0106] S300. Obtain the current application software ID corresponding to C, wherein the current application software ID refers to the identifier used to characterize the identity of the target application software when the mobile terminal obtains the current fingerprint.
[0107] S310. When the associated ID corresponding to the current application software ID is null, the associated ID corresponding to C is used as the associated ID corresponding to the current application software ID.
[0108] S320. When the associated ID corresponding to the current application software ID is not null, mark the associated ID corresponding to the current application software ID as R0.
[0109] S330. When R0 ≠ R'0, replace R0 with R'0, where R'0 refers to each C in C. i The corresponding associated ID, where each C i The corresponding associated ID can be obtained by referring to steps S200-S270.
[0110] As mentioned above, when the associated ID corresponding to the current application software ID is null, it can be understood that the target application software has not generated an associated ID, and the associated ID corresponding to the current fingerprint list is used as the associated ID corresponding to the current application software ID; when the associated ID corresponding to the current application software ID is not null, it can be understood that the target application software has uploaded a fingerprint list. When R0≠R'0, that is, the associated ID corresponding to the application software ID is inaccurate, each C in C is used. i The corresponding associated ID is returned to the target application software, which improves the accuracy of the related ID of the mobile terminal ID and helps to identify the same device.
[0111] like Figure 4 As shown, in one specific embodiment, the method further includes the following steps:
[0112] S400. Obtain the target mapping list H'0, where H'0 refers to H0 after processing through steps S200-S270. The specific implementation process of steps S200-S270 will not be described here.
[0113] S410. Obtain all associated IDs from H'0 and construct a first associated ID list R' = {R'1, ..., R''} based on all associated IDs. a , ..., R' v}, R' a It refers to the a-th first associated ID in H'0, where a = 1...v, and v is the number of first associated IDs in H'0.
[0114] Specifically, R'1≠...≠R' a ≠……≠R' v .
[0115] S420, Obtain R' from H'0 a All corresponding fingerprints and based on R' a All corresponding fingerprints are constructed into R' a The corresponding first target fingerprint list.
[0116] S430, based on the first target fingerprint list and R' a For any given second target fingerprint list, obtain the first target similarity list E'. a ={E' a1 , ..., E' ab , ..., E' av-1}, E' ab It refers to R' a The corresponding first target fingerprint list and R' a The similarity between the corresponding b-th second target fingerprint lists, b = 1...v-1, where v-1 is the number of second associated IDs.
[0117] Specifically, the second fingerprint list refers to a fingerprint list constructed based on all fingerprints corresponding to the second associated ID in H'0, where the second associated ID refers to the fingerprints in R' excluding R'0. a Any other associated ID besides the one mentioned above.
[0118] S440, when E' ab >When the preset target similarity threshold is reached, E' ab The corresponding associated ID is replaced with R' a .
[0119] Specifically, E'ab The method for obtaining it can be found in F. 1 The method to obtain 0 or F 2 The method for obtaining 0 will not be elaborated here.
[0120] Preferably, E' ab The method for obtaining it can be found in F. 1 How to obtain 0.
[0121] Specifically, the target similarity threshold is either a first similarity threshold or a second similarity threshold, wherein, based on E' ab The method for obtaining the target similarity threshold can be understood as follows: E' ab Refer to F 1 When obtaining 0, the target similarity threshold is the first similarity threshold; or, E' ab Refer to F 2 When obtaining 0, the target similarity threshold is the second similarity threshold.
[0122] S450, when E' ab When R' is less than or equal to the preset target similarity threshold, a This is an independent associated ID in H'0.
[0123] S460, Repeat steps S400-S450 to obtain the final mapping list.
[0124] As described above, based on H'0, by repeatedly executing steps S400-S450, the final mapping list of the target local application is obtained. Based on this, when E' ab >When the preset target similarity threshold is reached, it is considered to be the same mobile terminal, so E' ab The corresponding associated ID is replaced with R' a , when E' ab If the similarity is less than or equal to the preset target similarity threshold, it is considered that they are not the same mobile terminal, R' a It is an independent associated ID in H'0; it can cluster the associated IDs corresponding to mobile terminals, which is helpful to accurately determine whether other mobile devices are the same device.
[0125] like Figure 5 As shown, in a specific embodiment, the method further obtains the target mobile terminal ID through the following steps:
[0126] S500. Obtain the first string Z1, where Z1 is used to represent the version number of the target mobile terminal ID. Those skilled in the art can set the string format of the version number of the mobile terminal ID according to actual needs.
[0127] S510. Obtain the second string Z2, where Z2 is used to represent the validity period T of the target mobile terminal ID.
[0128] Specifically, T meets the following conditions:
[0129] T = T0 ± T', where T0 refers to a preset time period and T' refers to a random time period; this can be understood as: the preset time period is a fixed time period set in advance, and the random time period is a randomly selected time period.
[0130] Furthermore, the value of T0 ranges from 10 to 50 days; preferably, the value of T0 is 30 days.
[0131] Furthermore, the value of T' ranges from 6 to 48 hours; preferably, the value of T' is 12 hours.
[0132] Based on this, the target mobile terminal ID remains unchanged for a certain period of time, serving the purpose of identifying this mobile terminal. Third parties can use the mobile terminal ID to identify this mobile device. The timed expiration time includes a random time period to avoid a large number of mobile terminal IDs expiring at the same time, which would put too much pressure on the data processing server and cause damage to the data processing server.
[0133] S520. Obtain the third string Z3, where Z3 refers to a random string. Those skilled in the art know that a random string can be set according to actual needs, and will not be elaborated here.
[0134] Furthermore, the random string is a 64-bit encrypted string. Those skilled in the art can use any of the existing encryption methods to encrypt the string, which will not be elaborated here.
[0135] S530. Obtain the fourth string Z4, where Z4 is used to represent the verification number of the target mobile terminal ID. Those skilled in the art know that any method of generating the verification number in the prior art can be adopted, such as using CRC to generate the verification number, which will not be elaborated here.
[0136] S540. Combine Z1, Z2, Z3 and Z4 in sequence to generate the target mobile terminal ID, which can be understood as: Initial mobile terminal ID = Z1 + Z2 + Z3 + Z4.
[0137] Specifically, the method for generating the target mobile terminal ID is the same as that for generating the initial mobile terminal ID, and will not be repeated here. Based on this, the target mobile terminal ID is generated by combining the first string Z1, the second string Z2, the third string Z3, and the fourth string Z4, indicating the specific components of the mobile terminal ID, and possessing controlled, expired, and anonymized mechanisms, providing an effective identifier while protecting user privacy.
[0138] S550. Obtain the time interval ΔT corresponding to the target mobile terminal ID. When ΔT > T, regenerate the mobile terminal ID so that the regenerated mobile terminal ID replaces the target mobile terminal ID. Wherein, ΔT satisfies the following condition:
[0139] ΔT=T α -T β , among which, T α At the current time, T β The time point at which the target mobile terminal ID is generated.
[0140] The above embodiments involve complex mobile terminal ID formats to prevent tampering or cracking, thereby improving the security of mobile terminals and user information. At the same time, setting an effective time for regular updates ensures that when other software intercepts a mobile terminal ID, it may be an invalid mobile terminal ID, thus preventing the acquisition of device information through the mobile terminal ID and further improving the security of user information.
[0141] like Figure 6 As shown, in one specific embodiment, the method further includes the following steps:
[0142] S600. Obtain the original mobile terminal ID list ZZ = {ZZ1, ..., ZZ} λ ..., ZZ u}, among which, ZZ λ It refers to the λth original mobile terminal ID provided by the target device, where λ = 1...u, and u is the number of original mobile terminal IDs provided by the target device.
[0143] Specifically, the target device refers to any electronic device other than the target mobile terminal and the target server, wherein the target mobile terminal refers to a mobile terminal with the target application software installed and the target server refers to a server connected to the target mobile terminal.
[0144] Furthermore, the mobile terminal ID is stored on the target mobile terminal and the associated ID is stored on the target server.
[0145] Specifically, each ZZ λ The method for obtaining it can be referred to in steps S500-S540, and will not be repeated here.
[0146] S610. Obtain the intermediate mobile terminal ID list ZZ' based on ZZ.
[0147] Specifically, in step S610, the intermediate mobile terminal ID list is also obtained through the following steps:
[0148] S6101. When there are two or more identical original mobile terminal IDs in ZZ, retain any one of the original mobile terminal IDs corresponding to the same original mobile terminal ID in the list of original mobile terminal IDs and delete the other original mobile terminal IDs corresponding to the same original mobile terminal ID in ZZ.
[0149] S6102, Obtain ZZ λ ={Z λ1 Z λ2 Z λ3 Z λ4}, where Z λ1 Refers to the original mobile terminal ID λ The first string, Z λ2 Refers to the original mobile terminal ID λ The second string, Z λ3 Refers to the original mobile terminal ID λ The third string, Z λ4 Refers to the original mobile terminal ID λ The fourth string;
[0150] S6103, when ZZ λ The corresponding time interval < Z λ2 When the corresponding valid time is reached, delete ZZ in ZZ. λ Among them, ZZ λ The method for obtaining the time interval can refer to the method for obtaining the time interval of the target mobile terminal ID. λ2 The method for obtaining the validity period can be found in the validity period of the target mobile terminal ID, and will not be repeated here.
[0151] S6104, Z λ4 Perform analysis and Z λ4 If the parsing result fails, delete ZZ from ZZ. λ Those skilled in the art will know that steps S6101-S6104 can be performed simultaneously to ensure that a valid list of intermediate mobile terminal IDs can be obtained.
[0152] S620. Obtain the ratio K of the number of intermediate mobile terminal IDs h corresponding to ZZ' and the number of abnormal mobile terminal IDs K corresponding to ZZ'.
[0153] Specifically, the intermediate mobile terminal ID refers to any one of the original mobile terminal IDs in the intermediate mobile terminal IDs.
[0154] Specifically, K meets the following condition: K = h0 / h, where h0 refers to the number of abnormal mobile terminal IDs corresponding to ZZ'. The abnormal mobile terminal ID refers to an intermediate mobile terminal ID in the intermediate mobile terminal ID list whose time interval between the mobile terminal ID and the preset time interval of the mobile terminal ID is less than the random time interval of the mobile terminal ID.
[0155] S630. When h ≤ the preset mobile terminal ID quantity threshold h' or K ≤ the preset ratio threshold K', a prompt message is sent to the target device, wherein the prompt message is used to indicate that the original mobile terminal ID list cannot be processed.
[0156] S640. When h > preset mobile terminal ID quantity threshold h' and K > preset ratio threshold K', obtain the target mobile terminal ID list.
[0157] Specifically, step S640 also includes the following steps:
[0158] S6401. Obtain all associated IDs corresponding to any intermediate mobile terminal ID in ZZ' and construct a list of associated IDs corresponding to ZZ' based on all associated IDs corresponding to any intermediate mobile terminal ID in ZZ'. The list of associated IDs corresponding to ZZ' has undergone deduplication processing. Those skilled in the art know the deduplication processing method, so it will not be described in detail here.
[0159] S6402. Based on the list of associated IDs corresponding to ZZ', obtain the target associated ID list from the mapping table between mobile terminal IDs and associated IDs.
[0160] Specifically, the value of h' ranges from 800 to 3000, and preferably, the value of h' is 1000.
[0161] Specifically, the value of K' ranges from 80% to 100%; preferably, the value of K' is 99%.
[0162] Based on this, when h ≤ the preset mobile terminal ID quantity threshold h' or K ≤ the preset ratio threshold K', it indicates that the original mobile terminal ID list contains too many abnormal mobile terminal IDs, and this mobile terminal ID list is not processed when sent back to the target device. When h > the preset mobile terminal ID quantity threshold h' and K > the preset ratio threshold K', the number of abnormal mobile terminal IDs is within the normal range, and the target mobile terminal ID list is obtained based on the relationship between mobile terminal IDs and associated IDs. Therefore, when updating the original mobile terminal ID list, the third-party server obtains a many-to-many relationship between mobile terminal IDs and associated IDs, preventing the third party from obtaining multiple mobile terminal IDs from the same device, which could lead to the third party decrypting the mobile terminal IDs and affecting the device's security, thereby improving the device's security.
[0163] Embodiments of the present invention also provide a non-transitory computer-readable storage medium that can be disposed in an electronic device to store at least one instruction or at least one program related to implementing a method in the method embodiments, wherein the at least one instruction or the at least one program is loaded and executed by the processor to implement the method provided in the above embodiments.
[0164] Embodiments of the present invention also provide an electronic device, including a processor and the aforementioned non-transitory computer-readable storage medium.
[0165] While specific embodiments of the invention have been described in detail by way of example, those skilled in the art should understand that the examples are for illustrative purposes only and not intended to limit the scope of the invention. Those skilled in the art should also understand that various modifications can be made to the embodiments without departing from the scope and spirit of the invention. The scope of this invention is defined by the appended claims.
Claims
1. A data processing method for updating a mobile terminal ID, characterized in that, The method includes the following steps: S600, Obtain the original mobile terminal ID list ZZ={ZZ1, ..., ZZ} λ ..., ZZ u }, among which, ZZ λ It refers to the λth original mobile terminal ID provided by the target device, where λ=1……u, and u is the number of original mobile terminal IDs provided by the target device; S610. Obtain the intermediate mobile terminal ID list ZZ' based on ZZ; wherein, in step S610, the intermediate mobile terminal ID list is also obtained through the following steps: S6101. When there are two or more identical original mobile terminal IDs in ZZ, retain any one of the original mobile terminal IDs corresponding to the same original mobile terminal ID in the list of original mobile terminal IDs and delete the other original mobile terminal IDs corresponding to the same original mobile terminal ID in ZZ. S6102, Obtain ZZ λ ={Z λ1 Z λ2 Z λ3 Z λ4 }, where Z λ1 Refers to the original mobile terminal ID λ The first string, Z λ2 Refers to the original mobile terminal ID λ The second string, Z λ3 Refers to the original mobile terminal ID λ The third string, Z λ4 Refers to the original mobile terminal ID λ The fourth string; S6103, when ZZ λ The corresponding time interval < Z λ2 When the corresponding valid time is reached, delete ZZ in ZZ. λ ; S6104, Z λ4 Perform analysis and Z λ4 If the parsing result fails, delete ZZ from ZZ. λ ; S620. Obtain the ratio K of the number of intermediate mobile terminal IDs h corresponding to ZZ' and the number of abnormal mobile terminal IDs corresponding to ZZ', wherein K meets the following condition: K=h0 / h, h0 refers to the number of abnormal mobile terminal IDs corresponding to ZZ'; wherein, the abnormal mobile terminal ID refers to the intermediate mobile terminal ID in the intermediate mobile terminal ID list whose time interval between the mobile terminal ID and the preset time interval of the mobile terminal ID is less than the random time interval of the mobile terminal ID. S630. When h ≤ the preset threshold h' for the number of mobile terminal IDs or K ≤ the preset ratio threshold K', a prompt message is sent to the target device. S640. When h > preset mobile terminal ID quantity threshold h' and K > preset ratio threshold K', obtain the target mobile terminal ID list.
2. The data processing method for updating the mobile terminal ID according to claim 1, characterized in that, The target device refers to any electronic device other than the target mobile terminal and the target server, wherein the target mobile terminal refers to a mobile terminal with the target application software installed and the target server refers to a server connected to the target mobile terminal.
3. The data processing method for updating the mobile terminal ID according to claim 2, characterized in that, The mobile terminal ID is stored on the target mobile terminal and the associated ID is stored on the target server.
4. The data processing method for updating the mobile terminal ID according to claim 1, characterized in that, Step S640 also includes the following steps: S6401. Obtain all associated IDs corresponding to any intermediate mobile terminal ID in ZZ' and construct a list of associated IDs corresponding to ZZ' based on all associated IDs corresponding to any intermediate mobile terminal ID in ZZ'. S6402. Based on the list of associated IDs corresponding to ZZ', obtain the target associated ID list from the mapping table between mobile terminal IDs and associated IDs.
5. The data processing method for updating the mobile terminal ID according to claim 1, characterized in that, The value of h' can range from 800 to 3000.
6. The data processing method for updating the mobile terminal ID according to claim 1, characterized in that, The value of K' ranges from 80% to 100%.
7. A non-transitory computer-readable storage medium, characterized in that, The storage medium stores at least one instruction or at least one program segment, which is loaded and executed by a processor to implement the data processing method for updating the mobile terminal ID as described in any one of claims 1 to 6.
8. An electronic device, characterized in that, Includes a processor and the non-transitory computer-readable storage medium of claim 7.