EP3731115B1 - Réseau de vérification de données de registres répartis - Google Patents

Réseau de vérification de données de registres répartis Download PDF

Info

Publication number
EP3731115B1
EP3731115B1 EP20171096.9A EP20171096A EP3731115B1 EP 3731115 B1 EP3731115 B1 EP 3731115B1 EP 20171096 A EP20171096 A EP 20171096A EP 3731115 B1 EP3731115 B1 EP 3731115B1
Authority
EP
European Patent Office
Prior art keywords
hash
computer
authorizing entity
user
verification
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
EP20171096.9A
Other languages
German (de)
English (en)
Other versions
EP3731115A1 (fr
Inventor
Viralkumar SANGHAVI
Kartik KAPADIA
Sejal PANCHAL
Mary FLOREN
Sukrit HANDA
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Visa International Service Association
Original Assignee
Visa International Service Association
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Visa International Service Association filed Critical Visa International Service Association
Publication of EP3731115A1 publication Critical patent/EP3731115A1/fr
Application granted granted Critical
Publication of EP3731115B1 publication Critical patent/EP3731115B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources
    • H04L63/102—Entity profiles
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/30—Authentication, i.e. establishing the identity or authorisation of security principals
    • G06F21/31—User authentication
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2228—Indexing structures
    • G06F16/2255—Hash tables
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees

Definitions

  • User verification may be done before processes with some authorizing entities. For example, a user may be verified before receiving security clearance, initiating a financial relationship, or entering a secure area. Verification may be an intensive process that consumes significant resources. The verification process may include verifying information with many different organizations such as financial institutions and government offices. When a user is involved in multiple verification processes, each authorizing entity may repeat the same information. This can lead to unnecessary duplication of work, wasting both time and computational resources. Additionally, verification may be done with sensitive user information, such as a social security number. More efficient and secure methods of verifying information about users are needed. Related prior art is disclosed by patent document WO2018222211 disclosing authentication based on a comparison of the derivative of a second biometric template to a derivative of a first biometric template.
  • Embodiments of the invention address these and other problems individually and collectively.
  • One embodiment of the invention includes receiving, by a server computer, from a first authorizing entity computer, a first hash of information about a user and/or an indication of the first hash of information about the user, wherein the user or information about the user has been verified by the first authorizing entity computer, and the first hash is stored in a first database.
  • the method then includes storing, by the server computer, a location of the first hash in the first database in a location database, the first database being separate and distinct from the location database.
  • the method includes receiving, by the server computer, from a second authorizing entity computer, a verification request message about the user, the verification request message comprising a second hash of information about the user and retrieving, by the server computer, the first hash from the first database using the location of the first hash.
  • the method then includes comparing, by the server computer, the first hash to the second hash to determine if the first hash and the second hash match and determining, by the server computer, that the first hash and the second hash match.
  • the method includes sending, by the server computer, a verification response message to the second authorizing entity computer, the verification response message comprising verification data that the user was previously verified.
  • Another embodiment of the invention includes a server computer comprising a processor and a computer-readable medium, coupled to the processor, for implementing a method that includes receiving, from a first authorizing entity computer, a first hash of information about a user and/or an indication of the first hash of information about the user, wherein the user or information about the user has been verified by the first authorizing entity computer, and the first hash is stored in a first database. The method then includes storing a location of the first hash in the first database in a location database, the first database being separate and distinct from the location database.
  • the method includes receiving from a second authorizing entity computer, a verification request message about the user, the verification request message comprising a second hash of information about the user and retrieving the first hash from the first database using the location of the first hash.
  • the method then includes comparing the first hash to the second hash to determine if the first hash and the second hash match and determining that the first hash and the second hash match.
  • the method includes sending a verification response message to the second authorizing entity computer, the verification response message comprising verification data that the user was previously verified.
  • Another embodiment of the invention includes receiving, by an authorizing entity computer, information from a user and generating, by the authorizing entity computer, a hash of the information from the user.
  • the method then includes sending, by the authorizing entity computer to a server computer, a verification request message comprising the hash and receiving, by the authorizing entity computer from the server computer, a verification response message comprising verification data that the user has been previously verified.
  • the method includes storing, by the authorizing entity computer, the hash in a shared database and storing, by the authorizing entity computer, the information in a verification database.
  • Another embodiment of the invention includes an authorizing entity computer comprising a processor and a computer-readable medium, coupled to the processor, for implementing a method that includes receiving information from a user and generating a hash of the information from the user. The method then includes sending, to a server computer, a verification request message comprising the hash and receiving, from the server computer, a verification response message comprising verification data that the user has been previously verified. Then the method includes storing the hash in a shared database and storing the information in a verification database.
  • Embodiments provide systems and methods for verifying users based upon a verification that was previously performed by another authorizing entity.
  • an authorizing entity can verify the user without having to complete a full verification process. This can reduce the computational time and resources spent on verification, while maintaining a high level of confidence in the verification.
  • a server computer can be an intermediary between an authorizing entity that has verified a user and another authorizing entity that is attempting to verify the user. The server computer can also assess the authorizing entities to determine the strength of their verification.
  • Embodiments also maintain the security of the information used in the verification process.
  • user verification may be performed with sensitive data (e.g., a social security number), and sharing sensitive data to perform a verification process can expose the sensitive data to unauthorized entities.
  • sensitive data e.g., a social security number
  • the sensitive data that is used in the verification process is securely hashed to prevent leaking the information beyond the entities that have received the data directly from the user.
  • embodiments of the invention can be used when verifying the identity of an individual.
  • a government entity e.g., the TSA or transportation security agency
  • the user may want to verify themselves to a bank to open an account at the bank.
  • Embodiments can allow the bank to leverage the information verified by the government entity to verify the user to open the account.
  • Embodiments may also be used to verify the identity of a business or organization.
  • a "user” may include an individual, a business, an organization, etc.
  • a user may be associated with one or more personal accounts and/or mobile devices.
  • the user may be a cardholder, account holder, or consumer.
  • a "user device” may be any suitable electronic device that can process and communicate information to other electronic devices.
  • the user device may include a processor and a computer-readable medium coupled to the processor, the computer-readable medium comprising code, executable by the processor.
  • the user device may also each include an external communication interface for communicating with each other and other entities. Examples of user devices may include a mobile device, a laptop or desktop computer, a wearable device, etc.
  • a "payment processing network” may be data processing subsystems, networks, and operations used to support and deliver authorization services, exception file services, and clearing and settlement services.
  • An exemplary payment processing system may include VisaNet TM .
  • Payment processing systems such as VisaNet TM are able to process credit card transactions, debit card transactions, and other types of commercial transactions.
  • Authorization, settlement, and clearing may be done at the same time (substantially simultaneously, e.g., within a few minutes or hours) or may be done as part of a batch settlement process (e.g., at the end of the day or week).
  • the payment processing network may include a server computer.
  • a server computer is typically a powerful computer or cluster of computers.
  • the server computer can be a large mainframe, a minicomputer cluster, or a group of server computers functioning as a unit.
  • the server computer may be a database server computer coupled to a Web server computer.
  • the payment processing network may use any suitable wired or wireless network, including the internet.
  • a "server computer” may be a powerful computer or cluster of computers.
  • the server computer can be a large mainframe, a minicomputer cluster, or a group of servers functioning as a unit.
  • the server computer may be a database server coupled to a Web server.
  • a "processor” may include any suitable data computation device or devices.
  • a processor may comprise one or more microprocessors working together to accomplish a desired function.
  • the processor may include CPU comprises at least one high-speed data processor adequate to execute program components for executing user and/or system-generated requests.
  • the CPU may be a microprocessor such as AMD's Athlon, Duron and/or Opteron; IBM and/or Motorola's PowerPC; IBM's and Sony's Cell processor; Intel's Celeron, Itanium, Pentium, Xeon, and/or XScale; and/or the like processor(s).
  • a “memory” may be any suitable device or devices that can store electronic data.
  • a suitable memory may comprise a non-transitory computer-readable medium that stores instructions that can be executed by a processor to implement a desired method. Examples of memories may comprise one or more memory chips, disk drives, etc. Such memories may operate using any suitable electrical, optical, and/or magnetic mode of operation.
  • a "distributed ledger” may include a database that is shared among multiple nodes across a network. Entities corresponding to each node may store identical copies of the ledger at a given time. The entities may have permission to make changes or additions to the ledger. When the ledger is changed, the participating entities may receive the updated ledger.
  • An example of a distributed ledger can include a blockchain, wherein transactions are verified before being recorded to the blockchain in a block of transactions.
  • Identity information may include information that can be used to identify an entity. Some identity information may be information that is uniquely associated with an entity, such as an address, a tax identifier, a driver's license number, etc. Some identity information may be information that secret and known only by entity and/or a few entities, such as a social security number, a PIN, etc.
  • Verification may include establishing the truth, accuracy, or validity of something. Verification can include confirming that an entity is who they say they are. Verification may also include assessing the accuracy of information. In order to verify an entity, identity information about the entity may be verified.
  • a "verification request message” may be a message requesting verification of a user.
  • the verification request message may be sent by an authorizing entity during a verification process to a server computer.
  • a verification request message may include information about the user that is to be verified, in plaintext or as hashed data.
  • the verification request message may also include an identifier of the user that is to be verified.
  • a "verification response message” may be a message with a response to a verification request message.
  • the verification response message may include verification data (e.g., a cryptogram) that indicates that an entity is verified.
  • the verification response message may alternatively indicate that the entity is not verified.
  • the verification response message may be sent by a server computer to an authorizing entity computer.
  • a “hash” may be the output of a hashing function.
  • a hash may be a piece of data (e.g., a string) of fixed size (e.g., 256 bits).
  • a hash may refer to a collection of hashed data.
  • a name, age, and address may be hashed separately to form a hashed name, a hashed age, and a hashed address.
  • the hashed name, hashed age, and hashed address may be referred to collectively as a "hash" in some circumstances.
  • An "indication of a hash” may be an indicator of a hash.
  • the indication may be that a hash was generated and/or that the hash was stored in a database. Examples of an indication may include a digital signature or cryptogram using a cryptographic key held by an authorizing entity computer.
  • the indication of a hash may also include a location of the hash in the database.
  • FIG. 1 is a block diagram of a system 100 according to embodiments. For simplicity of illustration, a certain number of components are shown in FIG. 1 . It is understood, however, that embodiments of the invention may include more than one of each component. In addition, some embodiments of the invention may include fewer than or more than all of the components shown in FIG. 1 . For example, embodiments of the invention may have more than two authorizing entity computers and more than two shared databases.
  • the system 100 may comprise a user device 120, first and second authorizing entity computers 110A, 110B, a server computer 140, and a location database 145.
  • the first and second authorizing entity computers 110A, 110B may be associated with first and second verification databases 115A, 115B and first and second shared databases 135A, 135B, respectively.
  • Each database may be a conventional, fault tolerant, relational, scalable, secure database such as those commercially available from Oracle TM or Sybase TM .
  • any of the databases may be combined into a single database, or may be separated into multiple databases.
  • the user device 120, the first and second authorizing entity computers 110A, 110B, the first and second verification databases 115A, 115B, the first and second shared databases 135A, 135B, the server computer 140, and the location database 145 may all be in operative communication with each other through any suitable communication channel or communications network.
  • Suitable communications networks may be any one and/or the combination of the following: a direct interconnection; the Internet; a Local Area Network (LAN); a Metropolitan Area Network (MAN); an Operating Missions as Nodes on the Internet (OMNI); a secured custom connection; a Wide Area Network (WAN); a wireless network (e.g., employing protocols such as, but not limited to a Wireless Application Protocol (WAP), I-mode, and/or the like); and/or the like.
  • WAP Wireless Application Protocol
  • Messages between the computers, networks, and devices may be transmitted using a secure communications protocols such as, but not limited to, File Transfer Protocol (FTP), Hypertext Transfer Protocol (HTTP), Secure Hypertext Transfer Protocol (HTTPS), Secure Socket Layer (SSL), ISO (e.g., ISO 8583) and/or the like.
  • FTP File Transfer Protocol
  • HTTP Hypertext Transfer Protocol
  • HTTPS Secure Hypertext Transfer Protocol
  • SSL Secure Socket Layer
  • ISO e.g., ISO 8583
  • the user device 120 may be operated by a user (not shown).
  • the user may be an individual, a business, or another entity.
  • the user device 120 may store identity information about the user. Examples of identity information may include a social security number, an address, a tax identifier, a driver's license number, etc.
  • the user device 120 may also store an identifier of the user (e.g., a name, an identification number).
  • the first and second authorizing entity computers 110A, 110B can verify information about the user received from the user device 120.
  • the authorizing entity computers 110A-B may perform verification processes and may authorize requests from users that have been verified.
  • the first and second authorizing entity computers 110A, 110B may be operated by authorizing entities such as government agencies, banks, and/or businesses.
  • the first authorizing entity computer 110A may have or be in communication with a first verification database 115A and the second authorizing entity computer 110B may have or be in communication with a second verification database 115B.
  • the verification databases 115A, 115B may store verified information about the user, including verified identity information.
  • the first and second verification databases 115A and 115B may also store indications that users are verified. Indications of user verification may include, but are not limited to cryptograms, verification dates, digital signatures, etc.
  • the first and second verification databases 115A, 115B may be physically and/or logically separated from shared databases 135A, 135B. For example, each database may be on separate physical computers physically remote from each other.
  • the server computer 140 may manage verification processes and/or can facilitate interactions between verification processes.
  • the server computer 140 may be part of a payment processing network.
  • the server computer 140 may also be part of a verification service.
  • the server computer 140 may share a shared database 135A, 135B with an authorizing entity computer 110A, 110B.
  • the server computer 140 may share the first shared database 135 with the first authorizing entity computer 110A.
  • the server computer 140 may also share the second shared database 135B with the second authorizing entity computer 110B.
  • Each shared database 135A, 135B may store hashed identity information from users.
  • First and second authorizing entity computers 110A and 110B may be able to write data to the first and second shared databases 135A and 135B, respectively.
  • first authorizing entity computer 110A may be able to write data to first shared database 135A but not have access to second shared database 135B. Access to the first and second shared databases 135A, 135B by outside entities can be based on permissioned access.
  • the shared databases may have any suiable characteristics.
  • each shared database 135A, 135B may have a shared database identifier.
  • the shared database 135A and/or 135B may include a distributed ledger (e.g., a blockchain).
  • the shared databases 135A, 135B, and the server computer 140 and the associated authorizing entity computer 110A and/or 110B may be nodes in a distributed ledger system in some embodiments.
  • the server computer 140 may have or may be in communication with location database 145.
  • the location database 145 may store locations in the shared databases 135A, 135B of hashed identity information about the user. Locations may include row numbers, pointers, database keys, etc. In some embodiments, the location database 145 can also store trust scores about authorizing entity computers 110A-B. The location database 145 may be separate and distinct from the first and second shared databases 135A, 135B.
  • FIG. 2 shows a block diagram of authorizing entity computer 110.
  • Authorizing entity computer 110 may be representative of the previously described first authorizing entity computer 110A or second authorizing entity computer 110B.
  • the authorizing entity computer 110 may comprise a memory 112, a processor 114, a network interface 116, and a computer-readable medium 118.
  • Computer-readable medium 118 may store code executable by the processor 114 for implementing some or all of the functions of authorizing entity computer 110 described herein.
  • the computer-readable medium 118 may include a verification module 118A, a hashing module 118B, and a request module 118C.
  • the memory 112 may be implemented using any combination of any number of non-volatile memories (e.g., flash memory) and volatile memories (e.g., DRAM, SRAM), or any other non-transitory storage medium, or a combination of media.
  • non-volatile memories e.g., flash memory
  • volatile memories e.g., DRAM, SRAM
  • the processor 114 may be implemented as one or more integrated circuits (e.g., one or more single core or multicore microprocessors and/or microcontrollers). The processor 114 may be used to control the operation of the authorizing entity computer 110. The processor 114 can execute a variety of programs in response to program code or computer-readable code stored in memory 112. The processor 114 may include functionality to maintain multiple concurrently executing programs or processes.
  • the network interface 116 may be configured to connect to one or more communication networks to allow authorizing entity computer 110 to communicate with other entities such as a user device 120, a server computer 140, etc.
  • communication with the server computer 140 can be direct, indirect, and/or via an API.
  • Some examples of network interface 116 may include a modem, a physical network interface (such as an Ethernet card or other Network Interface Card (NIC)), a virtual network interface, a communications port, a Personal Computer Memory Card International Association (PCMCIA) slot and card, or the like.
  • the wireless protocols enabled by network interface 116 may include Wi-Fi TM .
  • the verification module 118A in conjunction with the processor 114, can verify information about users.
  • the verification module 118A in conjunction with the processor 114, can receive identity information about a user (e.g., an address, a driver's license number), and then determine sources to verify the identity information.
  • identity information about a user e.g., an address, a driver's license number
  • the verification module 118A may determine a state government that can verify a driver's license number about a user based on the format of the number.
  • the verification module 118A in conjunction with the processor 114, may determine if the user can be verified based on the information.
  • the verification module 118A in conjunction with the processor 114, may determine that the user can be verified because 95% of the information provided by the user has been verified by trusted sources.
  • the verification module 118A in conjunction with the processor 114, may also generate an indication that the user has been verified.
  • the verification module 118A and the processor 114 may generate a digital signature or cryptogram using a cryptographic key held by the authorizing entity computer 110 as proof that a user has been verified.
  • the hashing module 118B in conjunction with the processor 114, can hash information.
  • the hashing module 118B, in conjunction with the processor 114, may use a cryptographic hashing algorithm (e.g., SHA-256).
  • the hashing module 118B, in conjunction with the processor 114 may use different hashing algorithms for different types of identity information. For example, an address and a social security number may be hashed to strings of different length.
  • the request module 118C in conjunction with the processor 114, may generate verification request messages.
  • a verification request message may comprise an identifier of a user (e.g., a user name) and hashed identity information received from a user device 120.
  • the verification request message may also indicate a type of the identity information. For example, "1" may indicate a "name,” "2" may indicate a social security number, etc.
  • the request module 118C in conjunction with the processor 114, may also send the verification request message to an external computer such as the previously described server computer 140.
  • FIG. 3 shows a block diagram of server computer 140 according to an embodiment.
  • the server computer 140 may comprise a memory 142, a processor 144, a network interface 146, and a computer-readable medium 148. These components may be similar to or different than the corresponding components in the authorizing computer 110 FIG. 2
  • Computer-readable medium 148 may store code executable by the processor 144 for implementing some or all of the functions of server computer 140 described herein.
  • computer-readable medium 148 may include a look-up module 148A, a hash comparison module 148B, a trust determination module 148C, and a integration module 148D.
  • the server computer 140 may also include or be in communication with a location database 145.
  • the look-up module 148A may look up hashed identity information about a user.
  • the look-up module 148A in conjunction with the processor 144, can use a user identifier to determine a location of a hash of information from the location database 145.
  • the look-up module 148A in conjunction with the processor 144, may also determine the shared database where one or more hashes are stored.
  • the look-up module 148A in conjunction with the processor 144, can then use the location obtained from the location database 145 to retrieve a hash from a shared database 135A-B.
  • the look-up module 148A in conjunction with the processor 144, may determine whether to retrieve a plurality of hashes from a plurality of shared databases. For example, the look-up module 148A, in conjunction with the processor 144, may determine that hashes of the address of the user are in multiple shared databases associated with different authorizing entities. As another example, the look-up module 148A, in conjunction with the processor 144, may determine that a plurality of shared databases contain hashes of different types of identity information about the user (e.g., a hashed address may be in one shared database and a hashed tax ID may be in another, different shared database).
  • a hashed address may be in one shared database and a hashed tax ID may be in another, different shared database.
  • the hash comparison module 148B may compare hashed identity information.
  • the hash comparison module 148B may receive hashed identity information from a verification request message and verify it against hashed identity information from a shared database. For example, it may compare received hashed identity information with stored hashed identity information, and then verify that the received hashed identity information is authentic.
  • the hash comparison module 148B in conjunction with the processor 144, may generate verification data based in the result of the hash comparison. Examples of verification data may include a cryptogram or code indicating that the hashed identity information matches the verified hashed identity information.
  • the trust determination module 148C may determine trust scores for authorizing entities which may interact with a user.
  • a trust score may indicate the strength of a verification process performed by an authorizing entity.
  • the trust score may be a score between 0 and 1, where a higher value indicates a more rigorous (and therefore trustworthy) verification process.
  • the trust score may depend on, for example, the identity of the authorizing entity, the number of users that the authorizing entity is associated with, the amount of information that has been verified by the authorizing entity, and the number of verification request messages sent by the authorizing entity. For example, a large authorizing entity that verifies thousands of users each day may receive a trust score of 0.95 while an authorizing entity that has only verified a few entities may receive a trust score of 0.45.
  • the trust score may also depend on the method by which the authorizing entity verifies information. For example, a government agency that verifies information about a user by comparing the information with government records may receive a high trust score. Alternatively, a company that verifies information about a user using a social media profile of the user may receive a low trust score.
  • the trust determination module may store a trust score for each authorizing entity. In some embodiments, the trust score may be stored in the location database 145.
  • the integration module 148D may integrate information of the hash comparison module 148B and the trust determination module 148C to verify the user.
  • the integration module 148D in conjunction with the processor 144, can make a determination about verifying the user. For example, if the hash comparison module 148B determines that hashed identity information matches verified hashed identity information from a first authorizing entity computer 110A, and the trust determination module 148C determines a high trust score for the first authorizing entity, then the integration module 148D, in conjunction with the processor 144, can determine that the user is verified. Alternatively, the integration module 148D may determine that the user is not verified if the hashes do not match and/or the authorizing entity has a low trust score.
  • step S102 the user may initiate a verification process with a first authorizing entity operating the first authorizing entity computer 110A.
  • the first authorizing entity computer 110A may receive identity information about a user from a user device 120.
  • the user may be, for example, an individual or a business and the first authorizing entity computer 110A may be operated by, for example, an authorizing entity such as a government agency or a bank.
  • the user may be a person seeking to open an account at a bank that operates the first authorizing entity computer 110A.
  • the information sent by the user device 120 may include identity information (e.g., a social security number, a tax identifier, an address).
  • identity information e.g., a social security number, a tax identifier, an address.
  • the user device 120 may also send an identifier of the user (e.g., an ID number, a name).
  • the identifier of the user may be separate from the identity information and may allow the user to be identified during the verification process without using sensitive identity information.
  • the first authorizing entity computer 110A may verify the identity information from the user device 120.
  • the identity information may be verified by the first authorizing entity computer 110A using a verification processes, such as a KYC (know your customer) process.
  • the first authorizing entity computer 110A can compare the identity information to legal documents or government records from an external data source (e.g., a government database).
  • the first authorizing entity computer 110A can store the verified identity information in a first verification database 115A.
  • the verified identity information may be stored in the first verification database 115A in plaintext or may be encrypted with an encryption key known to the first authorizing entity computer 110A.
  • the first authorization entity computer 110A may store a hash of the verified identity information, such as a hash generated in step S106.
  • the first authorizing entity computer 110A may hash the verified identity information to generate a first hash.
  • the first authorizing entity computer 110A may generate the first hash using a hashing function, in particular a cryptographic hashing function (e.g., SHA-256) to hash the verified identity information.
  • the first authorizing entity computer 110A may then store the first hash in the first shared database 135A.
  • the first hash may be stored with the identifier of the user at a location in the shared database 135A.
  • the location may be, for example, a memory pointer, a database key, or a row number.
  • the first authorizing entity computer 110A may also send the first hash to the server computer 140.
  • the server computer 140 may receive an indication of the first hash of identity information about the user.
  • the indication may be a notification that the first hash has been stored in the first shared database 135A by the first authorizing entity computer 110A.
  • the indication may be received from the first authorizing entity computer 110A.
  • the indication may be received from the first shared database 135A (e.g., the server computer 140 may receive a notification whenever the first shared database 135A is modified).
  • the indication may also include a location of the first hash in the first shared database 135A.
  • the location may be a row number, pointer, or database key.
  • the server computer 140 may determine the location of the first hash in the first shared database 135A, for example, by identifying recently added information in the first shared database 135A.
  • the server computer 140 may also receive the first hash directly from the first authorizing entity computer 110A.
  • the server computer 140 may also receive the identifier of the user.
  • the server computer 140 may then store the location of the first hash in the first shared database 135A in a location database 145, with the identifier of the user.
  • the server computer 140 may also store a trust score for the first authorizing entity 110A in the location database 145.
  • the first shared database 135A may be separate and distinct from the location database 145.
  • the first database 135A and the location database 145 may be on separate computers.
  • the second authorizing entity computer 110B may receive identity information about the user from the user device 120.
  • the user device 120 may also send the identifier of the user to the second authorizing entity computer 110B.
  • the identity information that the user device 120 sends to the second authorizing entity computer 110B may be the same identity information that the user device 120 sent to the first authorizing entity computer 110A. Additionally, or alternatively, there may be information that the user device 120 sends to the second authorizing entity computer 110B that was not sent to the first authorizing entity computer 110A, and vice versa.
  • the user device 120 may send a driver's license number and an address to the first authorizing entity computer 110A, and a social security number and the address to the second authorizing entity computer 110B.
  • the identity information sent by the user device 120 may depend on requirements set by each authorizing entity.
  • the user may wish to open a second banking account at a second bank operating the second authorizing entity computer 110B.
  • the information needed to open the second banking account may be similar to the information needed to open the first banking account at the first bank operating the first authorizing entity computer 110A.
  • the second authorizing entity computer 110B may hash the identity information to generate a second hash.
  • the second authorizing entity computer 110B may hash the identity information from the user device 120 using the same hashing function as the first authorizing entity computer 110A.
  • the second authorizing entity may use SHA-256.
  • the second authorizing entity computer 110B may then store the second hash in the second shared database 135B.
  • the second authorizing entity computer 110B may send a verification request message about the user to the server computer 140, requesting that the server computer 140 verify the information from the user device 120.
  • the verification request message may include the second hash.
  • the verification request message may also include the identifier of the user, and the types of identity information in the verification request message (e.g., an "address" type).
  • the server computer 140 may retrieve the location of the first hash of identity information about the user from the location database 145.
  • the server computer 140 may use the identifier of the user to retrieve the location of the first hash.
  • the server computer 140 may retrieve a plurality of locations of hashes from the location database 145.
  • the server computer 140 may retrieve locations of hashes for a user with an "address" type in response to receiving a hashed address from the second authorizing entity computer 110B.
  • the server computer 140 may retrieve a specific location of a hash of information about the user from the location database 145. For example, the server computer 140 may retrieve the most recent location, or the location of a hash in a shared database of an authorizing entity with the highest trust score.
  • the server computer 140 may retrieve the first hash from the first shared database 135A using the location of the first hash.
  • the server computer 140 may retrieve a plurality of hashes from a plurality of shared databases.
  • the server computer 140 may retrieve a hashed address associated with the user from 3 different shared databases.
  • the first authorizing entity computer 110A may learn that the server computer 140 is retrieving data from the first shared database 135A but may not learn what data the server computer 140 is retrieving.
  • the server computer 140 may compare the first hash to the second hash to determine if the first hash and the second hash match.
  • the server computer 140 may compare the second hash to a plurality of hashes to determine if the second hash matches one or more hashes in the plurality of hashes.
  • the first hash and the second hash may match if the they are derived from the same information. Two pieces of information that differ slightly may have significantly different hashes, so the server computer 140 may enforce standards for information to ensure that hashes can be easily compared (e.g., formatting standards, encoding standards).
  • the server computer 140 may also evaluate the trust score of the first authorizing entity computer 110A when comparing the first hash to the second hash.
  • the server computer 140 may determine that the first hash and the second hash do not match even if the hashes are the same. The server computer may also compare the trust score of the first authorizing entity computer 110A to a threshold to determine if the first authorizing entity computer 110A has a low trust score. Alternatively, the server computer 140 may determine that the first hash and the second hash match but may not verify the user.
  • step S122 if the server computer 140 determines that the first hash and the second hash match, the server computer 140 may generate verification data (e.g., a cryptogram) indicating that the user was previously verified by an authorizing entity.
  • the verification data may also indicate that the trust score of the first authorizing entity computer 110A was greater than the threshold.
  • the server computer 140 may send a verification response message, comprising the verification data, to the second authorizing entity computer 110B.
  • the verification response message may not indicate which particular authorizing entity previously verified the user.
  • the second authorizing entity computer 110B may then store the identity information from the user device 120 in a second verification database 115B with an indication that the user has been verified. The indication may be the verification data.
  • the second authorizing entity computer 110B may also store the second hash in the second shared database 135B. In some embodiments, if the second hash is already stored in the second shared database 135B, the second authorizing entity computer 110B may update the second hash with the indication that the user associated with the second hash has been verified.
  • the second authorizing entity operating the second authorizing entity computer 110B can provide the requested access or service that was requested by the user that interacted with the second authorizing entity.
  • FIG. 4 shows a timing diagram of information verification and storage according to embodiments.
  • Authorizing entity computer 110 may be the first authorizing entity computer 110A of FIG. 1
  • verification database 115 may be the first verification database 115A
  • the shared database 135 may be the first shared database 135A.
  • a user may use user device 120 to initiate a verification process with an authorizing entity computer 110.
  • the verification process may be, for example, a Know Your Customer (KYC) process.
  • KYC Know Your Customer
  • the user device 120 may send a request for verification to the authorizing entity computer 110.
  • the request for verification may comprise identity information (e.g., an address, a tax ID) and an identifier of the user (e.g., a name, an ID number).
  • the identity information in the request for verification may be information that is independently verifiable by the authorizing entity computer 110.
  • the authorizing entity computer 110 may verify the identity information from the user device 120 using the verification process. For example, if the user device 120 sent an address, the authorizing entity computer 110 may look up the address to determine if the address is accurate and if the user resides at or operates out of that address. As another example, the authorizing entity computer 110 may confirm identity information with government and legal entities such as a department of motor vehicles or court records. If the authorizing entity computer 110 is not able to verify some or all of the identity information from the user device 120, the authorizing entity computer 110 may terminate the verification process. If the authorizing entity computer 110 is able to verify the identity information from the user device 120, the authorizing entity may verify the user.
  • the authorizing entity computer 110 may store the verified identity information in a verification database 115.
  • the verification database 115 may also store an indication that the user is verified.
  • the verification database 115 may also store an indication that the user has been verified (e.g., a cryptogram, a date of the verification, etc.).
  • the authorizing entity computer 110 may hash the verified identity information from the user device 120.
  • the authorizing entity computer 110 may hash the identity information using a cryptographic hashing algorithm (e.g., SHA-256).
  • the authorizing entity computer 110 may then store the hash of the identity information in a shared database 135.
  • the shared database 135 may be shared with server computer 140.
  • the server computer 140 may not be able to edit the information in the shared database 135.
  • the shared database 135 may be a distributed ledger.
  • the authorizing entity computer 110 and the server computer 140 may be nodes in the distributed ledger.
  • the authorizing entity computer 110 may store the hash with the identifier of the user and/or the type of the information.
  • the authorizing entity computer 110 may include that a hash is a hashed address.
  • the authorizing entity computer 110 may also send a notification to the server computer 140 that the hash has been stored in the shared database 135.
  • the shared database 135 may send an indication to the server computer 140 that the hash has been stored in the shared database 135.
  • the server computer 140 may receive an indication that the hash has been stored in the shared database 135.
  • the server computer 140 may receive the indication from the authorizing entity computer 110 or the shared database 135. For example, the server computer 140 may receive a notification whenever data is added to the shared database 135. If the shared database 135 is a distributed ledger, the server computer 140 may receive an indication that the hash has been stored in the shared database 135 when reaching consensus about the update to the distributed ledger.
  • the indication may include a location of the hash in shared database 135. Additionally, or alternatively, the server computer 140 may receive the hash.
  • the server computer 140 may store the location of the hash in the shared database 135 in a location database 145.
  • the location database 145 may also have the identifier of the user.
  • the location database 145 may also store the type of the information.
  • the shared database 135 may be separate and distinct from the location database 145. For example, the shared database 135 and the location database 145 may be stored on separate computers.
  • the server computer 140 may calculate a trust score for the authorizing entity computer 110.
  • the server computer 140 may determine the trust score at any point in the verification process. For example, the server computer 140 may determine the trust score after receiving an indication of a hash, or after gaining access to a shared database 135.
  • the trust score may be based on the verification process done by the authorizing entity computer 110. For example, a strong verification process may involve the authorizing entity computer verifying information with multiple sources, and using quality sources like government entities. The server computer may then determine a high trust score for the authorizing entity.
  • the authorizing entity may alternatively have a weak verification process. For example, the authorizing entity may use low quality sources, such as a social media profile, to verify identity information.
  • the authorizing entity computer 110 may then have a low trust score.
  • the authorizing entity computer 110 may send information to the server computer 140 about how the verification process, for example, when sending the notification about the hash.
  • the server computer 140 can audit the authorizing entity computer 110 to analyze the verification process.
  • the server computer 140 may also periodically audit the authorizing entity computer 110 to maintain an updated trust score for the authorizing entity computer 110.
  • the server computer 140 may then store the trust score in the location database 145.
  • FIG. 5 shows retrieval of verified information according to embodiments.
  • the authorizing entity computer 110B may be the second authorizing entity computer 110B of FIG. 1 .
  • the verification database 115B may be second verification database 115B of FIG. 1 .
  • the user may have previously completed a verification process with a first authorizing entity computer 110A, and a first hash of identity information may have been stored in shared database 135A, following the method of FIG. 4 .
  • a user may use a user device 120 to initiate a verification process with an authorizing entity.
  • the verification process may be, for example, a Know Your Customer (KYC) process.
  • KYC Know Your Customer
  • the user device 120 may send a request for verification to the authorizing entity computer 110B.
  • the request for verification may comprise identity information (e.g., an address, a tax ID) and an identifier of the user (e.g., a name, an ID number).
  • the identity information in the request for verification may be information that is independently verifiable by the authorizing entity computer 110.
  • the authorizing entity computer 110B may hash the identity information from the user device 120 to generate a second hash.
  • the authorizing entity computer may use the same hashing function as the first authorizing entity computer 110A.
  • the authorizing entity computer 110B may use a cryptographic hashing algorithm such as SHA-256.
  • the authorizing entity computer 110B may send a verification request message to the server computer 140.
  • the verification request message may comprise include the second hash.
  • the verification request message may also include the identifier of the user, and the types of identity information in the verification request message (e.g., an "address" type).
  • the server computer 140 may receive the verification request message from the authorizing entity computer 110B.
  • the server computer 140 may then retrieve from a location database 145 a location of a first hash of the identity information in a shared database 135A.
  • the server computer 140 may use the identifier of the user to retrieve the location from the location database 145.
  • the server computer 140 may retrieve a plurality of locations from a plurality of shared databases.
  • the server computer 140 retrieve locations of hashes that have the same type of information. For example, the server computer 140 may retrieve the locations of all hashes of addresses associated with the user. If there are hashes from multiple shared databases, the server computer 140 can use a trust score to select a location in a particular shared database. For example, the server computer 140 may only retrieve the location from the shared database of an authorizing entity with the highest trust score, or with a trust score above a threshold.
  • the server computer 140 may retrieve the first hash of the information from the shared database 135A using the location of the first hash.
  • the server computer 140 may also retrieve a plurality of hashes from a plurality of shared databases. For example, the server computer 140 may retrieve a hashed address associated with the user from 3 different shared databases.
  • the first authorizing entity computer 110A may learn that the server computer 140 is retrieving data from the first shared database 135A but may not learn what data the server computer 140 is retrieving.
  • the server computer 140 can compare the first hash to the second hash to determine if the hashes match.
  • the server computer 140 may compare the second hash to a plurality of hashes to determine if the second hash matches one or more hashes in the plurality of hashes.
  • the server computer 140 may compare the second hash to hashes from a plurality of shared databases.
  • the second hash may include a hash of an address and a hash of a social security number.
  • the first hash may include a hash of an address and a hash from an additional shared database may include a hash of a social security number.
  • the first hash and the second hash may match if the they are derived from the same information. Two pieces of information that differ slightly may have significantly different hashes, so the server computer 140 may enforce standards for information to ensure that hashes can be easily compared (e.g., formatting standards, encoding standards).
  • the server computer 140 may also evaluate the trust score of the first authorizing entity when comparing the first hash to the second hash. For example, if the first authorizing entity has a low trust score, the server computer 140 may determine that the first hash and the second hash do not match even if the hashes are the same. As another example, the server computer 140 may determine if the trust score of the first authorizing entity is above a predetermined threshold before comparing the first hash and the second hash. Alternatively, the server computer 140 may determine that the first hash and the second hash match but may not verify the user.
  • step S514 after determining that the first hash matches the second hash, the server computer 140 may generate verification data (e.g., a cryptogram) indicating that the user was previously verified. The server computer 140 may then generate a verification response message comprising the verification data and send the verification response message to the authorizing entity computer 110B. Additionally, the verification response message may comprise information about the verification, such as the trust score of the first authorization entity. The server computer 140 may not send to the authorizing entity computer 110B information about which authorizing entity originally verified the user. If the server computer 140 as not able to match the hashes, the server computer 140 may send to the authorizing entity computer 110B a verification response message with an indication that the user is not verified.
  • verification data e.g., a cryptogram
  • step S5166 if the verification response message indicates that the user is verified, then the authorizing entity computer 110B may store the identity information about the user in a verification database 115B, and may also store the verification data in the verification database 115B.
  • the authorizing entity computer 110B may also store the second hash of the identity information in a second shared database 135B.
  • the authorizing entity computer 110B may also send an indication of the second hash to the server computer 140.
  • FIG. 6 shows entries in a shared database 135, such as first shared database 135A of FIG. 1 .
  • the shared database 135 may be, for example, a distributed ledger or a relational database shared between multiple computers. While the data in FIG. 6 is shown as a table with columns, it is appreciated that the information may be stored and displayed in any suitable format.
  • the shared database 135 may comprise location markers 602.
  • the location marker may be, for example, a sequentially numbered reference for the row in the database or a reference to a memory location in the shared database 135.
  • the shared database 135 may also comprise user identifiers 604.
  • the user identifier may be the name of the user. For example, two users may be Company A and Company B. In another example, the user identifier may be a unique identifier for the user, such as an alphanumeric code.
  • the shared database 135 may also comprise hashes 606.
  • the hash may be generated with a public hashing function, such as a cryptographic hashing function.
  • a public hashing function such as a cryptographic hashing function.
  • different types of identity information may be hashed differently. For example, addresses may hash to an 8-character alphanumeric string while tax IDs may hash to an 11-character alphanumeric string. Note that simple hashes are shown for purposes of illustration, but longer hashes may be used in embodiments.
  • the shared database 135 may also comprise types of information 608. For example, Company A may have sent an address and a tax ID to be verified, while Company B may have only sent an address.
  • the information type may be derivable from the form of the hash.
  • FIG. 7 shows entries of a location database, such as location database 145 of FIG. 1 . While the data in FIG. 7 is shown as a table with columns, it is appreciated that the information may be stored and displayed in any suitable format.
  • the location database 145 may comprise location markers 702.
  • the location markers may be received from shared databases (e.g., location markers 602 of FIG. 6 ), and may point to a location in each shared database. Each shared database may use a different location marker scheme (e.g., one may use row numbers and one may use memory pointers).
  • the location database 145 may also comprise user identifiers 704 which may be user identifiers 604 from FIG. 6 .
  • the location database 145 may also comprise types of information 706 which may be types of information 606 from FIG. 6 .
  • the location database 145 may also comprise identifiers of shared databases 708.
  • the shared database identifier may be an identifier of the authorizing entity or authorizing entity computer associated with the shared database. Alternatively, each shared database may have an individual identifier.
  • the location database 145 may also comprise trust scores 710.
  • the trust scores may be determined by a trust score determination module of a server computer and may indicate the strength of an authorizing entity's verification process.
  • the trust score may be a number between 0 and 1, or 0 and 100, with high numbers indicating a stronger verification process.
  • the location database 145 may also store hashed identity information about users.
  • the location database 145 may store verified identity information from some authorizing entities and not from others, and this may depend on which authorizing entities send hashes to the server computer.
  • Embodiments of the invention can provide a number of advantages. Embodiments can reduce the computational resources associated with user verification. Existing verification processes, such as KYC, can be both time intensive and require a significant amount of computational power. Additionally, that time and resources can be unnecessarily duplicated as a user is verified by multiple users. Even when multiple authorizing entities are sharing identity information in order to verify a user, embodiments can still keep the identity information secure. If malicious entities intercept messages with identity information in an attempt to steal the user's identity, cryptographic hashes can keep the sensitive information safe.
  • embodiments can prevent user information from being shared with entities beyond those approved by the user. For example, hashes can prevent the server computer from learning any information about the user. Authorizing entities may only receive verification data about identity information that they received from the user directly, even if the user sent other identity information to other authorizing entities.
  • any of the software components or functions described in this application may be implemented as software code to be executed by a processor using any suitable computer language such as, for example, Java, C++ or Perl using, for example, conventional or object-oriented techniques.
  • the software code may be stored as a series of instructions, or commands on a computer-readable medium, such as a random access memory (RAM), a read only memory (ROM), a magnetic medium such as a hard-drive, or an optical medium such as a CD-ROM.
  • RAM random access memory
  • ROM read only memory
  • magnetic medium such as a hard-drive
  • an optical medium such as a CD-ROM.
  • Any such computer-readable medium may reside on or within a single computational apparatus, and may be present on or within different computational apparatuses within a system or network.
  • One or more features from any embodiment may be combined with one or more features of any other embodiment .

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Computer Hardware Design (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Computing Systems (AREA)
  • Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)

Claims (10)

  1. Procédé comprenant :
    la réception (S108), par un ordinateur serveur (140), depuis un premier ordinateur d'entité d'autorisation (110A) :
    d'une indication d'un premier hachage d'informations concernant l'utilisateur, comportant un emplacement du premier hachage dans une première base de données (135A) ; et
    d'un identifiant de l'utilisateur, dans lequel l'utilisateur ou les informations concernant l'utilisateur ont été vérifiés par le premier ordinateur d'entité d'autorisation (110A) ;
    le stockage, par l'ordinateur serveur (140), de l'identifiant de l'utilisateur et de l'emplacement du premier hachage dans une base de données d'emplacements (145), la première base de données étant séparée et distincte de la base de données d'emplacements (145) ;
    la réception (S114), par l'ordinateur serveur (140), depuis un deuxième ordinateur d'entité d'autorisation (110B), d'un message de demande de vérification concernant l'utilisateur, le message de demande de vérification comprenant un deuxième hachage d'informations concernant l'utilisateur et l'identifiant de l'utilisateur ;
    la récupération (S116), par l'ordinateur serveur (140), de l'emplacement du premier hachage à partir de la base de données d'emplacements (145) sur la base de l'identifiant de l'utilisateur ;
    la récupération (S118), par l'ordinateur serveur (140), du premier hachage à partir de la première base de données (135A) à l'aide de l'emplacement récupéré du premier hachage ;
    la comparaison (S120), par l'ordinateur serveur (140), du premier hachage avec le deuxième hachage pour déterminer si le premier hachage et le deuxième hachage concordent ;
    la détermination (S122), par l'ordinateur serveur (140), du fait que le premier hachage et le deuxième hachage concordent ; et
    en réponse à la détermination du fait que le premier hachage et le deuxième hachage concordent, l'envoi, par l'ordinateur serveur (140), d'un message de réponse de vérification au deuxième ordinateur d'entité d'autorisation (110B), le message de réponse de vérification comprenant des données de vérification selon lesquelles l'utilisateur a été précédemment vérifié.
  2. Procédé selon la revendication 1, dans lequel le procédé comprend en outre :
    la détermination, par l'ordinateur serveur (140), d'un score de confiance pour le premier ordinateur d'entité d'autorisation (110A).
  3. Procédé selon la revendication 2, dans lequel le procédé comprend en outre :
    la comparaison, par l'ordinateur serveur (140), du score de confiance avec un seuil et dans lequel le message de réponse de vérification comprend des données de vérification selon lesquelles le score de confiance est supérieur au seuil.
  4. Procédé selon l'une quelconque des revendications précédentes, dans lequel le message de réponse de vérification comprend des données de vérification indicatives d'une vérification précédente de l'utilisateur par le premier ordinateur d'entité d'autorisation (110A).
  5. Procédé selon l'une quelconque des revendications précédentes, dans lequel la première base de données (135A) est un registre distribué.
  6. Procédé selon l'une quelconque revendication précédente, dans lequel le procédé comprend en outre :
    la réception, par l'ordinateur serveur (140) depuis une pluralité d'ordinateurs d'entité d'autorisation (110A, 110B), d'une pluralité d'indications de hachages d'informations concernant l'utilisateur, la pluralité de hachages étant stockés dans une pluralité de bases de données (135A, 135B) ;
    la détermination, par l'ordinateur serveur (140), d'un score de confiance pour chacun de la pluralité d'ordinateurs d'entité d'autorisation (110A, 110B) ; et
    la détermination, par l'ordinateur serveur (140), d'un ordinateur d'entité d'autorisation ayant un score de confiance le plus élevé dans la pluralité d'ordinateurs d'entité d'autorisation (110A, 110B) ; et
    la récupération, par l'ordinateur serveur (140), d'un hachage à partir d'une base de données associée à l'ordinateur d'entité d'autorisation ayant le score de confiance le plus élevé.
  7. Ordinateur serveur (140) comprenant :
    un processeur ; et
    un support lisible par ordinateur, couplé au processeur, destiné à stocker des instructions qui, lorsqu'elles sont exécutées par le processeur, amènent le processeur à réaliser le procédé selon l'une quelconque des revendications 1 à 6.
  8. Procédé comprenant :
    la réception, par un ordinateur d'entité d'autorisation (110B), d'informations d'identité provenant d'un utilisateur ;
    la génération, par l'ordinateur d'entité d'autorisation (110B), d'un hachage des informations d'identité provenant de l'utilisateur ;
    l'envoi, par l'ordinateur d'entité d'autorisation (110B) à un ordinateur serveur (140), d'un message de demande de vérification comprenant le hachage ;
    la réception, par l'ordinateur d'entité d'autorisation (110B) depuis l'ordinateur serveur (140), d'un message de réponse de vérification comprenant des données de vérification selon lesquelles l'utilisateur a été précédemment vérifié ;
    le stockage, par l'ordinateur d'entité d'autorisation (110B), du hachage dans une base de données partagée ;
    l'envoi, par l'ordinateur d'entité d'autorisation (110B), d'une indication du hachage dans la base de données partagée à l'ordinateur serveur (140), dans lequel l'indication comprend un emplacement du hachage dans la base de données partagée ; et
    le stockage, par l'ordinateur d'entité d'autorisation (110B), des informations d'identité dans une base de données de vérification.
  9. Procédé selon la revendication 8, dans lequel le stockage des informations dans la base de données de vérification comprend en outre :
    le stockage, par l'ordinateur d'entité d'autorisation (110B), des données de vérification dans la base de données de vérification.
  10. Ordinateur d'entité d'autorisation (110B) comprenant :
    un processeur ; et
    un support lisible par ordinateur, couplé au processeur, destiné à stocker des instructions qui, lorsqu'elles sont exécutées par le processeur, amènent le processeur à réaliser le procédé selon la revendication 8 ou la revendication 9.
EP20171096.9A 2019-04-26 2020-04-23 Réseau de vérification de données de registres répartis Active EP3731115B1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US16/396,318 US11115420B2 (en) 2019-04-26 2019-04-26 Distributed ledger data verification network

Publications (2)

Publication Number Publication Date
EP3731115A1 EP3731115A1 (fr) 2020-10-28
EP3731115B1 true EP3731115B1 (fr) 2022-03-30

Family

ID=70470742

Family Applications (1)

Application Number Title Priority Date Filing Date
EP20171096.9A Active EP3731115B1 (fr) 2019-04-26 2020-04-23 Réseau de vérification de données de registres répartis

Country Status (2)

Country Link
US (2) US11115420B2 (fr)
EP (1) EP3731115B1 (fr)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11870646B2 (en) * 2021-01-12 2024-01-09 Oracle International Corporation Fabric availability and synchronization
CN113032824B (zh) * 2021-03-01 2023-06-23 上海观安信息技术股份有限公司 基于数据库流量日志的低频数据泄漏检测方法及系统
US20230035274A1 (en) * 2021-08-01 2023-02-02 Authomize Ltd. Methods and Systems for Classification of Sensitive Electronic Resources
CN116070279B (zh) * 2023-03-22 2023-07-04 深圳市于易点科技有限公司 基于区块链的网络安全信息共享方法及系统

Family Cites Families (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101661930B1 (ko) * 2015-08-03 2016-10-05 주식회사 코인플러그 블록체인을 기반으로 하는 공인인증서 발급시스템
US20180285879A1 (en) * 2015-10-17 2018-10-04 Banqu, Inc. Blockchain-based identity and transaction platform
WO2018009979A1 (fr) * 2016-07-15 2018-01-18 E-Nome Pty Ltd Procédé mis en œuvre par ordinateur pour la gestion sécurisée de données générées dans un ehr pendant un épisode de soins et système associé
US20180343120A1 (en) * 2016-10-26 2018-11-29 Black Gold Coin, Inc. Systems and methods for providing a universal decentralized solution for verification of users with cross-verification features
CA3052415C (fr) * 2017-02-01 2021-07-06 Equifax, Inc. Verification d'une identite d'apres des sources de donnees reparties multiples en utilisant une chaine de blocs pour preserver l'identite
US10476862B2 (en) 2017-03-31 2019-11-12 Mastercard International Incorporated Systems and methods for providing digital identity records to verify identities of users
TWI622949B (zh) 2017-05-26 2018-05-01 富邦金融控股股份有限公司 具多重密鑰的kyc資料標記之爭議救濟系統及其方法
US10382965B2 (en) 2017-05-30 2019-08-13 Sap Se Identity verification using computer-implemented decentralized ledger
EP3631664B1 (fr) 2017-06-02 2022-04-27 Visa International Service Association Authentification biométrique sécurisée utilisant une identité électronique
US11394559B2 (en) 2017-06-02 2022-07-19 Visa International Service Association Methods and systems for ownership verification using blockchain
US10181948B1 (en) * 2018-01-25 2019-01-15 Fortress Cyber Security, LLC Secure storage of hashes within a distributed ledger
WO2020036657A1 (fr) * 2018-04-26 2020-02-20 The Assay Depot, Inc. Vérification décentralisée des données
EP3804279A4 (fr) * 2018-06-01 2022-01-19 Nokia Technologies OY Procédé et appareil d'évaluation décentralisée de confiance dans un réseau distribué
US10841100B2 (en) * 2018-08-07 2020-11-17 The Toronto-Dominion Bank Dynamically managing exchanges of data using a distributed ledger and homomorphic commitments
US11044258B2 (en) * 2018-08-24 2021-06-22 Kyocera Document Solutions Inc. Decentralized network for secure distribution of digital documents

Also Published As

Publication number Publication date
EP3731115A1 (fr) 2020-10-28
US20210377274A1 (en) 2021-12-02
US11115420B2 (en) 2021-09-07
US20200344236A1 (en) 2020-10-29

Similar Documents

Publication Publication Date Title
US20230246842A1 (en) Compact recordation protocol
US11853457B2 (en) Selectively verifying personal data
CN110383757B (zh) 用于安全处理电子身份的系统和方法
EP3731115B1 (fr) Réseau de vérification de données de registres répartis
CN108292401B (zh) 安全的数字数据操作
US9256764B2 (en) Searchable encrypted data
US11824838B2 (en) Providing assertions regarding entities
US20230208642A1 (en) Secure data transfer system and method
CN110209691B (zh) 一种数据处理方法及装置
AU2019204711B2 (en) Securely performing cryptographic operations
US11310052B1 (en) Identity authentication blockchain
EP3699801B1 (fr) Procédé et système pour créer des données modifiées rapidement consultables dans une base de données
US11757638B2 (en) Account assertion
US20210374728A1 (en) Privacy-preserving assertion system and method
WO2020167317A1 (fr) Traitement de transaction sur la base de l'identité
US20240250820A1 (en) Sharing and requesting private data using cryptography
US20240291649A1 (en) Non-fungible token (nft) vehicle information
WO2021262338A1 (fr) Identification de confiance d'utilisateurs en cours d'inscription sur la base d'images et d'identificateurs uniques associés à des utilisateurs de parrainage

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN PUBLISHED

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20210428

RBV Designated contracting states (corrected)

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTG Intention to grant announced

Effective date: 20211018

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1479860

Country of ref document: AT

Kind code of ref document: T

Effective date: 20220415

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602020002387

Country of ref document: DE

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG9D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220630

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220630

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20220330

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1479860

Country of ref document: AT

Kind code of ref document: T

Effective date: 20220330

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220701

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220801

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220730

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602020002387

Country of ref document: DE

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20220430

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220423

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220430

26N No opposition filed

Effective date: 20230103

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220423

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230511

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20230430

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20230430

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20240320

Year of fee payment: 5

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20200423

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20240320

Year of fee payment: 5

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20240320

Year of fee payment: 5