Seagate Technology Incorporated

Vipin Singh Sehrawat

Foo Yee Yeo

Nolan Miranda

Kian Beng Lim

Hamza Jeljeli

Saravanan Nagarajan

Varun Reddy Boddu

Dmitriy Vassilyev

A secret sharing scheme with yes and no shares and having a hidden access structure. The secret sharing scheme may include share generation in which yes shares and no shares are generated for, and distributed to, each party in the secret sharing scheme. In turn, upon an attempt to reconstruct the secret, participants in the reconstruction each provide a share, which is unknown to be a yes share or a no share to the other participants. The secret is only reconstructable if the shares used in the reconstruction include yes shares of a minimal authorized subset of the parties. However, prior to secret reconstruction, the access structure remains hidden and the participants in a reconstruction are unaware of the character of the shares provided by other participants in the reconstruction attempt.

Yes and no secret sharing with hidden access structures

Polynomial function secret sharing provides for computation of reconstruction share results for a polynomial function on an input. An allocatable share of the polynomial function is received at a computing system of the share result computation systems. The allocatable share is generated from the polynomial function. Each of the allocatable shares is distributed to a unique share result computation system of the share result computation systems. Each allocatable share includes a share element for each coefficient in the polynomial function, wherein the share elements for a coefficient across the share result computation systems summing to the coefficient. A reconstruction share result is generated at the computing system by computing a dot product of the input and the allocatable share received by the computing system. A combination of the reconstruction share results generated by the share result computation systems yields a reconstructed result of the polynomial function on the input.

Polynomial function secret sharing

The disclosure provides systems and methods for a multi-party secret sharing protocol that includes determining device channel errors of a plurality of computing devices based on channel impulse response (CIR) of communication channels of the plurality of computing devices, training a linear regression model using the device channel errors to generate learning with error (LWE) secrets for each of the plurality of computing devices, generating a general access structure secret matrix using the LWE secrets from each of the plurality of computing devices, and distributing shares of the general access structure secret matrix to the plurality of computing devices based on a multi-party secret sharing protocol.

Device specific multiparty computation

A computer-implemented method receives at least two unique versions of program code of a program, generates a code-based key for each unique version of the program code, generates a code-based signature for each unique version of the program using a bi-homomorphic pseudorandom function selected from a family of bi-homomorphic pseudorandom functions. Each code-based signature is generated by the selected bi-homomorphic pseudorandom function based on the corresponding code-based key. Each generated code-based signature for each unique version of the program code is incorporated into the program code of the corresponding unique version of the program.

Code-based signatures for secure programs

A computing system can have a data storage device connected to a host as part of a distributed computing system with an initial reputation score assigned to the data storage device with a decentralize module. The data storage device is positioned in a hierarchical device organization based on the reputation score with the hierarchical device organization maintained by the decentralize module. A decentralized secret sharing scheme generated by the decentralize module can authenticate the host with multiple different secrets sourced from different components logically positioned in different levels of the hierarchical device organization.

Computing system with decentralized authentication and authorization

A function is decomposed into a plurality of function shares. The function returns a Boolean result based on whether an input y satisfies a query on a data set. The function shares hide the function from non-collaborating entities that separately execute the function shares. Each of the functions shares are sent to one of a plurality of servers having a same data set. The function shares are executed on the data set at the servers to obtain a respective plurality of shares. A conditional disclosure of secrets operation is simulated on the shares and the input y. The conditional disclosure of secrets operation uses a secret known to at least one of the servers, and further uses a source of randomness shared between the servers. A Boolean value corresponding to the Boolean result is returned based on the conditional disclosure of secrets operation returning the secret.

System and method utilizing function secret sharing with conditional disclosure of secrets

