Methods and apparatuses for signing in or signing up a user

EP4460945A1Pending Publication Date: 2024-11-13SONY GROUP CORP +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
EP2022838863
Authority / Receiving Office
EP · EP
Patent Type
Applications
Current Assignee / Owner
Priority Date
2022-01-07
Filing Date
2022-12-22
Publication Date
2024-11-13

AI Technical Summary

Technical Problem

Conventional authentication methods for online services rely on weak user credentials, making them vulnerable to bypassing and ineffective in banning users, as they often use email addresses for authentication, which can be easily circumvented.

Method used

The method generates a user unique identifier based on a verifiable credential, such as an ID card number, and provides a proof of uniqueness, which is verified through a secure communication channel, ensuring the user identifier is unique and unchangeable, preventing multiple accounts and bypassing of banning policies.

Benefits of technology

This approach enhances user authentication by using strong, unique credentials, preventing users from creating multiple accounts and bypassing banning policies, while maintaining user privacy through zero-knowledge proofs and secure communication channels.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 1.1
    Figure 1.1
Patent Text Reader

Abstract

A method for signing in or signing up a user is provided. The method comprises receiving a request for signing in or signing up the user, receiving a user identifier and a proof indicating that the user identifier is user unique. The method further comprises determining whether the user identifier is listed in a user index. The method further comprises, if it is determined that the user identifier is listed in the user index, rejecting the request for signing in or signing up the user, and, if it is determined that the user identifier is not listed in the user index, signing in or signing up the user.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] METHODS AND APPARATUSES FOR SIGNING IN OR SIGNING UP A USER

[0002] Field

[0003] The present disclosure relates to authentication. Examples of the present disclosure relate to methods and apparatuses for signing in or signing up a user.

[0004] Background

[0005] When a user signs in or signs up to an online service, authentication is usually realized based on a weak credential of the user, e.g., an email address of the user. Thus, an authentication policy of the online service, e.g., for banning users, may be easily bypassed.

[0006] Hence, there may be a demand for improved authentication of a user.

[0007] Summary

[0008] This demand is met by apparatuses and methods in accordance with the independent claims. Advantageous embodiments are addressed by the dependent claims.

[0009] According to a first aspect, the present disclosure relates to a method for signing in or signing up a user. The method comprises receiving a request for signing in or signing up the user, receiving a user identifier and a proof indicating that the user identifier is user unique, and determining whether the user identifier is listed in a user index. The method further comprises, if it is determined that the user identifier is listed in the user index, rejecting the request for signing in or signing up the user, and, if it is determined that the user identifier is not listed in the user index, signing in or signing up the user.

[0010] According to a second aspect, the present disclosure relates to a method for signing in or signing up a user. The method comprises generating a user unique user identifier based on a verifiable credential of the user, generating a proof indicating that the user identifier is user unique, sending a request for signing in or signing up the user, and sending the user identifier and the proof. According to a third aspect, the present disclosure relates to an apparatus for signing in or signing up a user. The apparatus comprises interface circuitry configured to receive a request for signing in or signing up the user and receive a user identifier and a proof indicating that the user identifier is user unique. The apparatus further comprises processing circuitry configured to determine whether the user identifier is listed in a user index. The processing circuitry is further configured to, if it is determined that the user identifier is listed in the user index, reject the request for signing in or signing up the user and, if it is determined that the user identifier is not listed in the user index, sign in or sign up the user.

[0011] According to a fourth aspect, the present disclosure relates to an apparatus for signing in or signing up a user. The apparatus comprises processing circuitry configured to generate a user unique user identifier based on a verifiable credential of the user and generate a proof indicating that the user identifier is user unique. The apparatus further comprises interface circuitry configured to send a request for signing in or signing up the user and send the user identifier and the proof.

[0012] According to a fifth aspect, the present disclosure relates to a non-transitory machine- readable medium having stored thereon a program having a program code for performing the method for signing in or signing up the user, when the program is executed on a processor or a programmable hardware.

[0013] According to a sixth aspect, the present disclosure relates to a program having a program code for performing the method for signing in or signing up the user when the program is executed on a processor or a programmable hardware.

[0014] Brief description of the Figures

[0015] Some examples of apparatuses and / or methods will be described in the following by way of example only, and with reference to the accompanying figures, in which

[0016] Fig. 1 illustrates a flowchart of an example of a method for signing in or signing up a user; Fig. 2 illustrates a flowchart of another example of a method for signing in or singing up a user;

[0017] Fig. 3 illustrates an example of an apparatus for signing in or signing up a user;

[0018] Fig. 4 illustrates another example of an apparatus for signing in or signing up a user; and

[0019] Fig. 5 illustrates a signaling chart of an example of an interaction between a first apparatus for signing in or signing up a user and a second apparatus for signing in or signing up the user.

[0020] Detailed Description

[0021] Some examples are now described in more detail with reference to the enclosed figures. However, other possible examples are not limited to the features of these embodiments described in detail. Other examples may include modifications of the features as well as equivalents and alternatives to the features. Furthermore, the terminology used herein to describe certain examples should not be restrictive of further possible examples.

[0022] Throughout the description of the figures same or similar reference numerals refer to same or similar elements and / or features, which may be identical or implemented in a modified form while providing the same or a similar function. The thickness of lines, layers and / or areas in the figures may also be exaggerated for clarification.

