Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the technical solutions of the present application will be described in detail and completely with reference to the following specific embodiments of the present application and the accompanying drawings. It should be apparent that the described embodiments are only some of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
In the prior art, in addition to the manner of adding a friend mentioned in the background art, there is a manner of adding a friend based on a two-dimensional code, and specifically, after a first user logs in on an application client, a two-dimensional code may be generated according to personal information of the first user, and then a second user adds the first user as a friend by scanning the two-dimensional code. However, the method of adding friends based on the two-dimensional code also has a problem, and the first user and the second user need to use equipment supporting the two-dimensional code function, and generally involve switching between applications, which is poor in convenience.
The solution of the present application may solve the above problems and problems of the background art partially or completely. The following describes the scheme of the present application.
Generally, a user participating in a process of adding a friend has two users, or more than two users, and the scheme of the application is applicable to both of the two application scenarios. Since the process of adding friends among multiple users can also be decomposed into a process of adding friends among multiple users, for convenience of description, the scheme of the present application is mainly explained below based on an application scenario that "a user participating in a process of adding friends has two users".
In the embodiment of the present application, for the two users, one of the two users who adds the friend by itself is referred to as a "first user", and correspondingly, one of the two users who adds the friend by itself is referred to as a "second user". In this case, the process of adding buddies may involve three terminals, namely: the system comprises a server, a client of a first user and a client of a second user. The following describes the embodiments of the present application from the perspective of each of the three ends.
Fig. 1 is a process of a method for adding a friend according to an embodiment of the present application, where the process in fig. 1 is described from the perspective of a server, and an execution subject is the server. The server may be any server of an application having a friend function, the first user and the second user are users of the application, and the server is generally mounted on a server, where the server includes but is not limited to: personal computers, large and medium sized computers, computer clusters, etc. as servers. Applications with buddy functionality include, but are not limited to: an instant messaging type application, an e-commerce type application (such as an e-wallet application, a shopping application, etc.), an SNS type application, and the like.
The process in fig. 1 may specifically include the following steps:
s101: the server receives a friend password generation request of a first user.
In the embodiment of the application, the client of the first user and the client of the second user are both clients of the server, and the first user can send a friend password generation request of the first user to the server through the client of the first user.
In the embodiment of the application, the friend password may be a character string, and the characters included in the character string may specifically be numeric characters, english characters, chinese characters, and the like.
S102: the server side determines the identification information of the first user according to the friend password generation request of the first user, and generates the friend password of the first user according to the identification information of the first user.
In the embodiment of the present application, the identification information of the first user may be one or a combination of a plurality of information for uniquely identifying the first user (i.e., distinguishing the first user from other users). For example, the identification information of the first user may be an identification ID of the first user, a mailbox address of the first user, a user name specified by the first user, or the like, or may also be information such as a user number assigned to the first user by the server. The identification information of the first user may also be a combination of a plurality of kinds of these enumerated information. For convenience of description, the following embodiments mainly take the example that the identification information of the first user is the ID of the first user as an example.
The friend password generation request may carry related information of the first user, such as identification information of the first user. The server side responds to a received friend password generation request of a first user, generates a friend password of the first user according to identification information of the first user carried by the friend password generation request, and the friend password can uniquely correspond to the identification information of the first user in a valid period (if the valid period is set) of the friend password.
Certainly, the friend password generation request may not carry identification information of the first user, and in this case, the server may determine the identification information of the first user according to a communication condition (for example, detailed information of an established communication connection, and the like) between the server and the client of the first user, and then generate the friend password of the first user according to the identification information of the first user.
The process of generating the friend password by the server may specifically be a process of converting specific information by the server by using a predetermined information conversion algorithm to generate a character string as the friend password. The specific information may generally include identification information of the first user, in addition, other personal information (such as a cell phone number, etc.) of the first user, environment information (such as a request time corresponding to a friend password generation request, etc.), and the like. The information conversion algorithm is not limited in the present application, and the information conversion algorithm may be, for example, an algorithm for calculating a hash (hash) value, a server-side customized character mapping algorithm, various existing encryption algorithms, and the like.
In the case that the friend password is generated according to the identification information of the first user, it may be considered that the friend password implicitly includes the identification information of the first user, or implicitly includes information that can be used to determine the identification information of the first user. However, generally, only the server that generates the friend password may determine the identification information of the first user according to the friend password, but for the user, it is difficult for any user to determine the identification information of the first user according to the friend password.
S103: and the server returns the friend password of the first user to the first user so that the first user can share the friend password with a second user conveniently.
In the embodiment of the application, the server returns the generated friend password to the first user. For example, returning to the client of the first user, the client of the first user may display the friend password, and after seeing the friend password, the first user may share the friend password with the second user, so that the second user may add the first user as a friend based on the friend password.
When the first-type friend adding mode in the prior art is adopted, the first user needs to share the own identifier with the second user, and if the first user is supposed to share the own identifier with the second user by publishing the own identifier on a third-party platform (such as a microblog, a forum and the like) outside an application corresponding to the server, other irrelevant users may see the identifier of the first user besides the second user, so that the first user is equivalently that part of personal information of the first user is directly leaked, and is easily disturbed by other irrelevant users, and an information security risk exists.
As described above, since it is difficult for any user to determine the identification information of the first user according to the friend password, even if the user publishes the friend password on the third-party platform, the user cannot directly see the identification of the first user, and therefore, compared with the first-class friend adding manner in the prior art, the scheme of the present application can reduce the information security risk.
In the embodiment of the application, the first user can share the friend password to the second user in a verbal form, can share the friend password to the second user through the third-party platform, can share the friend password to the second user in a temporary conversation (a conversation between non-friends) form through the server, and the like. After the second user obtains the friend password, the friend password can be sent to the server through the client of the second user (this action may be equivalent to requesting the server to add the user corresponding to the friend password as a friend of the second user, and the user corresponding to the friend password is also the first user).
S104: and when receiving a friend adding request carrying the friend password of the first user, the server adds the first user as a friend of the second user according to the friend password and the identification information of the second user, wherein the friend adding request is a request of the second user.
In the embodiment of the application, after the first user shares the friend password with the second user, the second user can send the friend password to the server through the client of the second user.
As mentioned above, the friend password may be generated by the server using a predetermined information conversion algorithm, and accordingly, the server may also parse the friend password based on the information conversion algorithm to obtain the information implicit in the friend password, and determine the identification information of the first user based on the implicit information. Therefore, the server knows that the friend which the second user sends the friend password and wants to request to add is the first user, and further, the server can add the first user as the friend of the second user.
Further, in order to prevent irrelevant users other than the second user from adding the first user as a friend by using the friend password, the server may not directly add the first user as a friend of the second user after analyzing the friend password to obtain the identification information of the first user, but only add the first user as a friend of the second user after obtaining the agreement of the first user.
Similarly, in order to prevent other unrelated users from pretending that the first user shares friend passwords of other unrelated users with the second user, so as to mislead the second user to add other unrelated users as friends, after the server analyzes the friend password to obtain identification information of the first user, the server may notify the second user that the user corresponding to the friend password is indeed the first user, or may send predetermined information of the user corresponding to the friend password to the second user, so that the second user can determine whether the user corresponding to the friend password is the first user according to the predetermined information. The second user may send confirmation information to the server after determining that the user corresponding to the friend password is the first user, and then the server adds the first user as a friend of the second user after receiving the confirmation information. The predetermined information of the first user may be part or all of attribute information of the first user, for example, attribute information of the first user, such as a nickname, an age, a sex, a birthday, and the like.
The prior art may have other problems in addition to the above-mentioned problems. For example, since the number of users in many applications is huge at present, in the case that the identification information is an ID, the length of the ID of the user may be relatively long, so that, in the prior art, when the first user shares the ID of the first user with the second user in a verbal form, the second user is difficult to remember, and further, the convenience of adding friends is also affected. With regard to such a problem, the solution of the present application may also solve, specifically, even if the ID of the user is relatively long, but the length of the friend password generated by the server is controllable, and a short password having a length shorter (even much shorter) than the ID of the user may be generated by the server as the friend password, and generally, the short password is easier to memorize than the ID of the user, and thus, the solution of the present application may partially or completely solve the problem mentioned in this paragraph.
For example, assuming that the ID of the first user is a certain mailbox address abcdef @ fgh.com, which is relatively long and has a length of 14 characters, the server may generate a friend password having a length shorter than 14 characters by selecting an appropriate information conversion algorithm when performing step S101, for example, the generated friend password may be a 4-digit string "1234" similar to a short message authentication code or 6 may be a string "123456", may be 4 chinese character strings "i am happy", may be a 10-digit and english alphabet mixed string "12345 abcde", and so on.
In practical applications, the IDs of most users may be relatively long, but the IDs of a small number of users may be relatively short. If the server sets a fixed length for the generated friend password in advance, the length of the ID of most users is longer than that of the corresponding friend password, but the length of the ID of a small part of users is not longer than that of the corresponding friend password. For such a situation, the scheme of the application can still partially solve the problem that the opposite user is difficult to memorize and the convenience of adding friends is further influenced because the ID of the user may be longer.
Of course, in the scheme of the application, the length of the friend password may not be limited. Under the circumstance, the problem that information security risks exist in a friend adding mode in the prior art is still solved partially or completely without influencing the scheme of the application.
Through the method in fig. 1, in the process of adding a friend, a user does not need to directly publish an identification of the user, which means that personal information of the user cannot be directly disclosed, so that information security risks are reduced, other users can add the user as a friend by inputting a friend password submitted to the user for sharing, two-dimensional code function support is not needed, when the user shares the friend password in a spoken form, switching between applications does not need to be involved, and convenience is good. Moreover, the lengths of the friend passwords are controllable, and when the friend passwords are short passwords, the friend passwords can be shared orally by users conveniently, and other users can remember the friend passwords conveniently.
Based on the method in fig. 1, the present application also provides some specific embodiments of the method in fig. 1, and further embodiments, which are described below.
In practical application, the number of users of many applications is huge, the number of friend password generation requests received by the server may be large, and the friend passwords have limited lengths, but the server needs to generate different friend passwords for different users.
In the embodiment of the application, the survival time of the friend password can be recorded according to the request time corresponding to the friend password generation request or the time when the friend password is to be generated, and the server can record the time information for the subsequent process.
For example, the server may hide the time information in the friend password. Specifically, for step S102, generating a friend password of the first user according to the identification information of the first user may specifically include: and generating the friend password of the first user according to the identification information of the first user, the request time corresponding to the friend password generation request and/or the time when the server side needs to generate the friend password.
Of course, besides the time information, other personal information of the first user may also be hidden in the friend password, and the content of the information that can be hidden in the friend password generated in step S102 is not illustrated in this application one by one, as long as the service end can determine the identification information of the first user according to the friend password.
Further, for step S104, adding the first user as a friend of the second user according to the friend password and the identification information of the second user, specifically, the adding may include: analyzing the friend password to obtain identification information of the first user; and adding the first user as a friend of the second user according to the identification information of the first user and the identification information of the second user. Therefore, the recovery of the information hidden in the friend password is realized, and the process of adding friends can be completed.
In the embodiment of the application, when the server determines that the friend password corresponds to the identification information of the first user after receiving the friend adding request of the second user carrying the friend password of the first user, the server may add the first user as a friend of the second user after obtaining the agreement of the first user. Specifically, for step S104, according to the identification information of the first user and the identification information of the second user, before adding the first user as a friend of the second user, the following steps may be further performed: obtaining the preset information of the second user according to the identification information of the second user and sending the preset information to the first user, wherein the preset information of the second user comprises part or all attribute information of the second user; and receiving confirmation information returned by the first user aiming at the predetermined information of the second user. If the server side does not receive the confirmation information returned by the first user, the subsequent steps can not be executed.
In this embodiment of the application, for step S104, before adding the first user as a friend of the second user according to the identification information of the first user and the identification information of the second user, the following may be further performed: obtaining the preset information of the first user according to the identification information of the first user and sending the preset information to the second user; and receiving confirmation information returned by the second user aiming at the preset information of the first user. If the server does not receive the confirmation information returned by the second user, the subsequent steps may not be executed.
Through the scheme in the two sections, the information security risk can be further reduced, and the reliability and controllability of the process of adding friends are improved.
In the embodiment of the application, the friend password can be used for adding friends and realizing other services. Specifically, the friend password request of the first user sent to the server may simultaneously carry other service password generation requests, or directly send other service password generation requests to the server without sending the friend password generation request. For the former scheme, the server may only generate a friend password and carry the service type information in the friend password, wherein the service type information includes service type information corresponding to the service of "adding friend" and/or service type information corresponding to the other services; for the latter scheme, the server may generate other service passwords, and carry the service type information corresponding to the other services in the other service passwords. Therefore, the scheme of the application can be expanded to support other services.
For example, in the former scheme, when receiving the friend password sent by the second user, the server may execute a service corresponding to the service type information according to the friend password including the service type information.
It should be noted that, the manner of carrying the service type information in the friend password is not limited in the present application. Generally, the service type information may be saved by one or more characters in the friend password.
In the embodiment of the present application, it has been mentioned above that, for convenience, the friend password described in the present application may be a short password, and "short" herein may be relative to the length of the ID of the user. Specifically, in practical applications, the length of the friend password may be shorter than the length of the ID of the user corresponding to the friend password, or the length of the friend password may be shorter than the length of the IDs of most users, and so on, and of course, the scheme of the present application also allows such a situation to occur: the length of the ID of a small number of users is not longer than the length of their corresponding friend passwords.
Based on the same idea as that of the method in fig. 1, the present application further provides a method for adding a friend, which is described from the perspective of the client of the first user, and the process of the method is as shown in fig. 2.
The executing body of the process in fig. 2 is the client of the first user. The client of the first user is typically mounted on a terminal, including but not limited to: personal computers, cell phones, tablet computers, smart watches, vehicle-mounted mobile stations, and the like.
The process in fig. 2 may specifically include the following steps:
s201: and sending a friend password generation request of the first user to the server.
S202: and receiving a friend password of the first user generated and returned by the server according to the identification information of the first user, so that the first user shares the friend password with a second user, the second user sends a friend adding request carrying the friend password to the server, and the server adds the first user as a friend of the second user.
Through the method in fig. 2, in the process of adding a friend, a user does not need to directly publish an identification of the user, which means that personal information of the user cannot be directly disclosed, so that information security risks are reduced, other users can add the user as a friend by inputting a friend password shared by the user, devices where a client of a first user and a client of a second user are located do not need to be supported by a two-dimensional code function, when the user shares the friend password in a spoken form, switching between applications does not need to be involved, and convenience is good. Moreover, the lengths of the friend passwords are controllable, and when the friend passwords are short passwords, the friend passwords can be shared orally by users conveniently, and other users can remember the friend passwords conveniently.
In the embodiment of the present application, there are various ways for the first user to share the friend password with the second user, and two types are listed as examples below.
In the first type, a first user can share a friend password with a second user in a spoken form, and a client of the first user, a client of the second user and a server are not required to participate in the sharing process.
In the second category, the first user may share the friend password with the second user based on the third-party platform, and in the sharing process, the client of the first user and the client of the second user may be required to participate. The third-party platform may be another application or website, such as a microblog or a forum, other than the application corresponding to the client of the first user.
Taking the way of the friend password of the second type as an example, specifically, for step S202, after receiving the friend password of the first user returned by the server, the following steps may be further performed: and sharing the friend password of the first user to a third-party platform based on the sharing operation of the first user, so that the second user can conveniently acquire the friend password from the third-party platform.
Based on the same idea as that of the method in fig. 1, the present application further provides a method for adding a friend, which is described from the perspective of the client of the second user, and the process of the method is shown in fig. 3.
The executing body of the process in fig. 3 is the client of the second user. The client of the second user is typically mounted on a terminal, including but not limited to: personal computers, cell phones, tablet computers, smart watches, vehicle-mounted mobile stations, and the like.
The process in fig. 3 may specifically include the following steps:
s301: and acquiring a friend password of the first user, wherein the friend password is generated by the server side in response to a friend password generation request of the first user and according to the identification information of the first user.
S302: and sending a friend adding request carrying the friend password of the first user to the server, so that the server adds the first user as a friend of the second user according to the friend password and the identification information of the second user, wherein the friend adding request is a request of the second user.
Through the method in fig. 3, in the process of adding a friend, a user does not need to directly publish an identification of the user, which means that personal information of the user cannot be directly disclosed, so that information security risks are reduced, other users can add the user as a friend by inputting a friend password shared by the user, devices where a client of a first user and a client of a second user are located do not need to be supported by a two-dimensional code function, when the user shares the friend password in a spoken form, switching between applications does not need to be involved, and convenience is good. Moreover, the lengths of the friend passwords are controllable, and when the friend passwords are short passwords, the friend passwords can be shared orally by users conveniently, and other users can remember the friend passwords conveniently.
In the embodiment of the application, the first user can share the friend password with the second user in a verbal form, and then the second user can manually input the friend password on the client of the second user; the first user can also share the friend password with the second user based on the client of the first user and the third-party platform, and then the second user inputs the friend password on the client of the second user in a copying and pasting mode, or the client of the second user can also automatically identify and obtain the friend password, so that the mode is good in convenience.
For example, for step S301, acquiring a friend password may specifically include: receiving a friend password input by the second user; or actively identifying the friend password stored in the clipboard of the second user, wherein the friend password stored in the clipboard is copied by the second user from a third-party platform of the first user sharing the friend password.
In this embodiment, according to the above description of fig. 1, for step S302, after sending the friend addition request carrying the friend password of the first user to the server, the following may be further performed: receiving preset information of the first user returned by the server according to the friend password, and displaying the preset information of the first user to the second user, wherein the preset information of the first user comprises part or all attribute information of the first user; when the confirmation operation of the second user for the preset information is monitored, returning the confirmation information for the preset information to the server, so that the server can add the first user as a friend of the second user according to the friend password and the identification information of the second user. In this way, the second user can be prevented from mistakenly adding other irrelevant users except the first user as friends.
The scheme of the present application is explained above from three terminals, respectively. For convenience of understanding, the embodiment of the present application further provides an interactive schematic diagram of three terminals and a third-party platform when a part of the scheme of the present application is executed in an actual application scenario, as shown in fig. 4.
In fig. 4, the applications corresponding to the three terminals, i.e., the server, the client of the first user, and the client of the second user, are e-wallet applications, and the third-party platform for sharing the friend password is a microblog application.
The interaction process in fig. 4 may include the following steps:
s401: the client side of a first user of the electronic wallet application sends a friend password generation request of the first user to the server side.
The execution of step S401 may be triggered by the first user operating a preset control on the client of the first user. For example, the preset control may be a button control for requesting generation of a friend password, and when the first user clicks the button control, the execution of step S401 is triggered.
S402: and the server side of the electronic wallet application generates a friend password of the first user according to the ID of the first user and the request time.
The ID of the first user may be directly carried in the friend password generation request, or may be determined by the server in other manners.
S403: and the server side of the electronic wallet application returns the generated friend password of the first user to the client side of the first user.
S404: the method comprises the steps that a client side of a first user of the electronic wallet application shares a friend password of the first user to a microblog application platform based on sharing operation of the first user.
It should be noted that, instead of performing steps S404 and S405, the first user directly shares the friend password with the second user in a verbal form, so that the second user can manually input the friend password in the client of the second user, and further, the steps S406 may be performed continuously.
S405: the client side of a second user of the electronic wallet application obtains the friend password of the first user based on the input operation of the second user or the copying operation of the second user on the microblog application platform.
For example, the second user may copy a friend password on the microblog application platform (the friend password is stored in the clipboard after being copied), then open the client of the second user, and the client of the second user actively recognizes the friend password in the clipboard, or the second user may paste the copied friend password in a related interface of the client of the second user.
S406: and the client of the second user of the electronic wallet application sends a friend adding request carrying the friend password of the first user to the server.
S407: and the server side of the electronic wallet application analyzes the received friend password of the first user and determines the ID of the first user.
S408: and the server side of the electronic wallet application acquires the preset information of the first user according to the ID of the first user and returns the preset information to the client side of the second user.
S409: and the client of the second user of the electronic wallet application returns corresponding confirmation information to the server based on the confirmation operation of the second user on the predetermined information of the first user.
S410: and after receiving the confirmation information, the server of the electronic wallet application adds the first user as a friend of the second user.
Embodiments of the present application also provide a system architecture diagram that may be used to implement aspects of the present application, as shown in fig. 5.
In fig. 5, the password server is the server, the password client may be the client of the first user or the client of the second user, and a gateway may be provided between the password server and the password client. The password client side can comprise a data acquisition and business attribution component, a rule execution component, a protocol analyzer and the like, and the password server side can comprise a communication protocol component, a rule generator and the like.
The system in fig. 5 may support not only the service of adding a friend, but also other services. It can be seen that the first two characters of the password generated by the system in fig. 5 are service types (that is, carry service type information), and after receiving the password, the password service end may execute a service processing operation corresponding to the service type information according to the service type information carried by the password. For example, assuming that the service type information carried by the password corresponds to a friend adding service, the server may perform a friend adding operation accordingly.
The method for adding a friend provided by the embodiment of the present application is described in detail above, and based on the same idea, a corresponding device for adding a friend is also provided in the embodiment of the present application, as shown in fig. 6, fig. 7, and fig. 8.
Fig. 6 is a schematic structural diagram of a device for adding a buddy, which is located on a server and corresponds to fig. 1 according to an embodiment of the present application, where the device includes:
a request receiving module 601, configured to receive a friend password generation request of a first user;
a password generating module 602, configured to determine identification information of the first user according to the friend password generation request of the first user, and generate a friend password of the first user according to the identification information of the first user;
a password returning module 603, configured to return the friend password of the first user to the first user, so that the first user shares the friend password with a second user;
a friend adding module 604, configured to, when a friend adding request carrying a friend password of the first user is received, add the first user as a friend of the second user according to the friend password and the identification information of the second user, where the friend adding request is a request of the second user.
Optionally, the password generating module 602 is specifically configured to: and generating a friend password of the first user according to the identification information of the first user and the request time corresponding to the friend password generation request.
Optionally, the friend adding module 604 is specifically configured to: analyzing the friend password to obtain identification information of the first user; and adding the first user as a friend of the second user according to the identification information of the first user and the identification information of the second user.
Optionally, the friend adding module 604 is further configured to: before the first user is added as a friend of the second user according to the identification information of the first user and the identification information of the second user, obtaining the preset information of the first user according to the identification information of the first user and sending the preset information to the second user, wherein the preset information of the first user comprises part or all attribute information of the first user; and receiving confirmation information returned by the second user aiming at the preset information.
Optionally, the friend password includes service type information, and the apparatus further includes:
and the service processing module 605 is configured to, when the friend password sent by the second user is received, execute a service corresponding to the service type information according to the friend password containing the service type information.
Optionally, the identification information of the first user includes an identification ID of the first user, the friend password of the first user is a short password, and the length of the short password is shorter than the length of the identification information of the first user.
Fig. 7 is a schematic structural diagram of a device for adding a buddy, which is located on a client of a first user and corresponds to fig. 2 according to an embodiment of the present application, and includes:
a password request module 701, configured to send a friend password generation request of the first user to a server;
a password receiving module 702, configured to receive a friend password of the first user generated and returned by the server according to the identification information of the first user, so that the first user shares the friend password with a second user, and the second user sends a friend adding request carrying the friend password to the server, and the server adds the first user as a friend of the second user.
Optionally, the apparatus further comprises:
the password sharing module 703 is configured to, after the password receiving module receives the friend password of the first user returned by the server, share the friend password of the first user to a third-party platform based on the sharing operation of the first user, so that the second user can obtain the friend password from the third-party platform.
Fig. 8 is a schematic structural diagram of a device for adding a buddy, which is located on a client of a second user and corresponds to fig. 3 according to an embodiment of the present application, and specifically includes:
a password obtaining module 801, configured to obtain a friend password of a first user, where the friend password is generated by a server in response to a friend password generation request of the first user and according to identification information of the first user;
a password sending module 802, configured to send a friend adding request carrying the friend password of the first user to the server, so that the server adds the first user as a friend of the second user according to the friend password and the identification information of the second user, where the friend adding request is a request of the second user.
Optionally, the password obtaining module 801 is specifically configured to: receiving a friend password input by the second user; or,
and actively identifying the friend password stored in the clipboard of the second user, wherein the friend password stored in the clipboard is copied by the second user from a third-party platform of the first user sharing the friend password.
Optionally, the apparatus further comprises:
a confirming module 803, configured to receive, after the password sending module sends the friend password to the server, the predetermined information of the first user returned by the server according to the friend password of the first user, and display the predetermined information of the first user to the second user, where the predetermined information of the first user includes part or all of attribute information of the first user; when the confirmation operation of the second user for the preset information is monitored, returning the confirmation information for the preset information to the server, so that the server can add the first user as a friend of the second user according to the friend password and the identification information of the second user.
Through the device, in the process of adding the friend, a user does not need to directly publish own identification, namely personal information of the part of the user can not be directly disclosed, information security risks are reduced, other users can add the user as the friend by inputting a friend password shared by the user, two-dimensional code function support is not needed, when the user shares the friend password in a spoken form, switching among applications does not need to be involved, convenience is good, and therefore the scheme can partially or completely solve the problems in the prior art. Moreover, the lengths of the friend passwords are controllable, and when the friend passwords are short passwords, the friend passwords can be shared orally by users conveniently, and other users can remember the friend passwords conveniently.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, 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, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that 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 an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.