International Business Machines Corporation

Dfinity Stiftung

Jan Leonard Camenisch

Anja Lehmann

Gregory Neven

Dieter M Sommer

Thomas R Gross

Kai Samelin

Maria Dubovitskaya

Franz-Stefan Preiss

Michael Waidner

Dominic Williams

Emmanuel Delamarche

Yossi Gilad

Zoltan Arnold Nagy

Guenter Karjoth

Matthias Schunter

Christian Cachin

Daniel Kovacs

Leah Shalev

Shmuel Ben-Yehuda

Julian Satran

Zorik Machulsky

Ilan Shimony

Dirk Husemann

Thomas Basil Smith, Iii

Anthony Bussani

Ton Engbersen

Peter Buhler

Angelo De Caro

Yvonne-Anne Pignolet

Onur Gökçe

Charles Campbell Palmer

Steven B Adler

Arthur Miles Gilbert

Birgit Monika Pfitzmann

Tamas Visegrady

Silvio Dragone

Xuan Liu

Alessandro Sorniotti

Michael Charles Osborne

Elli Androulaki

Oliver Augenstein

Gero Dittmann

Claudio Soriente

Edith Gail Schonberg

Christopher J Giblin

Kathryn Ann Bohrer

Calvin Stacy Powers

Victor Shoup

Michael P Waidner

Anna Lysyanskaya

Tadeusz J Pietraszek

Robert R Enderlein

Eduarda Freire Stögbuchner

Manu Drijvers

Stephan Krenn

Diego Alejandro Ortiz-Yepes

Onur Goekce

Michael Backes

Endre Felix Bangerter

Kristiyan Haralambiev

Eduarda Freire-Stögbuchner

Nigel Howard Julian Brown

Roger Daniel Zimmermann

Abhi A Shelat

Timo Hanke

Dogan Kesdogan

Adam Charles Nelson

Michael Schnyder

Michael Robert McCullough

Joy Algesheimer

David Derler

Johan Granström

Patrick Towa

Elsie Van Herrewegen

Patrik Bichsel

Elsie A Van Herreweghen

Tommaso Gagliardoni

Mark Korondi

Martin Joseph Clayton Presler-Marshall

Ansgar Schmidt

Kaoutar Elkhiyaoui

Andreas X Meier

Mahnush Movahedi

Andreas Rossberg

Thomas Scott Heydt-Benjamin

Maciel Koprowski

Susan R Hohenberger

Esha Ghosh

Matthew P Leonard

Maciej A Koprowski

Cecilia Boschini

Alfredo Rial Duran

Jens Groth

Björn Tackmann

Allen Clement

Robert Lauko

David Mccauley

Maciej Wos

An aspect of the invention relates to a distributed network comprising a plurality of network nodes. The distributed network is configured to perform a method for reaching a consensus on a sequence of values in an advantageous manner. The method performs consecutive notarization rounds. The notarization rounds comprise steps of creating value proposals to be added to the sequence, communicating the value proposals to a notarization subset of the plurality of nodes and performing a validity check of received value proposals. The notarization rounds may comprise further steps of executing individual notarization signatures on a subset of the value proposals that are valid. The notarization rounds may further comprise performing a consistency check of the value proposals and executing consistency signatures on a subset of the value proposals. The method may further comprise a finality procedure to finalize a value proposal once a predefined finality rule set has been fulfilled.

Distributed network with consensus mechanism

According to an embodiment of a first aspect of the invention, there is provided a distributed network comprising a plurality of subnets. Each of the plurality of subnets comprises a changeable set of nodes. The network is configured to generate for each of the plurality of subnets, by a distributed key generation protocol, an individual static verification key of a public-key signature scheme and a first set of corresponding secret key shares for a first set of nodes of the respective subnet. The network is further configured to redistribute, for each of the plurality of subnets, by a secret-redistribution protocol, the secret key shares of the respective first set of secret key shares to a second set of nodes of the respective subnet, thereby creating a second set of secret key shares corresponding to the same static verification key of the respective subnet. Further aspects of the invention relate to a corresponding computer-implemented method, a node, a computer program product and a software architecture.

Distributed network having a plurality of subnets