[0023] When two elements A and B are combined using an “or”, this is to be understood as disclosing all possible combinations, i.e., only A, only B as well as A and B, unless expressly defined otherwise in the individual case. As an alternative wording for the same combinations, "at least one of A and B" or "A and / or B" may be used. This applies equivalently to combinations of more than two elements.

[0024] If a singular form, such as “a”, “an” and “the” is used and the use of only a single element is not defined as mandatory either explicitly or implicitly, further examples may also use several elements to implement the same function. If a function is described below as implemented using multiple elements, further examples may implement the same function using a single element or a single processing entity. It is further understood that the terms "include", "including", "comprise" and / or "comprising", when used, describe the presence of the specified features, integers, steps, operations, processes, elements, components and / or a group thereof, but do not exclude the presence or addition of one or more other features, integers, steps, operations, processes, elements, components and / or a group thereof.

[0025] Fig- 1 illustrates a flowchart of an example of a method 100 for signing in or signing up a user. The method 100 may be considered in the context of a computer network of several computer systems. The user may be able to exchange data with the computer systems via a technical endpoint controlled by the user and connected to the computer network. At least one of the computer systems may be configured to execute the method 100.

[0026] The user may intend to gain access to a service (e.g., a software application, an online service) provided by at least one computer system of the computer network. Before granting access, a security mechanism implemented into said computer system may require the user to identify or authenticate the user’s identity. The aforementioned “signing in” or “signing up” may be processes of the security mechanism wherein signing up (e.g., registering) comprises creating a user account, for example, when the user sends a request to gain access to the computer for the first time. For signing up, the security mechanism may query information about the user. The security mechanism may then assign access rights to the user according to a registration policy of the corresponding service. The user information linked to the access rights may be stored on a data storage. Signing in (e.g., logging in or signing on) may comprise authentication for temporarily (e.g., for a duration of a session) gaining access to the service. In some cases, signing in the user requires a prior sign-up of the user, for instance, if the authentication for signing in is based on the user information provided in the sign-up.

[0027] As used herein, the term “user” may be understood as any entity that could benefit from signing in or signing up. For example, the user may be one or more human beings, an organization, or a company. The user may alternatively be a machine, a subpart of a machine, or a software integrating an executable software application acting as artificial intelligence, for instance. The method 100 comprises receiving 110 a request for signing in or signing up the user. For instance, a device (e.g., smartphone, personal computer, wearable) controlled by the user may generate the request, e.g., based on an input of the user, and send it via a (computer) network to a computer system executing the method 100. The computer network may be e.g., the Internet, a local network, a wide area network (WAN), etc. The request, as well as other data exchanged between the device and the computer system, may be machine- readable data, in particular readable by the computer system and, thus, generated based on a shared communication protocol.

[0028] In the present disclosure, the terms “receiving” and “sending” are to be understood as using an interface to a computer network for communicating data from one network node of the computer network to another. The transfer of the data may be realized based on a technical infrastructure coupling the network nodes. For instance, the infrastructure may comprise a wired or wireless system carrying a physical (e.g., electromagnetic) signal encoding the data.

[0029] In some examples, receiving 110 the request for signing in or signing up the user comprises establishing a secure communication channel. The secure communication channel is established between a system executing the method 100 and a system sending the request. Establishing the secure communication channel may comprise verifying a digital identity of the user, e.g., based on public key cryptography or based on a verifiable credential implemented in a self-sovereign identity environment. The secure communication channel may secure authenticity of data exchanged via the secure communication channel and protect against eavesdropping. Sending data via the secure communication channel may comprise digitally signing and encrypting the data based on a private key of the sender and a public key of the receiver, receiving data via the secure communication channel may comprise verifying the signature and decoding the data based on a public key of the sender and a private key of the receiver.

[0030] The method 100 further comprises receiving 120 a user identifier and a proof indicating that the user identifier is user unique. In some examples, the user identifier and the proof are received via a secure communication channel as described above. The user identifier (user ID) may be a token uniquely identifying the user or a user account assigned to the user on a computer system. The computer system may use the user identifier for access control, i.e., for determining which computer resources are accessible for the user. The token may uniquely identify the user in the sense that, ideally, the computer system is able to map the user identifier to the user and prohibit authentication of another user based on the (same) user identifier. Assuming there is a plurality of users, the security mechanism may need to administer a plurality of user identifiers such that collisions of user identifiers do not occur.

[0031] A user identifier may make a user identifiable by a computer system, however, a conventional security mechanism of the computer system may lack means for preventing the same user from having multiple user identifiers. An objective of the present disclosure may be providing a verifiably user unique identifier for authenticating a user.

