Patent classifications
H04L2209/46
MULTIPARTY COMPUTATION OF A DIGITAL SIGNATURE OF A TRANSACTION WITH ADVANCED APPROVAL SYSTEM
The present invention discloses a method and system for securing digital transactions provided by a person operating a third-party computerized device designed to communicate with a multiparty signing system. The multiparty signing system may comprise a signing subsystem comprising a multiparty signing server designed to receive a request for digital signing and a first subset of end-user nodes designed to sign the digital transaction. The multiparty signing system may also comprise an approving subsystem designed for approving the digital transactions. The approving subsystem may comprise a coordinator and a second subset of end-user nodes for approving the digital transactions.
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.
SYSTEM AND METHOD FOR PROOF-OF-WORK BASED ON HASH MINING FOR REDUCING SPAM ATTACKS
A method for providing a proof-of-work challenge based on hash mining for reducing spam attacks comprising: receiving an email message from a client device; determining a level of trustworthiness of the client device; generating a challenge message based on the determined trustworthiness of the client device; transmitting the challenge message to the client device; receiving a response to the challenge message from the client device; and forwarding the email to one or more recipients when the response to the challenge message is correct.
DATA-OBLIVIOUS COPYING FROM A FIRST ARRAY TO A SECOND ARRAY
Some embodiments are directed to a data retrieval device 210 for data-obliviously copying a subarray of a first array to a second array. The length of the second array is more than one and less than the length of the first array. The length of the subarray is at most the length of the second array. For each first element at a first index in the first array, the data retrieval device selects a second index in the second array for the first index in the first array; data-obliviously computes a choice bit indicative of whether to copy the first element to the second index in the second array; and replaces a second element at the second index in the second array by a replacement element, the replacement element being data-obliviously set to the first element or the second element based on the choice bit.
SYSTEM ARCHITECTURE AND METHOD OF PROCESSING DATA THEREIN
A method of performing ordered statistics between at least two parties is disclosed which includes identifying a first dataset (x.sub.A) by a first node (A), identifying a second dataset (x.sub.B) by a second node (B), wherein x.sub.B is unknown to A and x.sub.A is unknown to B, and wherein A is in communication with B, and wherein A and B are in communication with a server (S), A and B each additively splitting each member of their respective datasets into corresponding shares, sharing the corresponding shares with one another, arranging the corresponding shares according to a mutually agreed predetermined order into corresponding ordered shares, shuffling the ordered shares into shuffled shares, re-splitting the shuffled shares into re-split shuffled shares, and performing an ordered statistical operation on the re-split shuffled shares, wherein the steps of shuffle and re-split is based on additions, subtractions but not multiplication and division.
ANONYMOUS ALLOCATION AND MAJORITY VOTING IN A COMPROMISED ENVIRONMENT
Described is a system for anonymous job allocation and majority voting in a cloud computing environment. The system broadcasts a job to physical nodes, each of the physical nodes having a control operations plane (COP) node and one or more service nodes associated with the COP node. A set of redundant job assignments is distributed to individual COP nodes pursuant to a private job assignment schedule, such that each individual COP node is only aware of its own assignment and corresponding job. The service nodes execute the job assigned to the COP nodes such that the service nodes each complete a task associated with the job and forward an individual result to their associated COP node. A privacy-preserving result checking protocol is performed amongst the COP nodes such that secret shares of a majority result are obtained and the majority result is provided to a client.
DATA DISTRIBUTION METHOD, AUTHENTICATION SERVER, AND DATA STRUCTURE
Provided is a data distribution method for a data distribution system which includes a device and a plurality of authentication servers. The data distribution method includes: receiving, by a first authentication server included in the plurality of authentication servers, transaction data including encrypted history information which is history information of the device encrypted using a secure computation method which enables computation without decrypting the encrypted history information; recording, by the first authentication server, the transaction data in a distributed ledger in synchronization with the plurality of authentication servers excluding the first authentication server, when a validity of the transaction data received from the device is verified by the first authentication server; and performing, by the first authentication server, secure computation on the encrypted history information included in the transaction data, the secure computation being computation processing performed without decrypting the encrypted history information.
BLOCKCHAIN JOINING FOR A LIMITED PROCESSING CAPABILITY DEVICE AND DEVICE ACCESS SECURITY
A computer-implement method comprises: selecting a trusted computing node via smart contract on a blockchain; completing remote attestation of the selected trusted computing node; writing secret information to an enclave of the selected node; causing a thin device to establish a private connection with the selected node without revealing the secret information; and causing the selected node to act as a proxy on the blockchain for the device. Another method comprises: receiving a signed device access request from a device owner; validating, by the verification node, the received request; executing, by a verification node, a smart contract on a blockchain based on the received request; and producing, based on the executed smart contract, an output command to access the device for the device to validate, decrypt and execute.
TECHNIQUES FOR SECURING APPLICATION PROGRAMMING INTERFACE REQUESTS USING MULTI-PARTY DIGITAL SIGNATURES
A system and method for securing application programming interface (API) requests using multi-party digital signatures. The method includes generating, by a first system, at least one first secret share of a plurality of secret shares based on an API secret, wherein the plurality of secret shares includes the at least one first secret share and at least one second secret share, wherein the at least one second secret share is generated by at least one second system; and signing, by the first system, an API request using the at least one first secret share, wherein the API request is further signed by the at least one second system using the at least one second secret share, wherein the API request is signed without revealing any of the at least one first secret share to the at least one second system and without revealing any of the at least one second secret share to the first system.
TECHNIQUES FOR SECURING DIGITAL SIGNATURES USING MULTI-PARTY COMPUTATION
Techniques for securing digital signatures using multi-party computation. A method includes generating at least one first secret share by a first system, wherein at least one second secret share is generated by one of at least one second system; signing data based on the at least one first secret share when a signing policy is met, wherein the signing is part of an interactive signing process including running a multi-party computation protocol by the first system and the at least one second system, wherein the signed data corresponds to a public key generated based on the plurality of secret shares, wherein the signing policy requires a minimum number of secret shares, wherein shares of one system alone are not sufficient to meet the signing policy, wherein no portion of shares of one system are revealed to the other system during the interactive signing process.