International Business Machines Corporation

Globalfoundries Inc.

Alessandro Sorniotti

Elli Androulaki

Angelo De Caro

Anil Kurmus

Joseph S Glider

Marko Vukolić

Nathalie Baracaldo

Yacov Manevich

Artem Barger

Matthias Neugschwandtner

Thorsten Kramp

Ilie Circiumaru

Michael Edward Factor

Robert Beverley Basham

Elliot Karl Kolodner

Felipe Knop

Yuri L Volobuev

Alexandra Shulman-Peleg

David Hadas

Jason Karl Yellick

Harold Joseph Roberson, Ii

Martin Petermann

Fabian Portmann

Jesus Diaz Vico

Roman Alexander Pletka

Thomas Mittelholzer

Nikolas Ioannou

Jan Leonard Camenisch

Jens Jelitto

Tamas Visegrady

Ioannis Koltsidas

Robert Haas

Wayne A Sawdon

David W Kravitz

Gregory Neven

Jonas R Weiss

Robert Dean Lovchik

Thomas D Weigold

Slavisa Sarafijanovic

Gari Singh

Christian Cachin

Senthilnathan Natarajan

Paul Brian Tippett

Marc Ph Stoecklin

Kaoutar El Khiyaoui

Nikola Knezevic

Miguel Angel Prada Delgado

Angelo DeCaro

Julia Hesse

Christian Gorenflo

Esha Ghosh

Jan Stanek

Alexis Hafner

Mechanisms for verifying a captured digital image are provided. A verifier computing system generates, in response to a request to perform digital identity verification of a subject, a computer readable first encoded pattern. Light projecting equipment of the verifier computing system, projects the first encoded pattern onto a physical surface associated with the subject. Digital image capturing equipment of a prover computing system captures a digital image of the subject while the first encoded pattern is projected onto the physical surface such that the captured digital image captures both an image of the subject and the projected first encoded pattern. The prover computing system generates a second pattern based on an extraction key received from the verifier computing system. The prover computing system verifies an authenticity of the captured digital image based on a matching of the second pattern to the first pattern.

Authentication of images based on projected encoded pattern

A processor may store a write set of a transaction in a cache. The cache may include state information, and the cache may be uncommitted to a blockchain. The processor may identify a subsequent transaction. The subsequent transaction may read from the cache when a requested key is present in the cache. The processor may order the transaction and the subsequent transaction based on what is read from the cache. Ordering the transaction and the subsequent transaction may avoid an abort of the subsequent transaction.

Reducing transaction aborts in execute-order-validate blockchain models

An example operation includes one or more of receiving event data from an entity, determining the event data satisfies an endorsement policy, setting an identifier that corresponds to a context of the event data, generating an event which includes the event data and the identifier, and submitting the event for recording in a decentralized database, wherein the identifier is used to validate that a state corresponding to the context in the event data is correct.

Pre-validated event processing in a decentralized database

A method, system, and computer program product are disclosed. The method includes separating a user certificate into a private component and a non-private component. The method further includes storing the non-private component in a database and providing a pointer to the non-private component stored in the database.

Privacy-preserving user certificates

The present invention is directed to a computer-implemented method for linking identity information of a physical identifier to a digital identifier. The identity information comprises a plurality of symbols. The method comprises cryptographically obfuscating one or more symbols of the identity information separately into an obfuscated symbol such that a separate deobfuscation information is needed for each obfuscated symbol to deobfuscate it and storing the obfuscated symbols within the digital identifier.

Linking a physical identifier to a digital identifier

An example operation may include one or more of extracting a data object from a machine-readable code. The data object can include fields of data signed with a digital signature of a private key, detecting an identifier of an issuer of the data object from the extracted data object, retrieving a public key from a blockchain based on the identifier of the issuer detected from the field of the extracted data object, and verifying the digital signature of the private key based on the fetched public key.

Blockchain based verifiability of user status