[0032] Independently from the embodiment illustrated by Fig. 1, a user identifier which is “user unique” is to be understood as user-specific or user-linked in a way that - given a plurality of user identifiers - (ideally) no other user identifier enables authentication of the user. User uniqueness may be paraphrased by unambiguousness, exact uniqueness or one-to-one correspondence between the user identifier and the user. In a mathematical analogy, if a plurality of user identifiers used for a service form the elements of a domain x of a mathematical function f and a plurality of users which eventually signed in or signed up for the service form the elements of a codomain y of the function, then - in the case of user unique user identifiers - the function is injective (or bijective), i.e., it maps distinct elements of the domain to distinct elements of the codomain, that is, f(xl)=f(x2) implying xl=x2. In other words, every element of the function's codomain is the image of at most one element of its domain. In case of bijection, the uniqueness of the user identifier is reversible or invertible such that 1. each user identifier is distinguishable among a plurality of user identifiers and belongs to at most one distinct user of a plurality of users, and 2. each user of the plurality of users is distinguishable and solely identifiable by one distinct user identifier. It is to be noted, that user uniqueness describes a condition that a user identifier has to meet, not by all means, but sufficiently for being considered user unique, i.e., the probability that a security mechanism verifying user uniqueness of a user identifier during authentication of the user is deceived or bypassed may be low (e.g., <0.01% or < 0.001%), e.g., due to tamper-resistance of the proof used for verification. For instance, a user identifier for identifying a person and appropriately complying with user uniqueness may be based on an identification token assigned to the person and administered by a trusted authority, such as a governmental authority. The identification token may be part of an identity document issued by the trusted authority. Alternatively, a user identifier may encode a genetic profile of the person for achieving user uniqueness. In case, a user to be identified is a company or an organization, for example, a tax identification number determined by a national tax authority or business identification number determined by a national statistics office may be used to generate a user identifier.

[0033] A conventional security mechanism of a service with high security or special legal requirements, such as online banking and share trading or investing services, may sign up a user by involving a human operator verifying the aforementioned identity document (ID card) of the user. These “manual” checks of identity may increase the duration and effort of authentication which may be impractical for a majority of services offered via a computer network including online gaming platforms, social media platforms, or online marketplaces. An objective of the present disclosure may be providing an automated verification of user uniqueness without involvement of a human operator.

[0034] As mentioned above, the method 100 comprises receiving 120 a user identifier and a proof indicating that the user identifier is user unique. The proof is any mathematical proof, e.g., proof by exhaustion or probabilistic proof, generated without the involvement of a human. The proof is a computed proof complying with a two-party computing protocol: first party: proving system, e.g., part of a system controlled by the user; second party: verifying system, e.g., part of a system executing the method 100. In particular, the proof is data that is provided by the proving system according to the protocol for “convincing” the verifying system that the proving system legitimately has knowledge proving the statement “the user identifier is user unique” is true. The proof may be a cryptographic proof satisfying completeness and soundness, i.e., if the statement is true, the honest verifier, that is, one following the protocol properly, can be convinced of this fact by an untrusted prover, and if the statement is false, the probability that a cheating prover can convince the honest verifier that the statement would be true is small. For instance, the proof may be generated based on an interactive proof system. The interactive proof system is an abstract machine modelling computation as exchange of messages between two parties: the proving system and the verifying system. The two parties interact by exchanging messages to ascertain whether a given string belongs to a formal language. The interactive proof system may, e.g., be based on a complexity class NP (non- deterministic polynomial-time), MA (Merlin-Arthur), AM (Arthur-Merlin), IP (interactive polynomial-time), or QIP (quantum interactive polynomial-time).

[0035] In some examples, the statement “the user identifier is user unique” may be verified based on a verifiable credential of the user. A verifiable credential may be realized in the context of self-sovereign identity (SSI). Such verifiable credential is data digitally signed by a trusted authority (issuer) which may enable tamper-resistant and time-efficient verification without a need of a centralized identity management. The issuer may provide the digital signature by applying a private key of a cryptographic key pair to the data, i.e., encoding the data based on the private key. The authenticity of the data may be verified based on a public key of the cryptographic key pair, i.e., by decoding the signed data based on the public key. A credential holder (the proving system) may establish a connection to another SSI-enabled party (e.g., the verifying system) and use the verifiable credential to gain access to a service provided by that party. The verifiable credential may, e.g., represent information provided by physical credentials, such as a passport or license.

[0036] Alternatively, the proof may indicate that the user identifier is based on the verifiable credential of the user without revealing the verifiable credential. For instance, the proof may be generated by selectively disclosing part of the verifiable credential, e.g., a certain attribute (field) of the credential, such as an ID card number of a digital ID card. This may be beneficial to secure privacy of the user (holder of the verifiable credential). For example, the holder may selectively disclose an ID card number of an ID card to prove user uniqueness of a user identifier generated based on the ID card number. In the latter case, other information linked to the ID card, such as age, date of birth, address, or phone number, is not revealed.

[0037] In some examples, the proof is a zero-knowledge proof. This may be beneficial for securing privacy of the user. The zero-knowledge proof is a cryptographic proof satisfying completeness, soundness, and zero-knowledge, i.e., if the statement “the user identifier is user unique” is true, the probability that the verifying system gets knowledge of a secret or wit- ness proving the statement, e.g., the ID card number, is negligibly small. The zeroknowledge proof may be based on the following protocol: A function C(x, w) is provided which returns a Boolean (true / false) depending on a statement (“the user identifier is user unique”) being true or false where x is a public input and w is a private input (witness). A proving system generates a proof p based on a function P(x, w) and a verifying system computes a verification based on a function V(x, p). C(x, w) and V(x, p) may be setup upfront and only once for a certain statement. P(x, w) and V(x, p) may be constructed such that V(x, p) returns a valid verification only when C(x, w) returns true. The proving system inputs one or more private inputs w into P. The private inputs, e.g., private key of the proving system and ID certificate digitally signed by a governmental authority, are accepted as proof of the statement by the verifying system. P and V have one or more public inputs such as the public key of the governmental authority.