A function secret sharing (FSS) scheme that facilitates multiple evaluations of a secret function. The FSS scheme includes a function share based on a secret function and at least one key of a key-homomorphic pseudo random function (PRF). At least one key and a function share are provided to each party in the FSS scheme. In turn, each party may generate an output share comprising a function share output evaluated at a function input and a masking component generated based on the at least one key in relation to the key-homomorphic PRF. In turn, the output shares of each participating party may be combined to evaluate the secret function. The FSS scheme facilitates multiple evaluations of the secret function without leaking information regarding the secret function.

Multiple evaluation threshold function secret sharing

A method includes receiving, in a data storage device, a request from a client computer for a portion of ciphertext stored in the data storage device, and providing, by a controller of the data storage device, the portion of the ciphertext to the client computer. The method also includes receiving, in the data storage device, an update token generated by the client computer from the portion of the ciphertext. The method further includes performing, by the controller of the data storage device, re-encryption of the ciphertext using the update token.

Post-quantum secure key-rotation for storage devices

A method for distributed and private symmetric searchable encryption includes receiving encrypted data, creating a search index for one or more servers based on the encrypted data using a distributed point function (DPF), splitting the encrypted data into a number of portions based on the number of servers, and partitioning the servers into two or more groups. The method also includes updating the search index based on the splitting and the partitioning, transmitting the split encrypted data to the servers based on the updated search index, verifying the transmitted data using data not transmitted to the server, and determining, based on the verifying, whether any server deviated from an assigned protocol.

Search and access pattern hiding verifiable searchable encryption for distributed settings with malicious servers

Tokenized assets with associated value are transferred from a designated server to a mobile device. The associated value is removed from the designated server. The tokenized assets are transferred to a first trusted electronic device. The first trusted electronic device is associated with the mobile device. At least a portion of the tokenized assets are transferred to a second trusted electronic device such that the portion of the tokenized assets are only stored on the second trusted electronic device after the transfer. The second electronic device is associated with a second mobile device. The transfer occurs at a time when both the mobile device and the electronic device are offline.

Offline value transfer using asymmetric cryptography

A homomorphic encryption system evaluates homomorphically encrypted data, including receiving ciphertext input homomorphically encrypted from a plaintext input using a set-system including sets having an intersection property. An arithmetic function is evaluated on the ciphertext input to generate a ciphertext output, the arithmetic function including one or more additive gates and one or more multiplicative gates, wherein the evaluating operation generates errors during evaluation of the arithmetic function and the intersection property of the sets cancel out the errors during the evaluating operation. The ciphertext output is transmitted for homomorphic decryption to generate a plaintext result.

Fully homomorphic encryption from error canceling set systems

A homomorphic encryption system receives a ciphertext output of an arithmetic evaluation function. The arithmetic evaluation function is performed on a ciphertext input homomorphically encrypted from a plaintext input using a set-system including sets having an intersection property. The ciphertext output is decrypted using a summation of two or more noise-canceling party identifiers of two or more authorized parties, wherein the intersection property of the sets cancels out errors generated during the decrypting operation for the two or more authorized parties.

Enforcing access structures in fully homomorphic encryption

A method of improving data security or privacy in a computing environment includes providing a group identifier value to at least a first user of one or more users and associating a first pseudonym with the first user. The method further includes encrypting a first data set according to a private key and marking the encrypted first data set according to the group identifier and the first pseudonym. The method also includes performing a first operation on the encrypted first data set and transforming the encrypted first data set into an encrypted second data set according to the first operation performed and the first pseudonym, decrypting the encrypted second data set using the private key, and analyzing the decrypted second data set.

Privacy preserving fully homomorphic encryption with circuit verification

In one implementation, the disclosure provides systems and methods for generating a secure signature using a device-specific and group-specific moving target authentication protocol. According to one implementation, generating the secure signature entails determining a state of a first device in association with a select time interval. The state of the first device is defined by one or more time-variable characteristics of the first device. The device computes an output for a signing function that depends upon the determined state of the first device associated with the first time interval.

Growing community of inventors

Singapore, Singapore

Vipin Singh Sehrawat