Systems and methods for performing modular inversion operations in a manner protected from external monitoring attacks. An example method comprises: determining, by a processor, a first masked value based on a public cryptographic key and a first random integer value; determining a second masked value based on the public cryptographic key and a second random integer value, and determining, based on the first masked value and the second masked value, a private cryptographic key represented by a modular inversion of the public cryptographic key.

Systems and methods describe providing batch processing of blockchain-based cryptocurrency transactions. First, the system receives or derives a number of public keys each associated with a digital wallet for cryptocurrency, then maintains a communication path to each digital wallet using the public keys. The system receives a transaction request from each digital wallet, then generates a transaction containing transaction details for each digital wallet. A request is sent to each digital wallet in the transaction to verify the transaction details for that digital wallet, and signature are received from each digital wallet based on the request to verify the transaction details for that digital wallet. Upon receiving signatures from each of the digital wallets, the system broadcasts the transaction at a blockchain network.

This disclosure relates generally to a method and system for biometric verification. Conventional biometric verification method and system performs one or more computations in non-encrypted domain, thereby leading to security threats. The disclosed method includes performing computations such as enrollment and verification feature vector computation, dimensionality reduction of said feature vectors, and comparison of dimensionally reduced encrypted feature vectors to obtain matching scores indicating the extent of match therebetween between in encrypted domain using fully homomorphic encryption, thereby leading to secure biometric verification.

A homomorphic operation accelerator includes a plurality of circuits and a homomorphic operation managing circuit. The plurality of circuits may perform homomorphic operations. The homomorphic operation managing circuit may receive ciphertext data, homomorphic encryption information and homomorphic operation information from an external device. The homomorphic operation managing circuit may activate or deactivate each of a plurality of enable signals applied to the plurality of circuits based on the homomorphic encryption information and the homomorphic operation information. The homomorphic operation managing circuit may activate or deactivate each of the plurality of circuits based on the plurality of enable signals. The homomorphic encryption information may be associated with a homomorphic encryption algorithm used to generate the ciphertext data. The homomorphic operation information may be associated with the homomorphic operations to be performed on the ciphertext data.

A method is provided for solving a computational problem that is reducible to a problem of counting solutions to an associated decision problem. The method includes, using a quantum computer, estimating a number of the solutions to the decision problem by determining if there is at least one solution to the decision problem that lies in a pseudo-random set. The method also includes outputting or using the estimated number of the solutions to the decision problem as a solution to the computational problem. Determining if there is at least one solution to the decision problem that lies in the pseudo-random set could include determining if there is a sequence of solutions to the decision problem that, taken together, lies in the pseudo-random set.

A method may include collecting from each of multiple endpoint devices a set of anonymized interactions of the corresponding endpoint device with other endpoint devices. Each anonymized interaction in the set of anonymized interactions may be based on an ephemeral unique identifier of another endpoint device involved in a corresponding anonymized interaction with the corresponding endpoint device. The method may include, for each endpoint device, resolving identities of the other endpoint devices with which the corresponding endpoint device has interacted from the corresponding set of anonymized interactions.

Briefly, embodiments are directed to a system, method, and article for acquiring a symbol comprising a representation of input data. The symbol may be converted into an emergent language expression in an emergent language via processing of a first neural network. Transmission of the emergent language expression may be initiated over a communications network, where the emergent language comprises a language based on and specific to the input data. The emergent language expression may be translated back into the representation of the input data via processing of a second neural network.

In an embodiment, a public key generated by each user of a plurality of users is used to encrypt the contacts for that user. The result of the encryption are sent to a central server by each user. The key generated by each user is then distributed to every other user in the system, and each recipient encrypt their contacts with the public keys that are sent by the server. The result of these encryptions for all contacts for all recipients is then received by the server, and the server computes an encrypted computation of equality of two contacts and sends all computations back to the original user. The user can use the homomorphic property of the crypto protocol (e.g., a private key) to determine a set of users that are matched as contacts with the other users. The binary results are returned to the server, and the server computes a graph using the results.

Discloses a method and an apparatus for visual construction of a knowledge graph system. In the present disclosure, data permission of a distributed client is determined through a central server. The central server obtains a master template of a knowledge graph system and sends it to the distributed client. The distributed client receives a natural language inputted by a user and parses to generate an abstract syntax tree. The user completes customization of a subtemplate of the knowledge graph system through visual operation. The distributed client encrypts the subtemplate and then sends it to the central server. When the knowledge graph system is to be used, any knowledge concept is inputted, the central server calls and decrypts the subtemplate and then searches a database, and a tree structure knowledge graph is generated and sent to the distributed client.

Methods, systems, and computer programs for generating cryptographic function parameters are described. In some examples, source code that defines seed information and a pseudorandom function is accessed. A parameter for a cryptographic function by operation of one or more data processors is generated. The parameter is generated from the seed information and the pseudorandom function. The parameter has a larger size in memory than the source code that defines the seed information and the pseudorandom function.