[0038] In some examples, the method 100 further comprises determining if the proof is valid. If it is determined that the proof is not valid, the method 100 comprises rejecting the request for signing in or signing up the user. For instance, the above-mentioned function C may return a Boolean indicating that the statement is false. In the latter case, a system executing the method 100 may receive a proof p for which the function V(x, w) returns the Boolean false indicating that the proof is not valid..

[0039] The zero-knowledge proof may be of any type, e.g., a perfect zero-knowledge proof, a statistical zero-knowledge proof, a non-interactive zero-knowledge proof, or a computational zero-knowledge proof. The zero-knowledge proof may be based on any mathematical problem to be solved for proving the statement. For instance, the zero-knowledge proof may be based on a proof of knowledge (e.g., the secret is hidden in a discrete log), pairing-based cryptography (i.e., given an output of a known function f(x) and f(y), without knowing the secret inputs x and y, f(xxy) can be computed), or witness indistinguishable proof (a verifying system does not learn which witness of a known selection of witnesses is used for generating the proof).

[0040] In some examples, the method 100 comprises, upon receiving 110 the request for signing in or signing up the user, sending a use specific token. The proof may further indicate that the user identifier is based on the use specific token. For instance, the user identifier may be hash of a combination of an ID card number of the user and the use specific token. For gen- erating the proof, the proving system may use the use specific token as further public input to the function P. In some examples, the request is for signing in or signing up the user for an online service, e.g., an online gaming website with the name “anywebsite.com”. The use specific token may be specific for the online service, e.g., in the latter example, the use specific token may be “anywebsite.com”. Providing a use specific token for generating the user identifier may prevent the user to be forced using the same user identifier for authentication to several services and, therefore, prevent tracking of the user’s behavior across the several services.

[0041] Referring back to Fig. 1 : The method 100 further comprises determining 130 whether the user identifier is listed in a user index. The user index may be understood as a database for storing user identifiers, e.g., of already signed up users or of blacklisted users. Determining 130 whether the user identifier is listed in the user index may comprise accessing the database and search for a user identifier in the database matching the received user identifier.

[0042] The method 100 further comprises, if it is determined that the user identifier is listed in the user index, rejecting 140 the request for signing in or signing up the user. Rejecting 140 may, for example, comprise ignoring or discarding the request. The method 100 further comprises, if it is determined that the user identifier is not listed in the user index, signing in or signing up the user. Combining the user uniqueness of the user identifier and the user index may prevent the user to create multiple user accounts for the same service or, in case the user index is a blacklist, prevent a distrusted user to gain access to the service. In some examples, the request is for signing in or signing up the user for an online service, and the method 100 further comprises sharing the user index and the use specific token with at least one further online service. For instance, the user index may be administered by a third party or may be stored on a cloud server and jointly administered by the online services. The use specific token may designate a type of online service, e.g., gaming, trading, online community, etc. The use specific token may be shared among several online services of the same type. These online services may agree on a protocol for verifying user identifiers such that the user is forced to present the same user identifier to those online services during authentication. By sharing the user index, the method 100 may enable the online services to prevent one user to sign in or sign up to several similar online services, if unwanted by the online services, or to prevent a user blacklisted by a first online service to sign in or sign up to a second similar online service. In some examples, a system executing the method 100 or an external system may store the user index and provide full or restricted access to the user index. The system may be administered by a third party, for instance. Online services may send user identifiers of, e.g., banned users, to the system which, then, stores said user identifiers in a data storage. The system may hash the user identifiers, e.g., based on a cryptographic accumulator and store the hashed user identifiers. Determining 130 whether a specific user identifier is listed in the user index may comprise sending a query to lookup the user identifier to the system. The system may perform the lookup of the user identifier based on the user index and communicate a lookup result (whether the user identifier was found in the user index or not). The use of the cryptographic accumulator may prevent leakage of information about user identifiers not being explicitly queried. Additionally, the system may establish a restricted access to user identifiers, i.e., an online service may be rejected by the system when querying user identifiers of users which are not signed up to the querying online service.

[0043] The method 100 may address the difficulty of blocking or banning a user from an online service (e.g., a website). A conventional authentication mechanism may query an email address of a user for registering or signing in the user. If a peer of the online service decides to ban the user from the online service, the email address and, potentially, an IP address of a network node connecting the online service may be blacklisted. The user may easily circumvent the banning, e.g., by using a different email address for the registration, changing the IP address (e.g., by rebooting the router) or spoofing (e.g., using VPN, ToR, etc.). As a consequence, the conventional authentication mechanism may be incapable of providing a useful banning process.

[0044] In contrast, the method 100 may provide means for authenticating a user based on a user unique user identifier. The user identifier may reliably identify the user, i.e., it may be computed based on a strong credential (e.g., ID card of the user) and not on a relatively weak credential such as an email address. The user identifier may be deterministic, thus, the method 100 may prevent the user from signing in or signing up with a different token since the different token would be deemed invalid. A user trying to re-subscribe to the online service may be forced to present the same user identifier again, i.e., the user may be uncapable of bypassing a blacklist collecting banned user identifiers. For privacy preservation, the method 100 may allow the user to use a hash of a strong credential and prove its validity (user uniqueness) based on a zero-knowledge proof, thus, conceding the user not revealing possibly sensitive data. Additionally, the method 100 may provide authentication based on a use specific user identifier by sending a predefined string (e.g., determined by the online service) and verify that the string is included in the user identifier. Consequently, the method 100 may allow for separation between different online service environments in which the user identifier is used, which may enhance privacy protection for the user. In the latter case, the method 100 may still allow a shared banning policy, e.g., for online services of a similar type. The online services may then agree on using the same token format and mandate the token format as basis for generating the user identifier. For instance, if two websites for playing online chess agree on a token format, they may collaborate in banning cheaters: users banned on the first website may be hindered from accessing the second website, assuming the websites regularly synchronize their blacklists. This may be realized by token categories, e.g., the token format may be mandated as follows: use string “chess” when accessing chess-related websites, use string “betting” when accessing online betting services, use string “trading” when using trading services, etc. In this manner, the method 100 enables segmenting the user’s online life into well-separated categories.