Embodiments of the invention relate to a computer-implemented method for generating verification keys of a public-key signature scheme in a distributed network. The method comprises performing, by a subset of the nodes of a first subnetwork of nodes, a first distributed key generation protocol, the first distributed key generation protocol being configured to generate jointly a verification key for the first subnetwork and a plurality of corresponding secret key shares for the nodes of the first subnetwork. The method further comprises a step of performing, for a second subnetwork, by a subset of the plurality of nodes of the first subnetwork, a second distributed key generation protocol, the second distributed key generation protocol being configured to generate jointly a verification key of the second subnetwork and a plurality of corresponding secret key shares for the nodes of the second subnetwork. A further step comprises signing, by a subset of the nodes of the first subnetwork, the verification key of the second subnetwork with a permissible subset of the secret key shares of the nodes of the first subnetwork, thereby generating a joint signature on the verification key of the second subnetwork. Further aspects relate to a distributed network, a node of a distributed network and corresponding computer program products.

Verification key generation in distributed networks

Embodiments of the invention relate to a distributed network. The distributed network comprises a replicated computing cluster and the replicated computing cluster comprises a plurality of nodes. Each of the plurality of nodes of the replicated computing cluster is configured to run a replica and each of the replicas is configured to run one or more computational units. Furthermore, each of the replicas is configured to perform consecutive processing rounds. The consecutive processing rounds comprise a consecutive processing of input blocks in a deterministic and replicated manner and thereby a sequence of round states is computed. Each of the replicas is further configured to perform software upgrades of the replica at handover states of pre-agreed handover rounds of the consecutive processing rounds and to provide, upon request of another replica, via a communication interface that is independent of the software upgrades, a handover package. The handover package is configured to enable an obtainment of the handover state.

Update software replica in a distributed system

According to an embodiment of a first aspect of the invention, there is provided a distributed network comprising a plurality of subnets. Each of the plurality of subnets comprises a plurality of nodes. The network is configured to run a set of computational units and to assign each of the computational units to one of the plurality of subnets according to a subnet-assignment, thereby creating an assigned subset of the set of computational units for each of the subnets. The network is further configured to run on each node of the plurality of subnets the assigned subset of the computational units and to replicate the assigned subsets of the computational units across the respective subnets. The network is further configured to exchange unit-to-unit messages between the computational units via a messaging protocol based on the subnet-assignment. Further aspects of the invention relate to a corresponding computer-implemented method, a node, a computer program product and a software architecture.

Messaging in distributed networks

According to an embodiment of a first aspect of the invention, there is provided a computer-implemented method for operating a distributed network. The distributed network comprises a plurality of nodes. The network comprises one or more subnets. The method comprises steps of running a set of computational units and assigning each of the computational units to one of the plurality of subnets according to a subnet-assignment, thereby creating an assigned subset of the set of computational units for each of the subnets. The method further comprises running on each node of the plurality of subnets the assigned subset of the computational units, wherein the computational units are configured to execute computations in a deterministic manner, thereby replicating the assigned subsets of the computational units on replicas across the respective subnet. The method further comprises running a consensus component, the consensus component being configured to reach a consensus on input blocks to be processed by the replicas of a respective subnet. The method further comprises measuring, by each of the replicas of a subnet, replica-local data, reporting, by each of the replicas of a subnet, the replica-local data to the consensus component and utilizing the replica-local data for an analysis, in particular a statistical analysis, of the computations executed across the respective subnet. Further aspects of the invention relate to a corresponding distributed network, a node, a computer program product and a software architecture.

Operation of a distributed deterministic network

According to an embodiment of a first aspect of the invention, there is a distributed network comprising a plurality of network nodes. Each of the plurality of network nodes is linked to a first node identity of a plurality of first node identities. Each of the plurality of first node identities comprises a first verification key of a public-key signature scheme. The distributed network is configured to perform a key shuffling step adapted to perform an unlinkable one-to-one mapping between the plurality of first node identities and a plurality of second node identities. Each of the plurality of second node identities comprises a second verification key of a public-key signature scheme. The distributed network is configured to perform a consensus protocol with a subset of the plurality of second node identities. Further aspects of the invention relate to a corresponding computer-implemented method, a network node and a computer program product.