An example operation may include one or more of receiving, by each of one or more peripheral peers of a blockchain network, a new block from an orderer peer, calculating a hash of the new block, determining the calculated hash is different than hashes from a majority of peripheral peers, determining that one or more blocks that correspond to the different hashes from the majority of peripheral peers are different from the new block, and in response ceasing committing blocks to the blockchain network.

Malicious peer identification

An example operation may include one or more of receiving, by each of one or more peripheral peers of a blockchain network, a sequence of new blocks from an orderer peer, calculating hashes for the sequence of new blocks, adding the hashes to a merkle tree, determining the merkle tree is different than merkle trees from a majority of peripheral peers, determining that one or more blocks that correspond to the different merkle trees from the majority of peripheral peers are different from the sequence of new blocks, and in response ceasing committing blocks to the blockchain network.

Malicious peer identification for database block sequence

In some embodiments, a processor may generate a request associated with a transaction, collect an anchor associated with the request, and transition the transaction into a collection of two or more hashes; the processor may submit the transaction to an ordering service. In some embodiments, a processor may receive a request associated with a transaction, identify that a first preimage associated with a first hash is known to a first shard, and generate a first identification tag associated with the transaction. In some embodiments, a processor may receive a request associated with a transaction, assign a first shard a first task, and identify that a first preimage associated with a first hash is known to the first shard; the processor may perform the task.

Privacy preserving architecture for permissioned blockchains

An example operation may include one or more of receiving an event from a node, extracting an identifier from the event, determining whether the event is authorized, and generating a notification of the event when the identifier is authorized, wherein the identifier includes a hashed value of an event counter and wherein the identifier is authorized when the hashed value matches a hashed value of the event counter stored in a storage area of or coupled to the client.

Information management in a database

A node in a blockchain network may generate a configuration override for the blockchain network, approve the configuration override by the blockchain network, transmit the approval for the configuration override to peers in the blockchain network, and submit the configuration override to the blockchain network for validation. The validation will be based on the configuration override matching the approval.

Configuration override in a blockchain network

An example operation may include one or more of identifying a new entry, receiving one or more new entry signatures to approve the new entry to, such that the one or more new entry signatures each include a signature of the new entry and hashes of previously signed entries for a common block, verifying the one or more new entry signatures for commit by performing a signature verification of the new entry, determining the common block has more than one entry with a hash signed by a same member, and responsive to the signature check being performed on the new entry and determining the common block has more than one entry with a hash signed by a same member, designating one or more previously received entries as verified for commit without performing a signature verification of the one or more previously received entries.

Reducing signature verifications of database entries

An example operation may include one or more of creating a shared secret via a blockchain node member, storing the shared secret in a memory outside the blockchain, and sharing the shared secret with one or more other blockchain node members during a setup phase of an execution environment associated with a chaincode.

Authenticating chaincode to chaincode invocations of a blockchain

An example operation may include one or more of receiving a request to create a second blockchain in a network that includes a first blockchain, sending a message to one or more validating peer nodes in the network, the one or more validating peer nodes corresponding to a subset of validating peer nodes of the network that have access to the first blockchain, the message requesting authorization for the second blockchain, analyzing responses to the message from the subset of validating peer nodes, and authorizing creation of the second blockchain based on the analyzed responses.

Information management and access control in a database

Described are techniques for privacy-preserving endorsements in blockchain transactions. The techniques include a method comprising associating a ledger key in a local collection with an ephemeral key, where the ephemeral key is a re-randomization of a key associated with a first organization. The method further comprises generating, by a first peer associated with the first organization, an anonymous endorsement of a transaction in a blockchain using the ephemeral key. The method further comprises determining, by a second peer associated with the first organization, that the first peer endorsed the transaction. The method further comprises retrieving, by the second peer, a preimage from the first peer. The method further comprises providing information including the anonymous endorsement and the transaction to a second organization associated with the blockchain, where the anonymous endorsement is anonymous to peers associated with the second organization.

Privacy-preserving endorsements in blockchain transactions

Growing community of inventors

Zurich, Switzerland

Alessandro Sorniotti