[0045] Techniques disclosed herein generally refer to an interactive system of at least two parties of an enquirer, an authenticator and, optionally, one or more mediators between those two. Method 100 may rather relate to the authenticator, whereas a method rather relating to the enquirer is described with reference to Fig. 2.

[0046] Fig- 2 illustrates a flowchart of another example of a method 200 for signing in or signing up a user. While the method 100 described above may represent the “service side” of a sign- in or sign-up, i.e., the authenticating and verifying process, the method 200 may represent the “user side”, i.e., the requesting and proving process.

[0047] The method 200 comprises generating 210 a user unique user identifier based on a verifiable credential of the user. For instance, a user may intend to sign in or sign up for a service and may make an entry to an interface of a device connectable, e.g., via a computer system, to a system providing the service. The verifiable credential may be issued by a trusted authority, e.g., a governmental authority, and may be verifiable based on a digital signature linked to the credential and generated by the trusted authority. In some examples, the verifiable credential comprises at least one user unique attribute determined by the trusted authority and generating 210 the user identifier comprises hashing the user unique attribute. For instance, a predefined hashing function may be applied to an ID card number of a digital ID card. A hash of the ID card number may be used as user identifier. Since the hashing function may be infeasible or difficult to invert, the ID card number may be non-extractable from the user identifier, thus, remain secret. However, conventional hashing functions like SHA256 may be too easy and quick to compute: Trying a few billion possibilities for deriving the original secret may require little effort and brute-forcing may be parallelized. Instead, a more secure hashing function may be used, e.g., a memory-hard hash functions like Argon2, which may make brute-forcing harder and slower and thwart enumeration attacks.

[0048] Hashing the user unique attribute may comprise, e.g., applying a key derivation function to the user unique attribute. A key derivation function is a cryptographic algorithm which derives one or more secret keys from a secret value, such as the ID card number. The key derivation function may be used to stretch a key into a longer key or to obtain a key of a required format, such as converting a key of a Diffie-Hellman key exchange into a symmetric key complying AES (Advanced Encryption Standard).

[0049] The user unique attribute used for deriving the user identifier may be of a low (Shannon) entropy which may compromise the user’s privacy. For such cases, the method 200 may provide alternatives to mitigate the low entropy. For instance, the verifiable credential (or a different verifiable credential) of the user may comprise at least one user non-unique attribute. Generating 210 the user identifier may, then, further comprise hashing the user nonunique attribute. Such user-non unique attribute may be date of birth, phone number, address, etc., of the user. By concatenating the user unique and user-non unique attributes, the hash function may provide harder-to-guess information. Alternatively, the verifiable credential comprises a cryptographic nonce determined by the trusted authority. For instance, a governmental authority may issue the cryptographic nonce along with the digital ID card. The cryptographic nonce may be random and solely used for the verifiable credential, thus, be completely unrelated to the user. Generating 210 the user identifier may, then, further comprise hashing the cryptographic nonce. This may prevent attackers to compromise the user’s privacy based on physical credentials of the user or on knowledge of persons knowing the user in real life.

[0050] In some examples, the method 200 further comprises receiving a use specific token. Generating 210 the user unique user identifier may be further based on the use specific token. The use specific token may be provided by the service the user aims to sign in or sign up for. For instance, for authenticating the user on an online chess gaming website based on the ID card number of the user, the hash formula of the user identifier may be described by: Hash(ID card number | ... | cryptographic nonce) | “anywebsite.com”), where “anywebsite.com” is the use specific token.

[0051] Referring back to Fig. 2: The method 200 further comprises generating 220 a proof indicating that the user identifier is user unique. The proof may be generated based on an interactive or non-interactive proving protocol described with reference to Fig. 1. The proof may further indicate that the user identifier is based on a use specific token, e.g., determined by a system authenticating the user. In some examples, the proof is a zero-knowledge proof.

[0052] The proof may further be based on a cryptographic commitment scheme and / or a cryptographic accumulator. A cryptographic commitment scheme is a cryptographic primitive allowing to commit to a chosen value or statement, e.g., that the user identifier is user unique or based on a certain verifiable credential, while keeping the value or statement hidden to others, with the ability of revealing the committed value later. The cryptographic commitment schemes are designed to make the value or statement unchangeable after the commitment, that is, the cryptographic commitment scheme is binding. This may allow the user to sign in or sign up without - at least at first - presenting a secret (e.g., the ID card number) for authentication. A cryptographic accumulator is a one-way membership hash function certifying that a value is a member of a certain set without revealing the individual values of the set. In this manner, the proof may show that the user identifier is part of a verifiable credential comprising the secret without revealing the secret itself.