Distributed network with blinded identities

Methods are provided for producing an authenticated packaged product. A digital signature, dependent on unique message data for the product, is generated via a digital signature scheme using a secret signing key. The message data is provided on at least one of the product and packaging. The digital signature is provided on the other of the product and packaging, and the product is packed in the packaging. The digital signature can be generated via a fuzzy-message digital signature scheme having a verification algorithm for verifying the digital signature in relation to fuzzy data within a predetermined difference measure of the message data. Methods and systems for authenticating such packaged products are also provided.

Authentication of packaged products

According to an embodiment of a first aspect of the invention, there is provided a distributed network comprising a plurality of nodes. Each of the plurality of nodes is configured to run one or more computational units comprising its own unit state. The network is configured to individually execute, by an execution subset of the plurality of nodes, s set of execution messages in a deterministic manner, thereby mutating the unit states of one or more of the computational units of the execution subset. The network is further configured to regularly make, by the nodes of the execution subset, a read snapshot of the unit states of the one or more computational units of the execution subset and to provide, by one or more nodes of the execution subset, user access to the read snapshot. Further aspects of the invention relate to a corresponding computer-implemented method, a node, a computer program product and a software architecture.

Read access for computational results of a distributed network

Privacy-preserving leakage-deterring public-key encryption techniques are provided. A sender system sends to an authority system a commitment to leakage-deterring-data, and proves in zero-knowledge that the sender system has access to an opening to the commitment. The sender system receives a signature corresponding to a signed commitment to the leakage-deterring-data and an identifier of the sender system. The sender system encrypts a message to a receiver system by applying a one-time pad to the message using a one-time-pad key, and encrypts the result of the application with the public key of the receiver system. The sender system encrypts the one-time-pad key with an attribute-based encryption scheme with a public key of an oblivious decryptor system. The sender system forms a ciphertext from a combination of the encrypted message and the encrypted one-time-pad key and sends the ciphertext to the receiver system.

Privacy-preserving leakage-deterring public-key encryption from attribute-based encryptions

A computer-implemented method for protecting a mobile device against unauthorized access may be provided. The method comprises encrypting the user data stored in a volatile memory of the mobile device if the mobile device is switched to a locked status, and decrypting the user data stored in the volatile memory if the mobile device is switched from the locked status into an unlocked status.

Securing mobile device by RAM-encryption

A method and system for enabling performance of a transaction. A first representation of a transaction policy, which depicts transaction policy options for fulfilling the transaction policy is displayed by a client computer. After a user selects a first transaction policy option, the client computer displays a second representation of the transaction policy, depicting at least one mechanism pertaining to the first transaction policy option for satisfying the requirements of the first transaction policy option. After the user selects a first mechanism, the client computer displays evidence options for each requirement of the first transaction policy option. After the user selects an evidence option for each requirement of the first transaction policy option, the client computer sends to a server transaction enablement information that includes evidence dictated by the selected evidence options to enable the server to perform the transaction.

Enablement of performance of a transaction

An example operation may include one or more of connecting to a blockchain configured to store transactions executed by the participating node, executing a transaction to produce a transaction trail, assigning a transaction identifier (ID) to the transaction, generating a transaction tag based on the transaction ID, and sending to the blockchain the transaction tag and the transaction trail to be entered into the blockchain.

Unfalsifiable audit logs for a blockchain

An example operation may include one or more of connecting, by a participating node, to a blockchain configured to store user assets, receiving, by the participating node, login data from a user, receiving, by the participating node, an asset transfer request from the user identified by the login data, the asset transfer request including identification data of an asset recipient, confirming, by the participating node, that the user is an owner of the asset based on a previous asset transfer transaction associated with the user, verifying, by the participating node, integrity and validity of the asset based on blockchain records, determining, by the participating node, that the asset recipient is a registered user of the blockchain, in response to the determining, by the participating node, that the asset recipient is the registered user of the blockchain, encrypting, by the participating node, an asset transfer transaction by a public key associated with a private key of an auditor; and providing, by the participating node, the encrypted asset transfer transaction to the auditor.

Selective access to asset transfer data

Growing community of inventors

Thalwil, Switzerland

Jan Leonard Camenisch