Abstract: A method includes a server computer receiving, from a first data provider computer, encrypted data derived from first identity data and a cryptographic key or derivative thereof stored at the first data provider computer. The server computer transmits, to a second data provider computer, the encrypted data and/or the cryptographic key or derivative thereof. The server computer receives, from the second data provider computer, intermediate data derived from second identity data stored at the second data provider computer. The server computer determines if the first identity data and the second identity data are duplicates while the first identity data and the second identity data are encrypted. The server computer removes one of encrypted first identity data, derived from the first identity data, and encrypted second identity data, derived from the second identity data, from a memory in the server computer.

Abstract: Provided is a system, method, and computer program product for preventing MEV attacks in a blockchain network. The system includes at least one processor programmed or configured to communicate a plurality of digests to each mining node of a plurality of mining nodes in a blockchain network, each digest of the plurality of digests generated based on a transaction request including transaction data without including the transaction data in each digest, receive, from at least one mining node of the plurality of mining nodes, block data generated based on a proof-of-work protocol and at least a portion of digests of the plurality of digests, request the transaction data for each transaction request of a plurality of transaction requests corresponding to the at least a portion of digests, and publish a new block to the blockchain network based on the transaction data and the block data.

Abstract: Private set intersection (PSI) protocols can be efficiently performed for sets of disparate sizes. A server can compute an array, such as an inverted Bloom filter or cuckoo hash table, that represents the content of the server set. A client can query the array, e.g., using a private information retrieval (PIR) protocol, to obtain information that enables the client to determine whether a particular element of the client's set is also in the server's set. By repeating the query for each element of the client's set, the client can learn the intersection.

Abstract: A method includes receiving a first encrypted first identity attribute. A first doubly encrypted first identity attribute is formed by encrypting the first encrypted first identity attribute. A second doubly encrypted first identity attribute is formed by encrypting the first encrypted first identity attribute. They are transmitted to a user device, which removes a user layer of encryption on each to form a second encrypted first identity attribute and a third encrypted first identity attribute. Layers of encryption are added to the second encrypted first identity attribute to form a third doubly encrypted first identity attribute and the third encrypted first identity attribute to form a fourth doubly encrypted first identity attribute. The server computer receives them and transmits, to the second identity provider computer, the fourth doubly encrypted first identity attribute. The second identity provider computer obtains a first identity attribute and compares it to a second identity attribute.

Abstract: A method includes receiving, by a user device, an interaction request message for an interaction. The interaction request message comprises a requested amount from a resource provider computer. A secure element on the user device selects between an offline balance and an offline amount of program tokens stored in the secure element. The offline amount of program tokens can be selected. The secure element on the user device can deduct the requested amount from the offline amount of program tokens. The user device can complete the interaction with the resource provider computer.

Abstract: Embodiments are directed to methods and systems that can be used to perform efficient, parallel, privacy-preserving graph analysis. One particular application of embodiments is performing private cycle detection in order to detect anomalous behavior in directional electronic communications. Two (or more) parties can each possess private electronic communication data, which can be used to construct a private directed union graph corresponding to the union of the parties' electronic communication data. This private union graph can be analyzed by a multi-party computation network in order to detect cycles of defined length (e.g., comprising between four and eight communicating participants). These cycles can be used as evidence of anomalous or illicit use of such electronic communications systems.

Abstract: A method includes a server computer receiving, from a first data provider computer, encrypted data derived from first identity data and a cryptographic key or derivative thereof stored at the first data provider computer. The server computer transmits, to a second data provider computer, the encrypted data and/or the cryptographic key or derivative thereof. The server computer receives, from the second data provider computer, intermediate data derived from second identity data stored at the second data provider computer. The server computer determines if the first identity data and the second identity data are duplicates while the first identity data and the second identity data are encrypted. The server computer removes one of encrypted first identity data, derived from the first identity data, and encrypted second identity data, derived from the second identity data, from a memory in the server computer.

Abstract: A method includes receiving, from a second user device, an interaction message comprising an amount and a condition, and a witness. The method also includes verifying an identify of the second user device, and the interaction message by determining that the witness satisfies the condition. Responsive to verifying the interaction message, the method includes adjusting an online balance for the second user device, generating a response message that indicates that the interaction message was successfully evaluated and the amount was added to the online balance, and transmitting the response message to the second user device.

Abstract: Apparatuses, systems, and techniques to optimize processor performance. In at least one embodiment, a method increases an operation voltage of one or more processors, based at least in part, on one or more error rates of the one or more processors.

Abstract: A method is disclosed. The method includes receiving, by a processing network computer from a relying party computer associated with a relying party, a request for data associated with a user operating a user device. The processing network computer may retrieve first encrypted data of the user having a user-layer of encryption. The processing computer can then generate a second symmetric key to add a relying party-layer of encryption to the first encrypted data using a stream cipher. The doubly encrypted data may be transmitted to a user device that removes the user-layer of encryption on the first doubly encrypted data, and then adds a second relying party-layer of encryption to form second doubly encrypted data. The second doubly encrypted data may be transmitted to the relying party computer, which can remove both relying party-layers of encryption to gain access to the data associated with the user.

Abstract: A method includes a server computer receiving, from a first data provider computer, encrypted data derived from first identity data and a cryptographic key or derivative thereof stored at the first data provider computer. The server computer transmits, to a second data provider computer, the encrypted data and/or the cryptographic key or derivative thereof. The server computer receives, from the second data provider computer, intermediate data derived from second identity data stored at the second data provider computer. The server computer determines if the first identity data and the second identity data are duplicates while the first identity data and the second identity data are encrypted. The server computer removes one of encrypted first identity data, derived from the first identity data, and encrypted second identity data, derived from the second identity data, from a memory in the server computer.

Abstract: A method includes receiving a first encrypted first identity attribute. A first doubly encrypted first identity attribute is formed by encrypting the first encrypted first identity attribute. A second doubly encrypted first identity attribute is formed by encrypting the first encrypted first identity attribute. They are transmitted to a user device, which removes a user layer of encryption on each to form a second encrypted first identity attribute and a third encrypted first identity attribute. Layers of encryption are added to the second encrypted first identity attribute to form a third doubly encrypted first identity attribute and the third encrypted first identity attribute to form a fourth doubly encrypted first identity attribute. The server computer receives them and transmits, to the second identity provider computer, the fourth doubly encrypted first identity attribute. The second identity provider computer obtains a first identity attribute and compares it to a second identity attribute.

Abstract: Described are a system and computer program product for secure n-party computation. The system includes a computing device programmed or configured to communicate an input to a trusted execution environment (TEE), and receive a first encrypted output. The computing device is also programmed or configured to post the first encrypted output on a blockchain and receive a first proof of publication. The computing device is further programmed or configured to communicate the first proof of publication to the TEE and receive the first function output of the n-party computation. The computing device is further programmed or configured to communicate a witness to the TEE and receive a second encrypted output. The computing device is further programmed or configured to post the second encrypted output on the blockchain, receive a second proof of publication, communicate the second proof of publication to the TEE, and receive the second function output.

Abstract: A user device generates an initiate interaction request message comprising a state commitment. The user device provides the initiate interaction request message to a first server computer, which creates a verify state request message comprising an interaction index, an interaction index commitment, and a first commitment signature formed from the state commitment and the interaction index commitment. The user device receives the verify state request message, then generates a modified verify state request message comprising a user device public key, the state commitment, the interaction index commitment, and the first commitment signature. The user device provides the modified verify state request message to a second server computer. The second server computer verifies the state commitment, verifies the first commitment signature, and creates a second commitment signature formed from the state commitment and the interaction index commitment.

Abstract: Methods and systems for performing federated private anomaly detection are disclosed. An anomaly detector computer can collaborate with an aggregator computer and an account management computer in order to train machine learning models, which can be used to classify events as not fraudulent or fraudulent. The anomaly detector computer can obliviously use private information (e.g., account flags and account flag values) held by the account management computer to train and use the machine learning models, such that the anomaly detector does not become aware of the account flags or account flags values. Such a system can be used, for example, for the detection and prevention of financial crime. The anomaly detector computer can use the account flag information possessed by the account management computer to identify fraudulent events performed by customers of the organization operating the account management computer.

Abstract: A method includes a first user device generating an interaction message. The interaction message includes an amount, an expiry time, and a condition. The first user device provides the interaction message to a second user device. The second user device creates a witness that satisfies the condition and provides the witness to the first user device. The first user device receives the witness from the second user device. The first user device verifies that the witness satisfies the condition. If the witness satisfies the condition and is received prior to the expiry time, the first user device signs the witness using a first user device private key to obtain a signed witness. The first user device provides the signed witness to the second user device. The second user device verifies a signature of the signed witness and proceeds with obtaining the amount.

Abstract: A hub computer receives, from a first computer, a sender message comprising a promise corresponding to a transaction comprising a promise type, an amount, a first verification key associated with the first computer, computer code, and a digital signature. The hub computer verifies the promise by at least verifying the digital signature using the first verification key, verifying that the amount is less than a first computer amount, and verifying that the hub computer is able to process the promise type. The hub computer executes the computer code to perform the transaction.

Abstract: A user device generates an initiate interaction request message comprising a state commitment. The user device provides the initiate interaction request message to a first server computer, which creates a verify state request message comprising an interaction index, an interaction index commitment, and a first commitment signature formed from the state commitment and the interaction index commitment. The user device receives the verify state request message, then generates a modified verify state request message comprising a user device public key, the state commitment, the interaction index commitment, and the first commitment signature. The user device provides the modified verify state request message to a second server computer. The second server computer verifies the state commitment, verifies the first commitment signature, and creates a second commitment signature formed from the state commitment and the interaction index commitment.

Abstract: Embodiments of the present disclosure enable users to efficiently verify digital data produced by queried databases, even when that data is differentially-private (e.g., satisfying the conditions of differential privacy in order to protect sensitive or private data). In addition to the query result, a database computer can provide the client with a non-interactive zero-knowledge proof (NIZK), data that the client can use to verify the digital data contained in the query result, without revealing any private data to the client. Various innovations, including vectorized proofs, enable the database computer to generate proofs that require less data (e.g., when measured in bytes) than most NIZK proof systems. Consequently, these proofs can be transmitted and verified more quickly and efficiently. Embodiments of the present disclosure can make use of partially or homomorphic commitments and efficient vector proof techniques to achieve these performance improvements.

Abstract: A method is disclosed. The method comprises a receiving a plurality of key-value pairs. The method then generates a random binary matrix of at least weight three. The random binary matrix has a number of non-zero binary values equal to the weight in each row. The method can then assign each key in the plurality of key-value pairs to a row in the random binary matrix. A key matrix can then be generated by appending a dense binary matrix to the random binary matrix. The method can then process the key matrix to output an encoding vector that encodes the values of the plurality of key-value pairs.