[0053] The method 200 further comprises sending 230 a request for signing in or signing up the user and sending 240 the user identifier and the proof. In some examples, sending 230 the request for signing in or signing up the user comprises establishing a secure communication channel. The user identifier and the proof may, then, be sent 240 via the secure communication channel.

[0054] The method 200 may improve authentication of a user for online services. The method 200 may enable authentication based on a strong, user unique, unchangeable credential of the user. Consequently, the method 200 may prevent the user from creating more than one user account or from bypassing a banning policy of the online services. The method 200 may furthermore protect the user’s privacy by generating a hard-to-crack user identifier and a validity proof which keeps secrets of the user hidden.

[0055] Fig. 3 illustrates an example of an apparatus 300 for signing in or signing up a user. The apparatus 300 comprises interface circuitry 310 communicatively coupled to processing circuitry 320. For example, the processing circuitry 320 may be a single dedicated processor, a single shared processor, or a plurality of individual processors, some of which or all of which may be shared, a digital signal processor (DSP) hardware, an application specific integrated circuit (ASIC) or a field programmable gate array (FPGA). The processing circuitry 320 may optionally be coupled to, e.g., read only memory (ROM) for storing software, random access memory (RAM) and / or non-volatile memory.

[0056] The interface circuitry 310 is configured to receive a request for signing in or signing up the user and receive a user identifier and a proof indicating that the user identifier is user unique. The processing circuitry 320 is configured to determine whether the user identifier is listed in a user index and, if it is determined that the user identifier is listed in the user index, reject the request for signing in or signing up the user. The processing circuitry 320 is further configured to, if it is determined that the user identifier is not listed in the user index, sign in or sign up the user.

[0057] More details and aspects of the apparatus 300 are explained in connection with the proposed technique or one or more examples described above, e.g., with reference to Fig. 1. The apparatus 300 may comprise one or more additional optional features corresponding to one or more aspects of the proposed technique, or one or more examples described above. The apparatus 300 may be configured to execute a method for signing in or singing up a user, such as the method 100.

[0058] Fig- 4 illustrates another example of an apparatus 400 for signing in or signing up a user. The apparatus 400 comprises interface circuitry 410 communicatively coupled to processing circuitry 420. The processing circuitry 420 is configured to generate a user unique user identifier based on a verifiable credential of the user and generate a proof indicating that the user identifier is user unique. The interface circuitry 410 is configured to send a request for signing in or signing up the user and send the user identifier and the proof. More details and aspects of the apparatus 400 are explained in connection with the proposed technique or one or more examples described above, e.g., with reference to Fig. 2. The apparatus 400 may comprise one or more additional optional features corresponding to one or more aspects of the proposed technique, or one or more examples described above. The apparatus 400 may be configured to execute a method for signing in or singing up a user, such as the method 200.

[0059] Fig- 5 illustrates a signaling chart of an example of an interaction 500 between a first apparatus 510 for signing in or signing up a user 515 (user side) and a second apparatus 520 for signing in or signing up the user 515 (service side).

[0060] The first apparatus 510 is integrated into a computer system with an interface, e.g., keyboard or touchpad, for communication with the user 515. The computer system is connected to the second apparatus 520 via a computer network, e.g., the Internet. The user 515 may intend to sign in or sign up to a service provided by the second apparatus 520. This service is in the example shown in Fig. 5 a chess gaming platform with the URL (Uniform Resource Locator) “anywebsite.com”. In a first step 530, the first apparatus 510 fetches a QR-code 522 (Quick Response) or a hyperlink of the service from the second apparatus 520. The first apparatus 510, e.g., upon an entry of the user 515 (such as a scan of QR-code 522 or a click on hyperlink-icon), establishes a secure communication channel in form of an SSI-trusted connection. For instance, a digital wallet 516 may be executed on the computer system. The digital wallet 516 is a program for generating and storing keys and credentials for SSI- trusted connections between the user 515 and a second party. Further interactions between the first apparatus 510 and the second apparatus 520 may base on the secure communication channel, thus, data exchanged may be cryptographically secured (encrypted) and digitally signed for proving sender authenticity.

[0061] In a second step 540, the second apparatus 520 requests a person-unique token (a user unique user identifier) computed as Hash(ID card number |“anywebsite.com”), thus, the second apparatus 520 mandates a scheme for hashing an unknown user secret (the ID card number) for authentication in the sign-in or sign-up process. Thereupon, the first apparatus 510 generates the requested user identifier based on a verifiable credential (VC) such as a government-issued digital ID card by hashing the ID card number of the digital ID card ac- cording to the mandated scheme. Besides, the first apparatus 510 generates a proof indicating that the user identifier is user unique, i.e., proving that the user identifier has been generated based on the verifiable credential.

[0062] In a third step 550, the first apparatus 510 sends the user identifier (token) and the proof (proof of token validity) to the second apparatus 520. The second apparatus 520 may, then, verify the validity of the user identifier based on the proof and check whether the user identifier is listed in a user index. The second apparatus 520 may reject or accept the request of the user for signing in or signing up to the service based on the verification and comparison with the user index.

[0063] Assuming the user 515 is registered on “anywebsite.com” and uses a computer program to calculate moves for chess matches, moderators of the website “anywebsite.com” may eventually notice that the user’s winning rate is unnaturally high. The moderators may close the user’s account for banning the user 515. In this case, the user identifier of the user 515 may be added to the user index. If the user 515 tried to sign in or sign up again, the user 515 would be forced to present the same user identifier again, the second apparatus 520 would recognize the user identifier as member of the user index and reject the request of the user 515 to sign in or sign up.

