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.

A method for secure multiparty computation of an inner product includes performing multiparty additions to generate a first sum share and a second sum share between two shares of alternating elements from corresponding pairs of elements in a first vector and a second vector, performing multiparty multiplications with at least one other node to generate inner product pair shares corresponding to products of the first sum shares and the second sum shares corresponding to pairs of elements in the first and second vectors, and performing another multiparty addition of each inner product pair share with a first negated shares of pair products corresponding to pairs of elements in the first vector and a second negated shares of pair products corresponding to pairs of elements in the second vector to generate a share of an inner product of the first and second vectors.

Some embodiments are directed to a dealer device for batch-wise provisioning of preprocessing information for a multiparty computation and an evaluator device for batch-wise distributed verification with one or more other evaluator devices of the preprocessing information. The preprocessing information comprises multiple random values and multiple message authentication codes for blinding and integrity checking respectively in the multi-party computation. The multiple random values and a set of proof values together define a checking polynomial. The dealer device computes proof values wherein the checking polynomial is identical to zero. The evaluator device obtains secret-shares of the random values, proof values, and message authentication codes. The evaluator device checks by a distributed computation with the one or more other evaluator devices that an evaluation of the checking polynomial in a random evaluation point is zero, thus verifying that multiple polynomial checking equations are satisfied on the multiple random values.

Methods and systems for performing demographics filtering based on biometric information are disclosed. An access terminal can capture a biometric instance corresponding to a user, such as a fingerprint scan, iris scan, etc. The access terminal can determine demographics information from the biometric instance, such as the age, biological sex, or ethnicity of the user. The access terminal can compare the demographics information to demographics information stored on a group of mobile devices corresponding to a group of users, in order to identify candidate user mobile devices. Once candidate user mobile devices are identified, the access terminal can perform a biometric match between the biometric instance corresponding to the user and biometric instances stored on the candidate user mobile devices. Once a biometric match and the corresponding mobile device are determined, the access terminal can conduct a further interaction with the mobile device.

A secure computing hardware apparatus includes at least a secret generator module, the at least a secret generator module configured to generate a module-specific secret, and a device identifier circuit communicatively connected to the at least a secret generator, the device identifier circuit configured to produce at least an output comprising a secure proof of the module-specific secret. Secret generator module may implement one or more physically unclonable functions to generate the module-specific secret.

The application relates to a method for aggregation of a performance indicator of a device including: concatenating a respective first data item to a plurality of second data items in the device; encrypting the plurality of concatenated second data items relevant for computing the performance indicator using a first encryption key in the device, wherein the first encryption key is based on an additive homomorphic encryption scheme; sending the encrypted concatenated second data items to a computation cluster; computing the performance indicator on the computation cluster using the encrypted concatenated second data items and computing an aggregate value regarding the performance indicator by summing up the encrypted concatenated second data items; sending the aggregate value to a server of a service provider of the device; decrypting the aggregate value using a second encryption key on the server of the service provider; and verifying the decrypted result by checking whether the decrypted sum computed by summing up the encrypted concatenated second data items comprises a predetermined value. The present application also relates to a corresponding system and corresponding computer program product including one or more computer readable media having computer executable instructions for performing the steps of the method.

A secret sharing value of a value represented by a first target bit string is used to obtain a secret sharing value of a value represented by a first check bit string obtained by setting a value of the most significant bit of the first target bit string to a value of a first check bit that is lower than the most significant bit. Here, the first target bit string corresponds to a null value when the most significant bit is 1 and corresponds to a real number when the most significant bit is 0. Next, the secret sharing value of the value represented by the first check bit string is used to obtain secret sharing values of bit values of the least significant bit to first check bit of the first check bit string.

Privacy protection methods, systems, and apparatus, including computer programs encoded on computer storage media, are provided. One of the methods is performed by a second computing device and includes: receiving a data request for object data from a first computing device, wherein the object data is associated with an object and is stored in the second computing device; performing encryption of the object data using a public key associated with the object based on the data request to generate a first ciphertext; obtaining verification data based on the first ciphertext for verifying whether a ciphertext to be verified corresponds to the object data; and sending the verification data to the first computing device for the first computing device to execute a cryptography protocol with a third computing device based on the verification data.

A group of processors in a processor pool comprise a secure enclave in which user code is executable and user data is readable solely with the enclave. This is facilitated through the key management scheme described that includes two sets of key-pairs, namely: a processor group key-pair, and a separate user key-pair (typically one per-user, although a user may have multiple such key-pairs). The processor group key-pair is associated with all (or some define subset of) the processors in the group. This key-pair is used to securely communicate a user private key among the processors. The user private key, however, is not transmitted to non-members of the group. Further, preferably the user private key is refreshed periodically or upon any membership change (in the group) to ensure that non-members or ex-members cannot decipher the encrypted user key.

A computer-implemented method includes: encrypting, by a first data party, identification data to generate a first identification data ciphertext, in which the first data party holds an identification dataset including the identification data; sending a first ciphertext set to a second data party, in which the first ciphertext set includes the first identification data ciphertext; receiving a second ciphertext set from the second data party; decrypting the second identification data ciphertext to generate a third identification data ciphertext, in which a third ciphertext set includes the third identification data ciphertext; receiving a fourth ciphertext set from the second data party, obtaining the third identification data ciphertext common to the third ciphertext set and the fourth ciphertext set; calculating a homomorphic addition result of the business data ciphertext corresponding to the third identification data ciphertext; and sending the homomorphic addition result to the second data party.