CN116527758B - Method, device, equipment, storage medium and product for generating universal identifier - Google Patents
Method, device, equipment, storage medium and product for generating universal identifier Download PDFInfo
- Publication number
- CN116527758B CN116527758B CN202310814303.6A CN202310814303A CN116527758B CN 116527758 B CN116527758 B CN 116527758B CN 202310814303 A CN202310814303 A CN 202310814303A CN 116527758 B CN116527758 B CN 116527758B
- Authority
- CN
- China
- Prior art keywords
- user terminal
- identifier
- label
- hash value
- server
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 95
- 239000013598 vector Substances 0.000 claims abstract description 93
- 230000004044 response Effects 0.000 claims abstract description 12
- 238000012795 verification Methods 0.000 claims description 42
- 238000004590 computer program Methods 0.000 claims description 7
- 238000004891 communication Methods 0.000 description 18
- 230000008569 process Effects 0.000 description 18
- 238000004422 calculation algorithm Methods 0.000 description 13
- 238000010586 diagram Methods 0.000 description 13
- 241000122205 Chamaeleonidae Species 0.000 description 9
- 230000006870 function Effects 0.000 description 8
- 102100022142 Achaete-scute homolog 1 Human genes 0.000 description 7
- 101000901099 Homo sapiens Achaete-scute homolog 1 Proteins 0.000 description 7
- 230000005540 biological transmission Effects 0.000 description 7
- 230000003287 optical effect Effects 0.000 description 6
- 238000012545 processing Methods 0.000 description 5
- 230000000694 effects Effects 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 238000013507 mapping Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000007792 addition Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 238000003064 k means clustering Methods 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/55—Push-based network services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/14—Session management
- H04L67/146—Markers for unambiguous identification of a particular session, e.g. session cookie or URL-encoding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/566—Grouping or aggregating service requests, e.g. for unified processing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a method, a device, equipment, a storage medium and a product for generating a universal identifier, wherein the method receives a first root identifier and a first hash value generated by a second server in response to a target request through a first server; secondly, the first server determines a universal identifier corresponding to the first user terminal according to a first root identifier and the first hash value, wherein the universal identifier is used for indicating a proxy server to push the target service to the first user terminal and the at least one second user terminal, and a label vector corresponding to each second user terminal is associated with a label vector corresponding to the first user terminal; finally, the universal identifier is sent to the first user terminal; therefore, the universal identifier obtained in the embodiment of the application can determine that a plurality of user terminals have the same tag vector, so that the service can be pushed to the user terminals with the same tag attribute through the universal identifier, and the accuracy of service information pushing is improved.
Description
Technical Field
The application belongs to the technical field of computers, and particularly relates to a method, a device, equipment, a storage medium and a product for generating a universal identifier.
Background
With the development of information technology, it is becoming easier to extract valuable data from massive data, so that anonymization processing is required for some sensitive data to avoid leakage of important information.
However, in the prior art, the anonymization of the information is achieved by constructing a mapping relationship between a unique identifier and a unique entity, that is, the identifier and the entity are in one-to-one relationship, and the corresponding entity can be found by the identifier.
However, the information pushing capability of the one-to-one mapping relationship is limited, accurate batch pushing is difficult to realize, for some information recommendation, for example, service pushing information, the generated identifier may correspond to a plurality of entities, for example, the last eight digits of the identification card number are hidden, so that the hidden identification card number corresponds to a plurality of users, and therefore service pushing information is pushed to unnecessary people in the information pushing, and the accuracy of service information pushing is low.
Disclosure of Invention
The embodiment of the application provides a method, a device, equipment, a storage medium and a product for generating a universal identifier, which can solve the problem of reduced service information pushing accuracy in the prior art.
In a first aspect, an embodiment of the present application provides a method for generating a generic identifier, which is applied to a first server, including:
receiving a first root identifier and a first hash value generated by a second server in response to a target request, wherein the target request is associated with a first user terminal, the first root identifier is a unique identifier of the first user terminal, the first hash value is generated according to a tag vector corresponding to the first user terminal, the tag vector comprises a vector value of at least one target service tag associated with a target service, and each service tag is used for indicating whether a factor influencing whether a user accepts the target service exists or not;
determining a universal identifier corresponding to the first user terminal according to the first root identifier and the first hash value;
transmitting the generic identification to the first user terminal,
and when the universal identifier also corresponds to at least one second user terminal, the universal identifier is used for indicating a proxy server to push the target service to the first user terminal and the at least one second user terminal, and the label vector corresponding to each second user terminal is associated with the label vector corresponding to the first user terminal.
In a second aspect, an embodiment of the present application provides a method for generating a generic identifier, which is applied to a second server, including:
receiving a target request associated with a first user terminal;
generating a first root identifier in response to the target request, and acquiring a tag vector corresponding to the first user terminal, wherein the first root identifier is a unique identifier of the first user terminal;
generating a first hash value according to a tag vector corresponding to the first user terminal, wherein the tag vector comprises a vector value of at least one target service tag associated with a target service, and each service tag is used for indicating whether a factor influencing whether a user accepts the target service exists or not;
and sending the first root identifier and the first hash value to a first server, so that the first server determines a universal identifier corresponding to the first user terminal according to the first root identifier and the first hash value and sends the universal identifier to the first user terminal.
In a third aspect, an embodiment of the present application provides a device for generating a generic identifier, which is applied to a first server, including:
the first receiving module is used for receiving a first root mark and a first hash value, wherein the first root mark is generated by a second server in response to a target request, the target request is associated with a first user terminal, the first root mark is a unique mark of the first user terminal, the first hash value is generated according to a tag vector corresponding to the first user terminal, the tag vector comprises a vector value of at least one target service tag associated with a target service, and each service tag is used for indicating whether a factor influencing whether a user accepts the target service exists or not;
The first determining module is used for determining a universal identifier corresponding to the first user terminal according to the first root identifier and the first hash value;
a first sending module, configured to send the generic identifier to the first user terminal,
and when the universal identifier also corresponds to at least one second user terminal, the universal identifier is used for indicating a proxy server to push the target service to the first user terminal and the at least one second user terminal, and the label vector corresponding to each second user terminal is associated with the label vector corresponding to the first user terminal.
In a fourth aspect, an embodiment of the present application provides a device for generating a generic identifier, which is applied to a second server, and includes:
a second receiving module, configured to receive a target request associated with the first user terminal;
the generating and acquiring module is used for responding to the target request, generating a first root identifier and acquiring a label vector corresponding to the first user terminal, wherein the first root identifier is a unique identifier of the first user terminal;
the first generation module is used for generating a first hash value according to a label vector corresponding to the first user terminal, wherein the label vector comprises a vector value of at least one target service label associated with target service, and each service label is used for indicating whether a factor influencing whether a user accepts the target service exists or not;
And the second sending module is used for sending the first root identifier and the first hash value to a first server so that the first server determines a universal identifier corresponding to the first user terminal according to the first root identifier and the first hash value and sends the universal identifier to the first user terminal.
In a fifth aspect, an embodiment of the present application provides an electronic device comprising a processor and a memory storing a program or instructions executable on the processor, the program or instructions implementing the steps of the method as described in the first aspect when executed by the processor; alternatively, the steps of the method as described in the second aspect are implemented.
In a sixth aspect, embodiments of the present application provide a readable storage medium having stored thereon a program or instructions which when executed by a processor perform the steps of the method according to the first aspect; alternatively, the steps of the method as described in the second aspect are implemented.
In a seventh aspect, embodiments of the present application provide a computer program product stored in a storage medium, the program product being executable by at least one processor to implement the method according to the first aspect; alternatively, the method as described in the second aspect is implemented.
The embodiment of the application provides a method, a device, equipment and a storage medium for generating a universal identifier, wherein first, a first server receives a first root identifier and a first hash value generated by a second server in response to a target request; secondly, the first server determines a universal identifier corresponding to the first user terminal according to a first root identifier and the first hash value, wherein the universal identifier is used for indicating a proxy server to push the target service to the first user terminal and the at least one second user terminal, and a label vector corresponding to each second user terminal is associated with a label vector corresponding to the first user terminal; finally, the universal identifier is sent to the first user terminal; therefore, the universal identifier obtained in the embodiment of the application can determine that a plurality of user terminals have the same tag vector, so that the service can be pushed to the user terminals with the same tag attribute through the universal identifier, and the accuracy of service information pushing is improved.
Drawings
FIG. 1 is a flow chart of a method for generating a generic identifier according to an embodiment of the present application;
FIG. 2 is a flowchart of a method for generating a generic identifier according to another embodiment of the present application;
FIG. 3 is a flowchart of a method for generating a generic identifier according to another embodiment of the present application;
fig. 4 is a schematic structural diagram of a device for generating a universal identifier according to an embodiment of the present application;
FIG. 5 is a schematic structural diagram of a device for generating a generic identifier according to another embodiment of the present application;
fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
Features and exemplary embodiments of various aspects of the present application will be described in detail below, and in order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be described in further detail below with reference to the accompanying drawings and the detailed embodiments. It should be understood that the particular embodiments described herein are meant to be illustrative of the application only and not limiting. It will be apparent to one skilled in the art that the present application may be practiced without some of these specific details. The following description of the embodiments is merely intended to provide a better understanding of the application by showing examples of the application.
It is noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.
As described in the background art, in the prior art, because the information pushing capability of the one-to-one mapping relationship is limited, it is difficult to realize accurate batch pushing, for some information recommendation, for example, service pushing information, an existing generated identifier may correspond to a plurality of entities, for example, the last eight digits of an identification card number are hidden, so that the hidden identification card number corresponds to a plurality of users, and therefore, service pushing information is pushed to an unnecessary person in the information pushing, which results in low accuracy of service information pushing.
In order to solve the problems in the prior art, the embodiment of the application provides a method, a device, equipment, a storage medium and a product for generating a universal identifier.
The following first describes a method for generating a generic identifier provided by an embodiment of the present application.
Fig. 1 is a flow chart of a method for generating a universal identifier according to an embodiment of the present application. The method is applied to a generation system of the universal identifier, the system comprises a first server, a second server, a user terminal and a proxy server, and the method comprises the following steps S101 to S107.
S101, a second server receives a target request associated with a first user terminal.
S102, the second server responds to the target request, generates a first root identifier and acquires a label vector corresponding to the first user terminal.
S103, the second server generates a first hash value according to the label vector corresponding to the first user terminal.
And S104, the second server sends the first root identifier and the first hash value to the first server.
S105, the first server receives a first root identifier and a first hash value generated by the second server in response to the target request.
S106, the first server determines a universal identifier corresponding to the first user terminal according to the first root identifier and the first hash value.
And S107, the first server sends the universal identifier to the first user terminal.
In the embodiment of the application, first, a first server receives a first root identifier and a first hash value generated by a second server in response to a target request; secondly, the first server determines a universal identifier corresponding to the first user terminal according to a first root identifier and the first hash value, wherein the universal identifier is used for indicating a proxy server to push the target service to the first user terminal and the at least one second user terminal, and a label vector corresponding to each second user terminal is associated with a label vector corresponding to the first user terminal; finally, the universal identifier is sent to the first user terminal; therefore, the universal identifier obtained in the embodiment of the application can determine that a plurality of user terminals have the same tag vector, so that the service can be pushed to the user terminals with the same tag attribute through the universal identifier, and the accuracy of service information pushing is improved.
A specific implementation of each of the above steps is described below.
In some embodiments, in S101, the second server may be an identity server in the system for receiving the target request of the first user terminal, for identifying the identity of each first user terminal. The target request is for the first user terminal to initiate identity recognition of the terminal to the second server.
As an example, the first user terminal may be a communicable handset P, and the second server may be a communications carrier M, and when the user first uses the terminal device or clicks on an application in the terminal device, the handset P sends at least one target request R to the communications carrier M, where the target request R includes information related to the identity of the handset P requested by the communications carrier M.
In some embodiments, in S102, the second server generates a first root identifier according to the target request, where the first root identifier is a unique identifier of the first user terminal; and secondly, obtaining a label vector corresponding to the first user terminal according to the first root mark, wherein the label vector comprises a vector value of at least one target service label associated with target service, and each service label is used for indicating whether a factor influencing whether the user accepts the target service exists or not.
The first root mark may be a character string with a preset length and composed of numbers and letters, and the value range of the tag vector includes a plurality of simple numbers, and each number is used for representing the service possibility represented by the service tag.
As an example, the communication carrier M generates a root identifier AAA666 according to the target request of the mobile phone P, and then passes the root identifier AAA666 obtains label vector LB that cell phone P corresponds to. The label vector LB indicates whether the customer is used to purchase a luxury item in a range of valuesWhere 0 indicates that no luxury is purchased and 1 indicates that there is a luxury purchase.
In some embodiments, in S103, according to the tag vector corresponding to the first user terminal, a hash value of the tag vector is calculated by a hash algorithm, so as to obtain a first hash value.
As an example, the communication carrier M obtains the tag vector LB corresponding to the mobile phone P, and calculates the tag vector LB by using a Message-Digest Algorithm (Message-Digest algorism 5) to obtain a first HASH value 111XXX111111111X1XX11111XX1X11XXX, which is denoted as HASH1, where the Message-Digest Algorithm belongs to one of the HASH algorithms.
In some embodiments, in S104, the second server establishes a data transmission channel with the first server, and then sends the first root identifier and the corresponding first hash value to the first server through the data transmission channel, where the first server is a server dedicated to generating a universal identifier, and may perform an automated process according to the received information, so as to generate the universal identifier.
As an example, the communication carrier M establishes a data transmission channel T with the universal identification platform U, and then the communication carrier M sends the root identification AAA666 and the first HASH value HASH1 in S103 to the universal identification platform U through the data transmission channel T.
In some embodiments, in S105, the first server receives, through the data transmission channel, a first root identifier sent by the second server and a first hash value, where the first root identifier is used as a unique identifier of the first user terminal; in addition, hash algorithm is utilized to carry out hash calculation on a label vector corresponding to the first user terminal, a first hash value is generated, the label vector comprises a vector value of at least one target service label associated with target service, and each service label is used for indicating whether a factor influencing whether the target service is accepted by a user or not.
It should be noted that in the case where a plurality of service tags are associated with a target service, different service tags are used to indicate that factors affecting different services are different.
As an example, the universal identification platform U receives the root identification AAA666 and the first HASH value HASH1 sent by the communication carrier M through the data transmission channel T.
In some embodiments, in S106, the first server may determine, according to the first root identifier and the first Hash value, a universal identifier corresponding to the first user terminal through a Chameleon Hash algorithm (Chameleon Hash).
It should be noted that, when the generating system of the universal identifier is started for the first time, the system parameter initialization process needs to be performed, that is, the initialization process may further include: setting a preset number, and setting a calculator of the hash value of each tag vector as an initial value, wherein the initial value is used for controlling the number of target objects with the same or similar tags corresponding to the universal identifier; and generating system parameters, a public key and a private key by using the chameleon hash algorithm, wherein the system parameters, the public key and the private key are used for providing preset parameters for the chameleon hash algorithm calculation.
As an example, the universal identifier platform U determines, according to the root identifier AAA666 and the first HASH value HASH1, the universal identifier u_id corresponding to the mobile phone P by using a chameleon HASH algorithm.
In one implementation, the universal identifier corresponding to the first user terminal may be determined according to formula (1):
(1)
wherein,,: input of security parameters +.>The structure satisfies the security parameter->Big prime number->And->Selecting multiplication cycle group->Middle order of->Element->Outputting the common parameter->;
: input of common parameters->In the multiplication cycle group->Index +.>Calculate->. Finally, the private key- >Public key->;
: input public key->Message->Random number->Wherein->Outputting the chameleon hash value->Wherein m is any given message;
: input private key->Message->Random number->Wherein->Output ofWherein->For a new message->Is a new random number.
In some embodiments, in S107, the first server sends the universal identifier to the first user terminal, so as to construct an association relationship between the first user terminal and the universal identifier in the system.
And when the universal identifier also corresponds to at least one second user terminal, the universal identifier is used for indicating a proxy server to push the target service to the first user terminal and the at least one second user terminal, and the label vector corresponding to each second user terminal is associated with the label vector corresponding to the first user terminal.
It should be noted that the tag vector corresponding to the second user terminal may be the same as or similar to the tag vector corresponding to the first user terminal.
As an example, the universal identifier platform U sends the corresponding universal identifier u_id to the mobile phone P, so that the association relationship between the mobile phone P and the universal identifier u_id is stored in the relationship module of the system.
In some embodiments, before generating the first hash value according to the tag vector corresponding to the first user terminal, the method further includes:
a second server acquires N preset service tags associated with the target service, wherein N is an integer greater than 1;
clustering the N preset service labels to obtain K service label categories, wherein K is an integer smaller than N;
and determining a preset service label meeting a second preset condition as a target service label in each service label class in the K service label classes to obtain at least one target service label associated with target service.
It should be noted that the second preset condition may be that a clustering method such as K-means (K-means clustering algorithm) or euclidean distance is used to calculate at least one target traffic label within a certain range from the central position, so as to determine the traffic label class.
As an example, the method may include the following 5 steps:
counting the number of samples corresponding to each tag, and setting the total number of samples as N, and the tags,/>The value space of (2) is->Then->Sign label->The value is +.>Then for each of the samples All have->. In order to obtain similar label vectors, on one hand, the possible value of each label is reduced; on the other hand, the similarity vectors are classified into one type.
1. Based on the number of samples counted aboveIf->Very small (much smaller than +)>) Then will be->The tag value of the sample of (2) is changed to +.>Here +.>Satisfy the same->,/>Maximum. After doing so, the +_s>The value space of (2) is->And->;
2. Defining a tag distance of two samples asWherein->The indirection function indicates that the tag value is the same as 0 and different from 1. Furthermore, divide by->The reason for (1) is->The larger the specification, the finer the classification, the less weight is given in calculating distance;
3. random selectionEach tag vector is calculated to +.>The distance of the individual tag vectors is divided into +.>Class;
4. re-select thisCenter point of class (center tag vector);
5. repeating the steps 3 and 4 to finally obtainAnd similar tag vectors.
The similar label vector can be used as a target service label.
In this embodiment, by acquiring N preset service tags associated with the target service and clustering the N preset service tags, K service tag categories are obtained, and then the preset service tags satisfying the second preset condition are determined as target service tags, so as to obtain at least one target service tag associated with the target service, thereby obtaining more accurate service tag categories.
In some embodiments, the determining, in each of the K traffic label classes, the preset traffic label satisfying the second preset condition as the target traffic label includes:
and determining a preset business label nearest to the center of the business label class as a target business label in each business label class in the K business label classes.
The preset service label is a preset service label category, and the clustering method such as K-means or Euclidean distance is adopted to calculate a preset service label which is closest to the center position and is satisfied as a target service label, so that the service label category is determined.
As an example, there are three preset business labels, namely "willing to purchase a luxury car", "willing to spend a premium purchase", and "willing to purchase a luxury package", respectively, wherein the preset business label, which is "willing to spend a premium purchase", is closest to the center location, thus determining the business label category T as "willing to spend a premium purchase".
In this embodiment, by selecting the preset service label closest to the center of the service label class as the target service label, the method improves accuracy of determining the target service label.
In some embodiments, the receiving a target request associated with a first user terminal includes:
receiving a target request sent by a proxy server and first verification information, wherein the first verification information is generated by the proxy server under the condition of receiving the target request sent by the first user terminal;
the sending the first root identifier and the first hash value to the first server includes:
and sending the first root identification, the first hash value and the first verification information to a first server.
Since the first verification information comprises a bill which can be used for charging, the first verification information can ensure the legitimacy and the security of the target request received by the second server. The proxy server may obtain the target request of the first user terminal, and send the target request and the first authentication information to the second server instead of the first user terminal.
As an example, the communication carrier M receives the target request RQ and the first verification information VY of the proxy server a, processes the information, and then transmits the AAA666, the first HASH value HASH1, and the first verification information VY to the universal identification platform U.
In this embodiment, the proxy server executes the target request associated with the first user terminal, and after completing the request processing, the first root identifier, the first hash value and the first verification information can be more safely and efficiently sent to the first server.
In some embodiments, the determining, according to the first root identifier and the first hash value, a universal identifier corresponding to the first user terminal includes:
under the condition that the first server is determined to have the universal identifier corresponding to the first hash value, acquiring the number of user terminals corresponding to the universal identifier, wherein the universal identifier is generated by the first server in advance according to a second root identifier and a second hash value, the second root identifier is a unique identifier of a target user terminal, the second hash value is generated according to a label vector corresponding to the target user terminal, the second hash value is the same as the first hash value, and the target user terminal is one of the at least second user terminals;
and under the condition that the number of the user terminals corresponding to the universal identification is smaller than the preset number, establishing a corresponding relation between the universal identification and the first user terminal according to the first root identification.
Before determining a certain universal identifier, the number of user terminals corresponding to the universal identifier may be judged, and if the number of user terminals corresponding to the universal identifier is smaller than the preset number, a corresponding relation between the universal identifier and the first user terminal is established according to the first root identifier.
As an example, before determining the universal identifier u_id, searching the universal identifier u_id in the system, if the universal identifier u_id is found to exist, determining the number of user terminals corresponding to the universal identifier u_id, and if the number of user terminals corresponding to the universal identifier u_id is smaller than a preset number, for example, 100, establishing a corresponding relationship between the universal identifier u_id and the mobile phone P according to the first root identifier AAA 666.
As another example, the generic identifier is generated in the following specific manner:
a) If it isThen
i. The universal ID platform is based on hash valuesAnd root ID, use +.A. in chameleon hash>The algorithm generates a general ID;
ii.;
b) If it isThen
i. The universal ID platform is based on hash valuesAnd root ID, use +.A. in chameleon hash>Algorithm generation and pre-sum hash value +.>The same universal ID;
ii.;
c) If it isThen
i. The universal ID platform uses the chameleon according to the hash value and the root IDThe algorithm generates a new general ID;
ii.。
in the method, in the process of the invention,representing by calculating the same hash value +.>To determine the number of user terminals corresponding to a generic identifier, for example>For the preset number, ID (Identity document) is an identity.
In this embodiment, the universal identifier is determined according to the size relationship between the number of user terminals corresponding to the universal identifier and the preset number, so that the controllability of obtaining the universal identifier is improved.
In some embodiments, the method further comprises:
and generating the universal identifier corresponding to the first user terminal according to the first hash value and the first root identifier under the condition that the first server does not have the universal identifier corresponding to the first hash value or the number of the user terminals corresponding to the universal identifier is equal to the preset number.
When a certain universal identifier is determined, the fact that the universal identifier does not exist before is known, or when the number of the user terminals corresponding to the universal identifier is smaller than the preset number, the universal identifier corresponding to the first user terminal can be generated according to the first hash value and the first root identifier.
As an example, when the universal identifier u_id is determined, the universal identifier u_id is not searched in the system, or when the number of user terminals corresponding to the universal identifier u_id is less than a preset number, the universal identifier u_id corresponding to the first user terminal is generated according to the first HASH value HASH1 and the first root identifier AAA 666.
In this embodiment, before determining the universal identifier, it is determined whether the universal identifier exists or if the number of user terminals corresponding to the universal identifier is equal to a preset number, a new universal identifier is generated, so that flexibility of generating the universal identifier is improved.
In some embodiments, the first root identity and the first hash value are generated by the second server upon receiving a target request sent by the proxy server and first authentication information, the first authentication information being generated by the proxy server upon receiving a target request sent by the first user terminal, the method further comprising:
receiving first verification information sent by a proxy server;
the determining the universal identifier corresponding to the first user terminal comprises the following steps:
and under the condition that the first verification information and the second verification information meet a first preset condition, determining a universal identifier corresponding to the first user terminal, wherein the second verification information is information carried by the second server when sending the first root identifier and the first hash value to the first server.
The first preset condition may be that the first verification information is the same as the second verification information or that the difference of the first verification information and the second verification information is within a certain error range.
And the second server generates a first root identifier and the first hash value according to the target request and the first verification information sent by the proxy server, verifies the first verification information and the second verification information sent to the first server by the proxy server, and determines the universal identifier corresponding to the first user terminal when the verification result meets a first preset condition.
As an example, the communication carrier M generates the first root ID AAA666 and the first HASH value HASH1 according to the target request RQ and the first authentication information VY1 sent by the proxy server a, and sends the first authentication information VY1 and the second authentication information VY2 of the generic ID platform U to perform authentication, and determines the generic ID u_id corresponding to the mobile phone P when the authentication result satisfies that the first authentication information is the same as the second authentication information.
In this embodiment, the universal identifier is determined after verification by the first verification information and the second verification information sent to the first server by the proxy server, so that the security and the effectiveness of obtaining the universal identifier are improved.
It should be noted that, because the common identifiers corresponding to the same user terminal in different proxy servers are different, when the service information is pushed by using the common identifier generated by the proxy server mode, the following mode may be adopted:
the first proxy node sends a first universal identifier to a first server;
the first server finds a corresponding first root identifier according to the first universal identifier;
the first server sends a second common identifier corresponding to the first root identifier in a second proxy node to the second proxy node;
And the second proxy node pushes information to the target object corresponding to the second universal identifier.
Fig. 2 is a flow chart of a method for generating a universal identifier according to an embodiment of the present application. The method is applied to a first server, and includes the following S201 to S203.
S201, receiving a first root mark and a first hash value generated by a second server in response to a target request, wherein the target request is associated with a first user terminal, the first root mark is a unique mark of the first user terminal, the first hash value is generated according to a tag vector corresponding to the first user terminal, the tag vector comprises a vector value of at least one target service tag associated with a target service, and each service tag is used for indicating whether a factor influencing whether a user accepts the target service exists or not;
s202, determining a universal identifier corresponding to the first user terminal according to the first root identifier and the first hash value;
s203, the universal identification is sent to the first user terminal,
and when the universal identifier also corresponds to at least one second user terminal, the universal identifier is used for indicating a proxy server to push the target service to the first user terminal and the at least one second user terminal, and the label vector corresponding to each second user terminal is associated with the label vector corresponding to the first user terminal.
In some embodiments, the determining, according to the first root identifier and the first hash value, a universal identifier corresponding to the first user terminal includes:
under the condition that the first server is determined to have the universal identifier corresponding to the first hash value, acquiring the number of user terminals corresponding to the universal identifier, wherein the universal identifier is generated by the first server in advance according to a second root identifier and a second hash value, the second root identifier is a unique identifier of a target user terminal, the second hash value is generated according to a label vector corresponding to the target user terminal, the second hash value is the same as the first hash value, and the target user terminal is one of the at least second user terminals;
and under the condition that the number of the user terminals corresponding to the universal identification is smaller than the preset number, establishing a corresponding relation between the universal identification and the first user terminal according to the first root identification.
In some embodiments, the determining, according to the first root identifier and the first hash value, a universal identifier corresponding to the first user terminal further includes:
And generating the universal identifier corresponding to the first user terminal according to the first hash value and the first root identifier under the condition that the first server does not have the universal identifier corresponding to the first hash value or the number of the user terminals corresponding to the universal identifier is equal to the preset number.
In some embodiments, the first root identity and the first hash value are generated by the second server upon receipt of a target request sent by the proxy server and first authentication information generated by the proxy server upon receipt of a target request sent by the first user terminal,
before determining the universal identifier corresponding to the first user terminal according to the first root identifier and the first hash value, the method further comprises:
receiving first verification information sent by a proxy server;
the determining the universal identifier corresponding to the first user terminal comprises the following steps:
and under the condition that the first verification information and the second verification information meet a first preset condition, determining a universal identifier corresponding to the first user terminal, wherein the second verification information is information carried by the second server when sending the first root identifier and the first hash value to the first server.
The method for generating the universal identifier provided by the embodiment of the application can realize each process realized by the embodiment of the method of fig. 1 and can achieve the same beneficial effects, and in order to avoid repetition, the description is omitted.
Fig. 3 is a flow chart illustrating a method for generating a universal identifier according to an embodiment of the present application. The method is applied to a first server, and comprises the following steps 301 to 304.
S301, receiving a target request associated with a first user terminal;
s302, responding to the target request, generating a first root mark, and acquiring a label vector corresponding to the first user terminal, wherein the first root mark is a unique mark of the first user terminal;
s303, generating a first hash value according to a label vector corresponding to the first user terminal, wherein the label vector comprises a vector value of at least one target service label associated with a target service, and each service label is used for indicating whether a factor influencing whether a user accepts the target service exists or not;
s304, the first root identifier and the first hash value are sent to a first server, so that the first server determines a universal identifier corresponding to the first user terminal according to the first root identifier and the first hash value and sends the universal identifier to the first user terminal.
In some embodiments, before generating the first hash value according to the tag vector corresponding to the first user terminal, the method further includes:
acquiring N preset service labels associated with the target service, wherein N is an integer greater than 1;
clustering the N preset service labels to obtain K service label categories, wherein K is an integer smaller than N;
and determining a preset service label meeting a second preset condition as a target service label in each service label class in the K service label classes to obtain at least one target service label associated with target service.
In some embodiments, the determining, in each of the K traffic label classes, the preset traffic label satisfying the second preset condition as the target traffic label includes:
and determining a preset business label nearest to the center of the business label class as a target business label in each business label class in the K business label classes.
In some embodiments, the receiving a target request associated with a first user terminal includes:
receiving a target request sent by a proxy server and first verification information, wherein the first verification information is generated by the proxy server under the condition of receiving the target request sent by the first user terminal;
The sending the first root identifier and the first hash value to the first server includes:
and sending the first root identification, the first hash value and the first verification information to a first server.
The method for generating the universal identifier provided by the embodiment of the application can realize each process realized by the embodiment of the method of fig. 1 and can achieve the same beneficial effects, and in order to avoid repetition, the description is omitted.
Fig. 4 is a schematic structural diagram of a general identifier generating apparatus according to an exemplary embodiment. The generation means of the generic identifier is applied to the first server. As shown in fig. 4, the first server side apparatus 400 in the apparatus for generating a generic identifier may include:
a first receiving module 401, configured to receive a first root identifier and a first hash value, where the first root identifier is generated by a second server in response to a target request, the target request is associated with a first user terminal, the first root identifier is a unique identifier of the first user terminal, the first hash value is generated according to a tag vector corresponding to the first user terminal, the tag vector includes a vector value of at least one target service tag associated with a target service, and each service tag is used to indicate whether a factor that affects whether a user accepts the target service exists;
A first determining module 402, configured to determine, according to the first root identifier and the first hash value, a universal identifier corresponding to the first user terminal;
a first sending module 403, configured to send the generic identifier to the first user terminal,
and when the universal identifier also corresponds to at least one second user terminal, the universal identifier is used for indicating a proxy server to push the target service to the first user terminal and the at least one second user terminal, and the label vector corresponding to each second user terminal is associated with the label vector corresponding to the first user terminal.
In some embodiments of the present application, to further enhance the controllability of obtaining the universal identifier, the first determining module 402 may include:
an obtaining unit, configured to obtain, when it is determined that a common identifier corresponding to the first hash value exists in the first server, the number of user terminals corresponding to the common identifier, where the common identifier is generated in advance by the first server according to a second root identifier and a second hash value, the second root identifier is a unique identifier of a target user terminal, the second hash value is generated according to a tag vector corresponding to the target user terminal, the second hash value is the same as the first hash value, and the target user terminal is one of the at least second user terminals;
The establishing unit is used for establishing a corresponding relation between the universal identifier and the first user terminal according to the first root identifier under the condition that the number of the user terminals corresponding to the universal identifier is smaller than the preset number.
In some embodiments of the present application, to further enhance flexibility in generating the universal identifier, the apparatus 400 may further include:
and the second generation module is used for generating the universal identifier corresponding to the first user terminal according to the first hash value and the first root identifier under the condition that the first server does not have the universal identifier corresponding to the first hash value or the number of the user terminals corresponding to the universal identifier is equal to the preset number.
In some embodiments of the present application, to further improve the security and effectiveness of obtaining the universal identifier, the apparatus 400 may further include:
the third receiving module is used for receiving the first verification information sent by the proxy server;
the first determining module 402 may include:
the first determining unit is configured to determine a universal identifier corresponding to the first user terminal when the first authentication information and the second authentication information meet a first preset condition, where the second authentication information is information carried when the second server sends the first root identifier and the first hash value to the first server.
Fig. 5 is a schematic structural diagram of a general identifier generating apparatus according to an exemplary embodiment. The generation device of the universal identifier is applied to the second server. As shown in fig. 5, the second server-side apparatus 500 in the apparatus for generating a universal identifier may include:
a second receiving module 501, configured to receive a target request associated with a first user terminal;
a generating and acquiring module 502, configured to generate a first root identifier in response to the target request, and acquire a tag vector corresponding to the first user terminal, where the first root identifier is a unique identifier of the first user terminal;
a first generating module 503, configured to generate a first hash value according to a tag vector corresponding to the first user terminal, where the tag vector includes a vector value of at least one target service tag associated with a target service, and each service tag is configured to indicate a factor that affects whether a user accepts the target service;
and the second sending module 504 is configured to send the first root identifier and the first hash value to a first server, so that the first server determines, according to the first root identifier and the first hash value, a generic identifier corresponding to the first user terminal and sends the generic identifier to the first user terminal.
In some embodiments of the present application, to further improve the accuracy of obtaining the traffic label class, the apparatus 500 may further include:
the acquisition module is used for acquiring N preset service labels associated with the target service, wherein N is an integer greater than 1;
the clustering module is used for clustering the N preset service labels to obtain K service label categories, wherein K is an integer smaller than N;
and the second determining module is used for determining preset service tags meeting a second preset condition as target service tags in each service tag category in the K service tag categories to obtain at least one target service tag associated with the target service.
In some embodiments of the present application, in order to further improve accuracy of determining the target service label, the second determining module may include:
and the second determining unit is used for determining a preset business label closest to the center of the business label class as a target business label in each business label class in the K business label classes.
In some embodiments of the present application, to further improve the security and efficiency of sending the first root identifier, the first hash value, and the first verification information, the second receiving module 501 may include:
The receiving unit is used for receiving a target request sent by the proxy server and first verification information, wherein the first verification information is generated by the proxy server under the condition of receiving the target request sent by the first user terminal;
a first sending unit, configured to send the first root identifier and the first hash value to a first server, where the first sending unit includes:
and the second sending unit is used for sending the first root identifier, the first hash value and the first verification information to the first server.
Fig. 6 is a schematic diagram of a hardware structure of an electronic device according to another embodiment of the present application.
The device may include a processor 601 and a memory 602 in which programs or instructions are stored.
The steps of any of the various method embodiments described above are implemented when the processor 601 executes a program.
By way of example, a program may be partitioned into one or more modules/units that are stored in the memory 602 and executed by the processor 601 to perform the present application. One or more of the modules/units may be a series of program instruction segments capable of performing specific functions to describe the execution of the program in the device.
In particular, the processor 601 may include a Central Processing Unit (CPU), or an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), or may be configured as one or more integrated circuits that implement embodiments of the present application.
Memory 602 may include mass storage for data or instructions. By way of example, and not limitation, memory 602 may include a Hard Disk Drive (HDD), floppy Disk Drive, flash memory, optical Disk, magneto-optical Disk, magnetic tape, or universal serial bus (Universal Serial Bus, USB) Drive, or a combination of two or more of the above. The memory 602 may include removable or non-removable (or fixed) media, where appropriate. Memory 602 may be internal or external to the integrated gateway disaster recovery device, where appropriate. In a particular embodiment, the memory 602 is a non-volatile solid state memory.
The memory may include Read Only Memory (ROM), random Access Memory (RAM), magnetic disk storage media devices, optical storage media devices, flash memory devices, electrical, optical, or other physical/tangible memory storage devices. Thus, in general, the memory includes one or more tangible (non-transitory) readable storage media (e.g., memory devices) encoded with software comprising computer-executable instructions and when the software is executed (e.g., by one or more processors) it is operable to perform the operations described with reference to methods in accordance with aspects of the present disclosure.
The processor 601 implements any of the methods of the above embodiments by reading and executing programs or instructions stored in the memory 602.
In one example, the electronic device may also include a communication interface 603 and a bus 610. The processor 601, the memory 602, and the communication interface 603 are connected to each other through a bus 610 and perform communication with each other.
The communication interface 603 is mainly used for implementing communication between each module, apparatus, unit and/or device in the embodiment of the present application.
Bus 610 includes hardware, software, or both, coupling components of the online data flow billing device to each other. By way of example, and not limitation, the buses may include an Accelerated Graphics Port (AGP) or other graphics bus, an Enhanced Industry Standard Architecture (EISA) bus, a Front Side Bus (FSB), a HyperTransport (HT) interconnect, an Industry Standard Architecture (ISA) bus, an infiniband interconnect, a Low Pin Count (LPC) bus, a memory bus, a micro channel architecture (MCa) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a Serial Advanced Technology Attachment (SATA) bus, a video electronics standards association local (VLB) bus, or other suitable bus, or a combination of two or more of the above. Bus 610 may include one or more buses, where appropriate. Although embodiments of the application have been described and illustrated with respect to a particular bus, the application contemplates any suitable bus or interconnect.
In addition, in connection with the methods in the above embodiments, embodiments of the present application may be implemented by providing a computer-readable storage medium. The computer-readable storage medium has a program or instructions stored thereon; the program or instructions, when executed by a processor, implement any of the methods of the embodiments described above. The computer readable storage medium may be read by a machine such as a computer.
The embodiment of the application further provides a chip, which comprises a processor and a communication interface, wherein the communication interface is coupled with the processor, and the processor is used for running programs or instructions to realize the processes of the embodiment of the method, and can achieve the same technical effects, so that repetition is avoided, and the description is omitted here.
It should be understood that the chips referred to in the embodiments of the present application may also be referred to as system-on-chip chips, chip systems, or system-on-chip chips, etc.
Embodiments of the present application provide a computer program product stored in a readable storage medium, where the program product is executed by at least one processor to implement the respective processes of the above method embodiments, and achieve the same technical effects, and for avoiding repetition, a detailed description is omitted herein.
It should be understood that the application is not limited to the particular arrangements and instrumentality described above and shown in the drawings. For the sake of brevity, a detailed description of known methods is omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method processes of the present application are not limited to the specific steps described and shown, and those skilled in the art can make various changes, modifications and additions, or change the order between steps, after appreciating the spirit of the present application.
The functional blocks shown in the above-described structural block diagrams may be implemented in hardware, software, firmware, or a combination thereof. When implemented in hardware, it may be, for example, an electronic circuit, an Application Specific Integrated Circuit (ASIC), suitable firmware, a plug-in, a function card, or the like. When implemented in software, the elements of the application are the programs or code segments used to perform the required tasks. The program or code segments may be stored in a machine readable medium or transmitted over transmission media or communication links by a data signal carried in a carrier wave. A "machine-readable medium" may include any medium that can store or transfer information. Examples of machine-readable media include electronic circuitry, semiconductor memory devices, ROM, flash memory, erasable ROM (EROM), floppy disks, CD-ROMs, optical disks, hard disks, fiber optic media, radio Frequency (RF) links, and the like. The code segments may be downloaded via computer grids such as the internet, intranets, etc.
It should also be noted that the exemplary embodiments mentioned in this disclosure describe some methods or systems based on a series of steps or devices. However, the present application is not limited to the order of the above-described steps, that is, the steps may be performed in the order mentioned in the embodiments, or may be performed in a different order from the order in the embodiments, or several steps may be performed simultaneously.
Aspects of the present disclosure are described above with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and program products according to embodiments of the disclosure. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer programs or instructions. These programs or instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, enable the implementation of the functions/acts specified in the flowchart and/or block diagram block or blocks. Such a processor may be, but is not limited to being, a general purpose processor, a special purpose processor, an application specific processor, or a field programmable logic circuit. It will also be understood that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware which performs the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The embodiment of the application also provides a readable storage medium, and the readable storage medium stores a program or an instruction, which when executed by a processor, implements each process of the above-mentioned general identifier generating method embodiment, and can achieve the same technical effects, so that repetition is avoided, and no further description is provided herein.
Wherein the processor is a processor in the electronic device described in the above embodiment. The readable storage medium includes computer readable storage medium such as computer readable memory ROM, random access memory RAM, magnetic or optical disk, etc.
Embodiments of the present application provide a computer program product stored in a storage medium, where the program product is executed by at least one processor to implement the respective processes of the generating method embodiment of the generic identifier, and achieve the same technical effects, and are not described herein in detail for avoiding repetition.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element. Furthermore, it should be noted that the scope of the methods and apparatus in the embodiments of the present application is not limited to performing the functions in the order shown or discussed, but may also include performing the functions in a substantially simultaneous manner or in an opposite order depending on the functions involved, e.g., the described methods may be performed in an order different from that described, and various steps may be added, omitted, or combined. Additionally, features described with reference to certain examples may be combined in other examples.
From the above description of the embodiments, it will be clear to those skilled in the art that the above-described embodiment method may be implemented by means of software plus a necessary general hardware platform, but of course may also be implemented by means of hardware, but in many cases the former is a preferred embodiment. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art in the form of a computer software product stored in a storage medium (e.g. ROM/RAM, magnetic disk, optical disk) comprising instructions for causing a terminal (which may be a mobile phone, a computer, a server, or a network device, etc.) to perform the method according to the embodiments of the present application.
The embodiments of the present application have been described above with reference to the accompanying drawings, but the present application is not limited to the above-described embodiments, which are merely illustrative and not restrictive, and many forms may be made by those having ordinary skill in the art without departing from the spirit of the present application and the scope of the claims, which are to be protected by the present application.
Claims (9)
1. The method for generating the universal mark is characterized by comprising the following steps:
a first server receives a first root mark and a first hash value, wherein the first root mark is generated by a second server in response to a target request, the target request is associated with a first user terminal, the first root mark is a unique mark of the first user terminal, the first hash value is generated according to a tag vector corresponding to the first user terminal, the tag vector comprises a vector value of at least one target service tag associated with a target service, and each service tag is used for indicating whether a factor influencing whether a user accepts the target service exists or not;
the first server determines a universal identifier corresponding to the first user terminal according to the first root identifier and the first hash value;
the first server sends the generic identification to the first user terminal,
wherein, when the universal identifier further corresponds to at least one second user terminal, the universal identifier is used for indicating a proxy server to push the target service to the first user terminal and the at least one second user terminal, and a tag vector corresponding to each second user terminal is associated with a tag vector corresponding to the first user terminal;
Before the second server generates the first hash value, the second server is further configured to:
acquiring N preset service labels associated with the target service, wherein N is an integer greater than 1;
clustering the N preset service labels to obtain K service label categories, wherein K is an integer smaller than N;
determining a preset service label meeting a second preset condition as a target service label in each service label class in the K service label classes to obtain at least one target service label associated with target service;
the determining, in each of the K service label classes, a preset service label satisfying a second preset condition as a target service label includes:
and determining a preset business label nearest to the center of the business label class as a target business label in each business label class in the K business label classes.
2. The method of claim 1, wherein the determining the universal identifier corresponding to the first user terminal according to the first root identifier and the first hash value comprises:
under the condition that the first server is determined to have the universal identifier corresponding to the first hash value, acquiring the number of user terminals corresponding to the universal identifier, wherein the universal identifier is generated by the first server in advance according to a second root identifier and a second hash value, the second root identifier is a unique identifier of a target user terminal, the second hash value is generated according to a label vector corresponding to the target user terminal, the second hash value is the same as the first hash value, and the target user terminal is one of the at least second user terminals;
And under the condition that the number of the user terminals corresponding to the universal identification is smaller than the preset number, establishing a corresponding relation between the universal identification and the first user terminal according to the first root identification.
3. The method of claim 2, wherein the determining the universal identifier corresponding to the first user terminal according to the first root identifier and the first hash value further comprises:
and generating the universal identifier corresponding to the first user terminal according to the first hash value and the first root identifier under the condition that the first server does not have the universal identifier corresponding to the first hash value or the number of the user terminals corresponding to the universal identifier is equal to the preset number.
4. A method according to any one of claims 1 to 3, wherein the first root identity and the first hash value are generated by the second server upon receipt of a target request sent by the proxy server and first authentication information generated by the proxy server upon receipt of a target request sent by the first user terminal,
Before determining the universal identifier corresponding to the first user terminal according to the first root identifier and the first hash value, the method further comprises:
receiving first verification information sent by a proxy server;
the determining the universal identifier corresponding to the first user terminal comprises the following steps:
and under the condition that the first verification information and the second verification information meet a first preset condition, determining a universal identifier corresponding to the first user terminal, wherein the second verification information is information carried by the second server when sending the first root identifier and the first hash value to the first server.
5. The utility model provides a generation method of a universal mark, which is characterized in that the generation method is applied to a second server and comprises the following steps:
receiving a target request associated with a first user terminal;
generating a first root identifier in response to the target request, and acquiring a tag vector corresponding to the first user terminal, wherein the first root identifier is a unique identifier of the first user terminal;
generating a first hash value according to a tag vector corresponding to the first user terminal, wherein the tag vector comprises a vector value of at least one target service tag associated with a target service, and each service tag is used for indicating whether a factor influencing whether a user accepts the target service exists or not;
The first root identifier and the first hash value are sent to a first server, so that the first server determines a universal identifier corresponding to the first user terminal according to the first root identifier and the first hash value and sends the universal identifier to the first user terminal;
before generating the first hash value according to the tag vector corresponding to the first user terminal, the method further includes:
acquiring N preset service labels associated with the target service, wherein N is an integer greater than 1;
clustering the N preset service labels to obtain K service label categories, wherein K is an integer smaller than N;
determining a preset service label meeting a second preset condition as a target service label in each service label class in the K service label classes to obtain at least one target service label associated with target service;
the determining, in each of the K service label classes, a preset service label satisfying a second preset condition as a target service label includes:
and determining a preset business label nearest to the center of the business label class as a target business label in each business label class in the K business label classes.
6. The method of claim 5, wherein receiving the target request associated with the first user terminal comprises:
receiving a target request sent by a proxy server and first verification information, wherein the first verification information is generated by the proxy server under the condition of receiving the target request sent by the first user terminal;
the sending the first root identifier and the first hash value to the first server includes:
and sending the first root identification, the first hash value and the first verification information to a first server.
7. A device for generating a generic identifier, applied to a second server, said device comprising:
a second receiving module, configured to receive a target request associated with the first user terminal;
the generating and acquiring module is used for responding to the target request, generating a first root identifier and acquiring a label vector corresponding to the first user terminal, wherein the first root identifier is a unique identifier of the first user terminal;
the first generation module is used for generating a first hash value according to a label vector corresponding to the first user terminal, wherein the label vector comprises a vector value of at least one target service label associated with target service, and each service label is used for indicating whether a factor influencing whether a user accepts the target service exists or not;
The second sending module is used for sending the first root identifier and the first hash value to a first server so that the first server determines a universal identifier corresponding to the first user terminal according to the first root identifier and the first hash value and sends the universal identifier to the first user terminal;
before generating the first hash value according to the tag vector corresponding to the first user terminal, the device further includes:
the acquisition module is used for acquiring N preset service labels associated with the target service, wherein N is an integer greater than 1;
the clustering module is used for clustering the N preset service labels to obtain K service label categories, wherein K is an integer smaller than N;
a second determining module, configured to determine, in each of the K service label classes, a preset service label that meets a second preset condition as a target service label, to obtain at least one target service label associated with a target service;
the second determining module includes:
and the second determining unit is used for determining a preset business label closest to the center of the business label class as a target business label in each business label class in the K business label classes.
8. A device for generating a generic identifier, the device comprising: a processor and a memory storing computer program instructions;
the processor, when executing the computer program instructions, implements a method for generating a generic identifier as defined in any one of claims 1 to 4; alternatively, a method of generating a generic identifier as claimed in any one of claims 5 to 6.
9. A computer readable storage medium, wherein computer program instructions are stored on the computer readable storage medium, which when executed by a processor, implement a method of generating a generic identification according to any of claims 1 to 4; alternatively, a method of generating a generic identifier as claimed in any one of claims 5 to 6.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202310814303.6A CN116527758B (en) | 2023-07-05 | 2023-07-05 | Method, device, equipment, storage medium and product for generating universal identifier |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202310814303.6A CN116527758B (en) | 2023-07-05 | 2023-07-05 | Method, device, equipment, storage medium and product for generating universal identifier |
Publications (2)
Publication Number | Publication Date |
---|---|
CN116527758A CN116527758A (en) | 2023-08-01 |
CN116527758B true CN116527758B (en) | 2023-10-31 |
Family
ID=87403341
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202310814303.6A Active CN116527758B (en) | 2023-07-05 | 2023-07-05 | Method, device, equipment, storage medium and product for generating universal identifier |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN116527758B (en) |
Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105975272A (en) * | 2016-05-05 | 2016-09-28 | 北京元心科技有限公司 | Method and system for generating unique device number of device |
KR20200112771A (en) * | 2020-09-17 | 2020-10-05 | 주식회사 코인플러그 | Method for oauth service through blockchain, and terminal and server using the same |
CN114331552A (en) * | 2021-12-31 | 2022-04-12 | 深圳市博源电子商务有限公司 | Intelligent marketing system for user marketing based on big data analysis |
CN115344848A (en) * | 2022-07-20 | 2022-11-15 | 北京数牍科技有限公司 | Identification obtaining method, device, equipment and computer readable storage medium |
CN115345646A (en) * | 2022-07-20 | 2022-11-15 | 北京数牍科技有限公司 | Information sending method, device, equipment and computer readable storage medium |
CN115619454A (en) * | 2022-10-29 | 2023-01-17 | 武汉海云健康科技股份有限公司 | Member management system and method based on member middling station |
CN115809324A (en) * | 2022-12-20 | 2023-03-17 | 平安银行股份有限公司 | Business pushing method, device, server and computer readable storage medium |
-
2023
- 2023-07-05 CN CN202310814303.6A patent/CN116527758B/en active Active
Patent Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105975272A (en) * | 2016-05-05 | 2016-09-28 | 北京元心科技有限公司 | Method and system for generating unique device number of device |
KR20200112771A (en) * | 2020-09-17 | 2020-10-05 | 주식회사 코인플러그 | Method for oauth service through blockchain, and terminal and server using the same |
CN114331552A (en) * | 2021-12-31 | 2022-04-12 | 深圳市博源电子商务有限公司 | Intelligent marketing system for user marketing based on big data analysis |
CN115344848A (en) * | 2022-07-20 | 2022-11-15 | 北京数牍科技有限公司 | Identification obtaining method, device, equipment and computer readable storage medium |
CN115345646A (en) * | 2022-07-20 | 2022-11-15 | 北京数牍科技有限公司 | Information sending method, device, equipment and computer readable storage medium |
CN115619454A (en) * | 2022-10-29 | 2023-01-17 | 武汉海云健康科技股份有限公司 | Member management system and method based on member middling station |
CN115809324A (en) * | 2022-12-20 | 2023-03-17 | 平安银行股份有限公司 | Business pushing method, device, server and computer readable storage medium |
Also Published As
Publication number | Publication date |
---|---|
CN116527758A (en) | 2023-08-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN111954173B (en) | Method, device, server and computer readable storage medium for sending short message | |
CN115345646B (en) | Information transmission method, device, equipment and computer readable storage medium | |
CN114463012A (en) | Authentication method, payment method, device and equipment | |
CN116527758B (en) | Method, device, equipment, storage medium and product for generating universal identifier | |
CN104301893A (en) | Authentication method, mobile communication authentication platform and devices | |
CN116775110A (en) | Data synchronization method, device, equipment, medium and product | |
CN106162524B (en) | A kind of NFC operating method and device | |
CN112906411B (en) | Service processing method, user terminal, service equipment, system and storage medium | |
CN112560961A (en) | Target identification method and device based on graph clustering, electronic equipment and storage medium | |
CN111461118A (en) | Interest feature determination method, device, equipment and storage medium | |
CN115037484B (en) | Digital collection receiving method and device and electronic equipment | |
CN114708109B (en) | Risk recognition model training method, device, equipment and storage medium | |
TWI845151B (en) | Information verification method, device, equipment, medium and product | |
CN116188232B (en) | List query method, device, equipment, medium and product | |
CN111754235B (en) | Resource rollback method, device and equipment | |
CN117635156A (en) | Transaction request processing method, device, equipment and computer storage medium | |
CN117807632A (en) | Data desensitization method, device, electronic equipment, readable storage medium and product | |
CN110062019B (en) | Risk control method and terminal equipment | |
CN118828455A (en) | QCI calculation method, device, apparatus, storage medium and program product | |
CN117745352A (en) | Information processing method, device, equipment, medium and product | |
CN114661993A (en) | Information query method, device, equipment and computer readable storage medium | |
CN117527212A (en) | Information processing method, device, equipment and medium | |
CN118804062A (en) | Flow diversion method, device, electronic equipment and storage medium | |
CN115456203A (en) | XGboost model training method, device, equipment, storage medium and program product | |
CN116257592A (en) | Method and device for determining similar items of data items, electronic equipment and storage medium |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |