Patent classifications
H04L2209/46
Large network attached storage encryption
Techniques for storing encrypted data using a storage service system are described herein. A computer system of a computation layer of the storage service system receives an encrypted key manifest, which is then decrypted using a cryptoprocessor of the computer system of the computation layer to produce a partition key. The partition key is then provided to a file system abstraction layer so that, as data is provided to the computation layer for storage, the file system abstraction layer can use the partition key to encrypt data and store the encrypted data in the storage layer.
CORRELATION COEFFICIENT ACQUISITION METHOD, ELECTRONIC DEVICE AND NON-TRANSITORY COMPUTER READABLE STORAGE MEDIUM
Provided are a correlation coefficient acquisition method, an electronic device, and a non-transitory computer readable storage medium. The implementation scheme is as follows: first original data is acquired, the first original data is homomorphically encrypted by using an associated key to determine first transmission data, where the associated key is jointly agreed by the first participation node and a second participation node; the first transmission data is sent to an auxiliary node so that the auxiliary node receives the first transmission data and performs a homomorphic operation on the first transmission data and second transmission data to obtain correlation coefficients between the first original data and second original data, where the second transmission data is determined by the second participation node homomorphically encrypting the second original data by using the associated key; and the correlation coefficients fed back by the auxiliary node is received.
SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR SECURE REAL-TIME N-PARTY COMPUTATION
Described are a system, method, and computer program product for secure real-time n-party computation. The method includes communicating, to a trusted execution environment (TEE), a first computation input and a first portion of a one-time key. The method also includes receiving, from the TEE, an encrypted output of a computation based on the first computation input and a second computation input communicated to the TEE by a second computing device. The method further includes communicating the encrypted output to the second computing device and receiving a digital signature indicating that the second computing device received the encrypted output. The method further includes communicating the first portion of the one-time key to the second computing device and, in response to not receiving the second portion of the one-time key from the second computing device, executing a fallback computation process using the TEE and a shared ledger to determine the computation.
Privately querying a database with private set membership using succinct filters
A method includes obtaining, from a server, a filter including a set of encrypted identifiers each encrypted with a server key controlled by the server. The method includes obtaining a request that requests determination of whether a query identifier is a member of a set of identifiers corresponding to the set of encrypted identifiers. The method also includes transmitting an encryption request to the server that requests the server to encrypt the query identifier. The method includes receiving, from the server, an encrypted query identifier including the query identifier encrypted by the server key and determining, using the filter, whether the encrypted query identifier is not a member of the set of encrypted identifiers. When the encrypted query identifier is not a member of the set of encrypted identifiers, the method includes reporting that the query identifier is not a member of the set of identifiers.
SYSTEMS AND METHODS FOR CONVERTING DATA FROM INT-64 TO BOOLEAN FOR COMPUTATIONS
A method is disclosed for simplifying multi-party computation processes. The method includes converting a first n-bit-value data at a first computing device into a Boolean space, generating a first respective binary share of each respective first respective Boolean portion of the first n Boolean portions and a second respective binary share of each respective first respective Boolean portion of the first n Boolean portions, transmitting the second respective binary share to a second computing device, receiving, at the first computing device, a first respective binary share of each respective Boolean portion of a second n Boolean portions generated on the second computing device and performing a computation in Boolean space using the first respective binary share of each respective first Boolean portion of the first n Boolean portions and the first respective binary share of each respective Boolean portion of the second n Boolean portions.
Systems and methods for conducting cryptographically secure actions in public, non-permissioned blockchains using bifurcated self-executing programs
Systems and methods for a bifurcated self-executing program that wraps a first self-executing program (e.g., a first smart contract) on a blockchain within a second self-executing program (e.g., a second smart contract), in which the second self-executing program enforces the requirement for particular security credentials/certificates. The bifurcated self-executing program comprises a single compiled self-executing program that combines the first self-executing program and the second self-executing program.
MULTI-PARTY COMPUTATION IN A COMPUTER SHARDING ENVIRONMENT
Methods and systems are presented for providing a framework for facilitating multi-party computation within a sharding environment. After a blockchain is divided into multiple shard chains, a multi-party computation system obtains attributes associated with a first shard chain. The attributes may represent characteristics of the first shard chain, characteristics of transactions recorded in the first shard chain, and characteristics of the computer nodes configured to manage the first shard chain. Based on the attributes, the multi-party computation system determines a multi-party computation scheme that specifies a minimum threshold number of nodes required to participate in a transaction validation process and at least one required node required to participate in the transaction validation process for the first shard chain. The multi-party computation system configures the computer nodes configured to manage the first shard chain to perform the transaction validation process according to the multi-party computation scheme.
EVALUATION OF A MONITORING FUNCTION
According to one aspect, there is provided a server for use in evaluating a monitoring function to determine if a trigger condition is satisfied. The server comprises a processing unit and a memory unit. The memory unit is for storing a current monitoring state Ss of the server or an encrypted current monitoring state S of the monitoring function, the current monitoring state Ss of the server relating to the current monitoring state S of the monitoring function that is based on an evaluation of one or more previous events. The processing unit is configured to receive an indication of a first event from a first client node and evaluate the monitoring function to determine if the first event satisfies the trigger condition. The evaluation is performed using a privacy-preserving computation, PPC, with the server providing the current monitoring state Ss of the server as a first private input to the PPC or the encrypted current monitoring state S of the monitoring function as a first input to the PPC, and the first client node providing the first event or an encryption thereof as a private input to the PPC. The evaluation of the monitoring function provides an encrypted updated monitoring state S′ of the monitoring function or an updated monitoring state Ss′ of the server as an output of the monitoring function and an indication of whether the first event satisfies the trigger condition.
SYSTEM AND METHOD OF CRYPTOGRAPHIC KEY MANAGEMENT IN A PLURALITY OF BLOCKCHAIN BASED COMPUTER NETWORKS
Systems and methods of cryptographic key distribution in a plurality of networks, including: sharing, by a first device, a first portion of a first cryptographic key controlled by a server with a second device, sharing, by the second device, a first portion of a second cryptographic key with the first device, signing a first transaction on a first network with data exchange from a first threshold signature address controlled by the first device, to a third address when one or more details of the first transaction are validated by the server; and signing a second transaction on a second network with data exchange from the second threshold signature address controlled by the second device to a fourth address when one or more details of the second transaction are validated by the server.
Collaborative architecture for secure data sharing
A device participates in a cyclical collaboration system. The device receives a request from a third party. A request value is determined that is associated with the request. A first random number is determined based on the first request value. The first random number is provided to a downstream device. A second random number is received that is generated by a upstream device. A first encrypted request value is determined based on the first request value, the first random number, and the second random number. The first encrypted request value is provided to a multiple party encryption subsystem. Encrypted request values generated by other participants of the cyclical collaboration network are received from the multiple party encryption subsystem. A validation score is determined based on the first encrypted request values and the encrypted request values received from the multiple party encryption subsystem.