[0064] Apparatuses and methods disclosed herein may improve authentication of a user for online services. They may enable authentication based on a strong, user unique, unchangeable credential of the user. Consequently, the user is prevented from creating more than one user account or from bypassing a banning policy of the online services. The apparatuses and methods may furthermore protect the user’s privacy by providing a protocol to generate a hard-to-crack user identifier and a validity proof which keeps secrets of the user hidden. A blacklist of undesired users may, optionally, be shared among several online services or be specified for a certain online service.

[0065] The following examples pertain to further embodiments:

[0066] (1) A method for signing in or signing up a user, comprising receiving a request for signing in or signing up the user, receiving a user identifier and a proof indicating that the user identifier is user unique, determining whether the user identifier is listed in a user index. The method further comprises, if it is determined that the user identifier is listed in the user index, rejecting the request for signing in or signing up the user and, if it is determined that the user identifier is not listed in the user index, signing in or signing up the user.

[0067] (2) The method of (1), wherein the proof is a zero-knowledge proof.

[0068] (3) The method of (1) or (2), wherein the proof indicates that the user identifier is based on a verifiable credential of the user without revealing the verifiable credential.

[0069] (4) The method of any one of (1) to (3), further comprising, upon receiving the request for signing in or signing up the user, sending a use specific token, wherein the proof further indicates that the user identifier is based on the use specific token.

[0070] (5) The method of (4), wherein the request is for signing in and signing up the user for an online service, and wherein the use specific token is specific for the online service.

[0071] (6) The method of (4) or (5), wherein the request is for signing in or signing up the user for an online service, and wherein the method further comprises sharing the user index and the use specific token with at least one further online service.

[0072] (7) The method of any one of (1) to (6), wherein receiving the request for signing in or signing up the user comprises establishing a secure communication channel, and wherein the user identifier and the proof are received via the secure communication channel.

[0073] (8) The method of any one of (1) to (7), further comprising determining if the proof is valid; and, if it is determined that the proof is not valid, rejecting the request for signing in or signing up the user.

[0074] (9) A method for signing in or signing up a user, comprising generating a user unique user identifier based on a verifiable credential of the user, generating a proof indicating that the user identifier is user unique, sending a request for signing in or signing up the user, and sending the user identifier and the proof. (10) The method of (9), wherein the verifiable credential comprises at least one user unique attribute determined by a trusted authority, and wherein generating the user identifier comprises hashing the user unique attribute.

[0075] (11) The method of (10), wherein the verifiable credential is issued by the trusted authority.

[0076] (12) The method of (10) or (11), wherein the verifiable credential further comprises at least one user non-unique attribute, and wherein generating the user identifier further comprises hashing the user-non unique attribute.

[0077] (13) The method of any one of (10) to (12), wherein the verifiable credential further comprises a cryptographic nonce determined by the trusted authority, and wherein generating the user identifier further comprises hashing the cryptographic nonce.

[0078] (14) The method of any one of (10) to (13), wherein hashing the user unique attribute comprises applying a key derivation function to the user unique attribute.

[0079] (15) The method of any one of (9) to (14), further comprising receiving a use specific token, wherein generating the user unique user identifier is further based on the use specific token, and wherein the proof further indicates that the user identifier is based on the use specific token.

[0080] (16) The method of any one of (9) to (15), wherein sending the request for signing in or signing up the user comprises establishing a secure communication channel, and wherein the user identifier and the proof are sent via the secure communication channel.

[0081] (17) The method of any one of (9) to (16), wherein generating the proof is based on a cryptographic commitment scheme and / or a cryptographic accumulator.

[0082] (18) The method of any one of (9) to (17), wherein the proof is a zero-knowledge proof.

[0083] (19) An apparatus for signing in or signing up a user, comprising interface circuitry configured to receive a request for signing in or signing up the user and receive a user identifier and a proof indicating that the user identifier is user unique. The apparatus further comprises processing circuitry configured to determine whether the user identifier is listed in a user index, if it is determined that the user identifier is listed in the user index, reject the request for signing in or signing up the user and, if it is determined that the user identifier is not listed in the user index, sign in or sign up the user.

[0084] (20) An apparatus for signing in or signing up a user, comprising processing circuitry configured to generate a user unique user identifier based on a verifiable credential of the user and generate a proof indicating that the user identifier is user unique. The apparatus further comprises interface circuitry configured to send a request for signing in or signing up the user and send the user identifier and the proof.

[0085] (21) A non-transitory machine-readable medium having stored thereon a program having a program code for performing the method of any one of (1) to (18), when the program is executed on a processor or a programmable hardware.

[0086] (22) A program having a program code for performing the method of any one of (1) to (18) when the program is executed on a processor or a programmable hardware.

[0087] The aspects and features described in relation to a particular one of the previous examples may also be combined with one or more of the further examples to replace an identical or similar feature of that further example or to additionally introduce the features into the further example.

