A system and method are disclosed for providing a private multi-modal artificial intelligence platform. The method includes splitting a neural network into a first client-side network, a second client-side network and a server-side network and sending the first client-side network to a first client. The first client-side network processes first data from the first client, the first data having a first type. The method includes sending the second client-side network to a second client. The second client-side network processes second data from the second client, the second data having a second type. The first type and the second type have a common association. Forward and back propagation occurs between the client side networks and disparate data types on the different client side networks and the server-side network to train the neural network.

A method, apparatus and system for implementing zero-knowledge proofs is provided. Partitioned garbled circuits are used to achieve a joint zero-knowledge proof system with full syntax verification. A polylithic syntax is used for handling complex semantics involving more than one statement to be proved and verified. Multiple verifiers can participate in a coordinated manner to perform the verification. Different verifiers can perform different parts of the verification.

A blockchain-implemented transaction from an originator node is to be broadcast. The originator node is communicatively coupled to proxy nodes. The method, implemented by a proxy node, includes: receiving a transaction including an input taking x+r units of computing resources, an output providing x units to the output address and another output providing d+r units to a 1-of-n multi-signature address unlockable by any one of a set of private keys associated the proxy nodes. The proxy node selects a quantity of computing resources, t units, to be allocated to the proxy node for broadcasting the transaction and having it included in the blockchain and generates a further transaction taking d+r units sourced from the multi-signature address and an output providing t units to the proxy node. The proxy node broadcasts both transactions timed to permit their inclusion in the same block of the blockchain.

Embodiments of the present disclosure provides protocols, methods and systems which provides advantages such as the resistance of centralisation of mining on a blockchain network, preferably a Proof-of-Work blockchain. A method in accordance with an embodiment may comprise generating a plurality of non-parallelisable challenges (or puzzles) and allocating one of said plurality of challenges to each miner on the network. The miner uses an inherently sequential (non-parallelisable) algorithm to find a solution to his allocated challenge. The challenges are generated by a committee of nodes, and a new set of challenges is generated for each block.

A system is provided for electronic data encryption and decryption using a consensus draft process. In particular, the system may use a custom encryption algorithm that generates an array with a number of entries that is dependent on the number of computing devices that participate in the encryption process. The encryption algorithm may cause a first computing device to open and read the array, randomly select and remove an entry, and pass on the remaining entries to a second computing device. The second computing device may then open and read the array, randomly select and remove an entry, then pass the remaining entries to a third computing device. The process may be executed in a reiterative manner until the entire array is distributed among the participating computing devices. In this way, encryption of data may be performed without revealing shared information among the participating computing devices.

The subject matter discloses a method for providing identity to a software module, comprising splitting a secret key using a split multi-party computation (MPC) process between the software module and a security server and storing one share of the secret key in the software module and another share of the secret in the security server, the security server receiving a request from the software module to access a resource, in response to the request, the security server encrypts a message, said encrypted message is obtained by the software module, the software module initiates a decryption multi-party computation (MPC) process to decrypt the message encrypted by the security server using according to the shares of the secret key, the security server receives the decrypted secret and the public key and the security server signs a certificate associated with the requested resource and the software module and sends the certificate to the software module.

Computer-implemented systems and methods are disclosed herein for use within secure multi-party computation. A system and method are used for storing an operation preference and a cryptographic preference. A data set is stored based on the operation preference and the cryptographic preference. A determination is made that processing the query involves performing an allowable operation on the data set based on the operation preference.

Fisher's exact test is efficiently computed through secure computation. A computation range determination part 12 determines i.sub.0, i.sub.1, x.sub.0, x.sub.1. A preliminary computation part 13 computes f(x.sub.0), . . . , f(x.sub.1), and generates an array M=(f(x.sub.0), . . . , f(x.sub.1)). A securing part 14 secures the array M, and generates a secure text array <M>=(<f(x.sub.0)>, . . . , <f(x.sub.1)>). A batch-reading part 15 executes the following formulae, and generates a function value secure text (<f(a.sub.i)>, <f(b.sub.i)>, <f(c.sub.i)>, <f(d.sub.i)>)(i.sub.0ii.sub.1).

(<f(a.sub.i.sub.0)>,<f(a.sub.i.sub.0.sub.+1)>, . . . ,<f(a.sub.i.sub.1)>)BatchRead(<M>;<a>;i.sub.0,i.sub.0+1, . . . ,i.sub.1),

(<f(b.sub.i.sub.0)>,<f(b.sub.i.sub.0.sub.+1)>, . . . ,<f(b.sub.i.sub.1)>)BatchRead(<M>;<b>;i.sub.0,(i.sub.0+1, . . . ,i.sub.1),

(<f(c.sub.i.sub.0)>,<f(c.sub.i.sub.0.sub.+1)>, . . . ,<f(c.sub.i.sub.1)>)BatchRead(<M>;<c>;i.sub.0,(i.sub.0+1, . . . ,i.sub.1),

(<f(d.sub.i.sub.0)>,<f(d.sub.i.sub.0.sub.+1)>, . . . ,<f(d.sub.i.sub.1)>)BatchRead(<M>;<d>;i.sub.0,i.sub.0+1, . . . ,i.sub.1)

A secure equijoin technique of generating one table from two tables while curbing the volume of communications traffic is provided. The technique includes: a first permutation generating means 110 that generates a permutation <> from an element sequence which is generated from the first column of a table L and the first column of a table R; a first column generating means 120 that generates, for j=2, . . . , a, by using the permutation <>, a prefix sum, and an inverse permutation <.sup.1>, the j-th column of a table J from an element sequence which is generated from the to j-th column of the table L; a join-result element sequence generating means 130 that generates a join-result element sequence from an element sequence ([[1]], . . . , [[1]], [[0]], . . . , [[0]], [[1]], . . . , [[1]]) by using the permutation <>, the prefix sum, and the inverse permutation <.sup.1 >; a second column generating means 140 that generates, for j=a+1, . . . , a+b1, the j-th column of the table J by using the join-result element sequence and the ja+1-th column of the table R; and a third column generating means 150 that generates the first column of the table J by using the join-result element sequence and the first column of the table R.

A method for achieving consensus amongst a distributed and decentralized set of computers, devices or components in a network interacting via messaging is presented. The method does not rely on the availability of an overall ledger that is consulted for every interaction. Rather, the interacting components communicate directly with each other via messages that contain proofs of consistency that may be used to achieve local consistency amongst the interacting components. Local consistency guarantees global consistency. For regulatory and record keeping purposes, use of an overall ledger may be contemplated for regulatory and record keeping purposes. The latter may be updated by the interacting devices via an asynchronous updating mechanism.