Abstract: An encryption method comprises: creating an asymmetric profile key comprising a multipart threshold key using a set of user devices; signing a declaration using the profile key and the set of user devices, the declaration identifying the set of user devices; creating an asymmetric location key comprising two multipart threshold keys; sharding and storing the asymmetric location key; creating a symmetric key; encrypting a file with the symmetric key; encrypting the symmetric key with the location key; and storing the encrypted file and encrypted key such that the encrypted file cannot be decrypted without decrypting the location key by a threshold of the set of user devices.

Abstract: A method for searching an encrypted file comprises: receiving a query from a first device of a set of devices; tokenizing the query; searching the encrypted file, without decrypting the file, for the tokenized query; aggregating results of the search; and outputting the aggregated results. The searching includes checking a bloom filter of an index of the encrypted file. The index includes a file public secret (R), a proof of work for the file secret (Rproof), a multipart threshold public encryption key (LKe-pub), a multipart threshold public search key (LKs-pub), and the bloom filter. The bloom filter including index values that are elliptic curve paired between a curve-hashed token of the encrypted file and the product of the encrypted file's ephemeral secret value (r) and the multipart threshold public search key (LKs-pub).

Abstract: A method comprises: tokenizing, at a first device, a search query; creating search requests and send to delegate devices, each search request including a public key encrypted message containing the tokenized search query and index identifiers of indices to be searched; computing search responses to the search requests, each search response comprising a partial trapdoor computed per token per identifier; transmitting the search responses to the first device; recombining, at the first device, the search responses per identifier per token; performing a ranked set of queries against the indices; and returning the search results in order of relevancy.

Abstract: A method comprises: tokenizing, at a first device, a search query; creating search requests and send to delegate devices, each search request including a public key encrypted message containing the tokenized search query and index identifiers of indices to be searched; computing search responses to the search requests, each search response comprising a partial trapdoor computed per token per identifier; transmitting the search responses to the first device; recombining, at the first device, the search responses per identifier per token; performing a ranked set of queries against the indices; and returning the search results in order of relevancy.

Abstract: A method comprises: tokenizing, at a first device, a search query; creating search requests and send to delegate devices, each search request including a public key encrypted message containing the tokenized search query and index identifiers of indices to be searched; computing search responses to the search requests, each search response comprising a partial trapdoor computed per token per identifier; transmitting the search responses to the first device; recombining, at the first device, the search responses per identifier per token; performing a ranked set of queries against the indices; and returning the search results in order of relevancy.

Abstract: A method for searching an encrypted file comprises: receiving a query from a first device of a set of devices; tokenizing the query; searching the encrypted file, without decrypting the file, for the tokenized query; aggregating results of the search; and outputting the aggregated results. The searching includes checking a bloom filter of an index of the encrypted file. The index includes a file public secret (R), a proof of work for the file secret (Rproof), a multipart threshold public encryption key (LKe-pub), a multipart threshold public search key (LKs-pub), and the bloom filter. The bloom filter including index values that are elliptic curve paired between a curve-hashed token of the encrypted file and the product of the encrypted file's ephemeral secret value (r) and the multipart threshold public search key (LKs-pub).

Abstract: An encryption method comprises: creating an asymmetric profile key comprising a multipart threshold key using a set of user devices; signing a declaration using the profile key and the set of user devices, the declaration identifying the set of user devices; creating an asymmetric location key comprising two multipart threshold keys; sharding and storing the asymmetric location key; creating a symmetric key; encrypting a file with the symmetric key; encrypting the symmetric key with the location key; and storing the encrypted file and encrypted key such that the encrypted file cannot be decrypted without decrypting the location key by a threshold of the set of user devices.

Abstract: A method comprises: tokenizing, at a first device, a search query; creating search requests and send to delegate devices, each search request including a public key encrypted message containing the tokenized search query and index identifiers of indices to be searched; computing search responses to the search requests, each search response comprising a partial trapdoor computed per token per identifier; transmitting the search responses to the first device; recombining, at the first device, the search responses per identifier per token; performing a ranked set of queries against the indices; and returning the search results in order of relevancy.

Abstract: A method comprises: tokenizing, at a first device, a search query; creating search requests and send to delegate devices, each search request including a public key encrypted message containing the tokenized search query and index identifiers of indices to be searched; computing search responses to the search requests, each search response comprising a partial trapdoor computed per token per identifier; transmitting the search responses to the first device; recombining, at the first device, the search responses per identifier per token; performing a ranked set of queries against the indices; and returning the search results in order of relevancy.

Abstract: A method comprises: receiving, at a first device, a request to decrypt data encrypted with a symmetric key, the encrypted data stored on a memory device and determining if the request is part of an active session based on configuration parameters and session status. In response to determining the request is part of an active session, the method further comprises: requesting, by the first device, decryption by a plurality of devices of shards of the symmetric key, the shards encrypted with public keys from the plurality of devices, wherein decryption of the data requires reconstituting the symmetric key from a threshold number of the shards; receiving decrypted shards until the threshold number of shards is reached; updating the session status; reconstituting, by the first device, the symmetric key from the decrypted shards; and decrypting, by the first device, the encrypted data with the symmetric key.

Abstract: A method comprises: tokenizing, at a first device, a search query; creating search requests and send to delegate devices, each search request including a public key encrypted message containing the tokenized search query and index identifiers of indices to be searched; computing search responses to the search requests, each search response comprising a partial trapdoor computed per token per identifier; transmitting the search responses to the first device; recombining, at the first device, the search responses per identifier per token; performing a ranked set of queries against the indices; and returning the search results in order of relevancy.