[0088] Examples may further be or relate to a (computer) program including a program code to execute one or more of the above methods when the program is executed on a computer, processor, or other programmable hardware component. Thus, steps, operations, or processes of different ones of the methods described above may also be executed by programmed computers, processors, or other programmable hardware components. Examples may also cover program storage devices, such as digital data storage media, which are machine-, processor- or computer-readable and encode and / or contain machine-executable, processorexecutable or computer-executable programs and instructions. Program storage devices may include or be digital storage devices, magnetic storage media such as magnetic disks and magnetic tapes, hard disk drives, or optically readable digital data storage media, for example. Other examples may also include computers, processors, control units, (field) pro- grammable logic arrays ((F)PLAs), (field) programmable gate arrays ((F)PGAs), graphics processor units (GPU), application-specific integrated circuits (ASICs), integrated circuits (ICs) or system-on-a-chip (SoCs) systems programmed to execute the steps of the methods described above.

[0089] It is further understood that the disclosure of several steps, processes, operations, or functions disclosed in the description or claims shall not be construed to imply that these operations are necessarily dependent on the order described, unless explicitly stated in the individual case or necessary for technical reasons. Therefore, the previous description does not limit the execution of several steps or functions to a certain order. Furthermore, in further examples, a single step, function, process, or operation may include and / or be broken up into several sub-steps, -functions, -processes or -operations.

[0090] If some aspects have been described in relation to a device or system, these aspects should also be understood as a description of the corresponding method. For example, a block, device or functional aspect of the device or system may correspond to a feature, such as a method step, of the corresponding method. Accordingly, aspects described in relation to a method shall also be understood as a description of a corresponding block, a corresponding element, a property or a functional feature of a corresponding device or a corresponding system.

[0091] The following claims are hereby incorporated in the detailed description, wherein each claim may stand on its own as a separate example. It should also be noted that although in the claims a dependent claim refers to a particular combination with one or more other claims, other examples may also include a combination of the dependent claim with the subject matter of any other dependent or independent claim. Such combinations are hereby explicitly proposed, unless it is stated in the individual case that a particular combination is not intended. Furthermore, features of a claim should also be included for any other independent claim, even if that claim is not directly defined as dependent on that other independent claim.

Claims

22ClaimsWhat is claimed is:

1. A method for signing in or signing up a user, comprising: receiving a request for signing in or signing up the user; receiving a user identifier and a proof indicating that the user identifier is user unique; determining whether the user identifier is listed in a user index; if it is determined that the user identifier is listed in the user index, rejecting the request for signing in or signing up the user; and if it is determined that the user identifier is not listed in the user index, signing in or signing up the user.

2. The method of claim 1, wherein the proof is a zero-knowledge proof.

3. The method of claim 1, wherein the proof indicates that the user identifier is based on a verifiable credential of the user without revealing the verifiable credential.

4. The method of claim 1, further comprising: upon receiving the request for signing in or signing up the user, sending a use specific token, wherein the proof further indicates that the user identifier is based on the use specific token.

5. The method of claim 4, wherein the request is for signing in and signing up the user for an online service, and wherein the use specific token is specific for the online service.

6. The method of claim 4, wherein the request is for signing in or signing up the user for an online service, andwherein the method further comprises sharing the user index and the use specific token with at least one further online service.

7. The method of claim 1, wherein receiving the request for signing in or signing up the user comprises establishing a secure communication channel, and wherein the user identifier and the proof are received via the secure communication channel.

8. The method of claim 1, further comprising: determining whether the proof is valid; and if it is determined that the proof is not valid, rejecting the request for signing in or signing up the user.

9. A method for signing in or signing up a user, comprising: generating a user unique user identifier based on a verifiable credential of the user; generating a proof indicating that the user identifier is user unique; sending a request for signing in or signing up the user; and sending the user identifier and the proof.

10. The method of claim 9, wherein the verifiable credential comprises at least one user unique attribute determined by a trusted authority, and wherein generating the user identifier comprises hashing the user unique attribute.

11. The method of claim 10, wherein the verifiable credential is issued by the trusted authority.

12. The method of claim 10, wherein the verifiable credential further comprises at least one user non-unique attribute, andwherein generating the user identifier further comprises hashing the user-non unique attribute.

13. The method of claim 10, wherein the verifiable credential further comprises a cryptographic nonce determined by the trusted authority, and wherein generating the user identifier further comprises hashing the cryptographic nonce.

14. The method of claim 10, wherein hashing the user unique attribute comprises applying a key derivation function to the user unique attribute.

15. The method of claim 9, further comprising: receiving a use specific token, wherein generating the user unique user identifier is further based on the use specific token, and wherein the proof further indicates that the user identifier is based on the use specific token.

16. The method of claim 9, wherein sending the request for signing in or signing up the user comprises establishing a secure communication channel, and wherein the user identifier and the proof are sent via the secure communication channel.

17. The method of claim 9, wherein generating the proof is based on a cryptographic commitment scheme and / or a cryptographic accumulator.

18. The method of claim 9, wherein the proof is a zero-knowledge proof.

19. An apparatus for signing in or signing up a user, comprising: interface circuitry configured to: receive a request for signing in or signing up the user; and receive a user identifier and a proof indicating that the user identifier is user unique; and25 processing circuitry configured to: determine whether the user identifier is listed in a user index; if it is determined that the user identifier is listed in the user index, reject the request for signing in or signing up the user; and if it is determined that the user identifier is not listed in the user index, sign in or sign up the user.

20. An apparatus for signing in or signing up a user, comprising: processing circuitry configured to: generate a user unique user identifier based on a verifiable credential of the user; and generate a proof indicating that the user identifier is user unique; and interface circuitry configured to: send a request for signing in or signing up the user; and send the user identifier and the proof.