Lemon Inc.

Haohao Qian

Qiang Yan

Jian Du

Bo Jiang

Yongjun Zhao

Chuyuan Chen

Methods and systems for secure computation and communication are provided. The method includes transforming identifications of a first dataset using a first transforming scheme, and transforming attributes of the first dataset using a second transforming scheme. The method also includes dispatching the transformed first dataset, receiving a second dataset, transforming identifications of the received second dataset, dispatching the identifications of the transformed received second dataset, and receiving a set of identifications. The method further includes generating a first intersection of the received set of identifications and the transformed received second dataset, generating a first share based on the first intersection, receiving a second share, and constructing a result based on the first share and the second share.

Secure computation and communication

Protecting membership in secure multi-party computation and communication is provided. A method of protecting membership includes generating a padding dataset, up-sampling a first dataset with the padding dataset, transforming and dispatching the first dataset, receiving a second dataset, and performing a private set intersection operation based on the first dataset and the second dataset to generate a third dataset. Each of the first dataset, the padding dataset, and/or the second dataset includes one or more personal identification information for each user or member in the dataset.

Protecting membership in a secure multi-party computation and/or communication

Protecting data privacy in secure multi-party computation and communication is provided. A method of protecting data privacy includes determining a differential privacy configuration, determining a number of iterations based on a first parameter and a second parameter, and for each of the number of iterations generating a random value and a random noise data; generating a first message and a second message; and performing a transfer based on the first message, the second message, and an input data to output one of the first message and the second message. The method also includes generating a first noise data based on the random noise data in each of the number of iterations, generating a first share based on a first dataset and a second dataset, applying the first noise data to the first share, and constructing a result based on the first share and a second share.

Secure multi-party computation and communication

Protecting membership and data in secure multi-party computation and communication is provided. A method of protecting membership and data includes generating a padding dataset. A size of the padding dataset is determined based on a data privacy configuration. The method also includes up-sampling a first dataset with the padding dataset, transforming the first dataset, dispatching the first dataset, performing an intersection operation based on the first dataset and a second dataset to generate a third dataset, generating a first share based on the third dataset, and constructing a result based on the first share and a second share.

Protecting membership and data in a secure multi-party computation and/or communication

Methods and systems for protecting membership privacy for secure computation and communication are provided. The method includes providing a first dataset, determining a number N based on a data privacy configuration, and generating a padding dataset having more than N elements. An intersection of the padding dataset and the first dataset is empty. The method also includes shuffling the padding dataset, up-sampling the first dataset with a first N elements of the shuffled padding dataset, and performing an intersection operation based on the up-sampled first dataset and a received dataset.

Protecting membership for secure computation and communication

Differential privacy composition determination in secure computation and communication of a dataset is provided. A method for differential privacy composition determination includes determining a differential privacy configuration that includes a first privacy parameter and a second privacy parameter, determining a privacy loss distribution, and providing a number of composition operations. The method also includes determining a third privacy parameter and a fourth privacy parameter for a differential privacy composition based on the differential privacy configuration, the privacy loss distribution, and the number of composition operations. The method further includes controlling the dataset based on at least one of the third privacy parameter and the fourth privacy parameter.

Fast convolution algorithm for composition determination

Methods and systems for protecting membership privacy in multi-identification secure computation and communication are provided. The method includes providing a dataset having a first set of membership identifications and a second set of membership identifications, determining a number N based on a data privacy configuration, generating and shuffling a first padding dataset, and up-sampling the first set of membership identifications with a first N elements of the shuffled first padding dataset. The method also includes inserting a first N random membership-identification elements to the second set of membership identifications, generating and shuffling a second padding dataset, up-sampling the inserted second set of membership identifications with a first N elements of the shuffled second padding dataset. The method further includes performing an intersection operation based on the up-sampled dataset and a received dataset.

Protecting membership in multi-identification secure computation and communication

Methods and systems for secure computation and communication are described herein. The method includes transforming identifications of a first dataset using a transforming scheme, dispatching the transformed identifications of the first dataset, receiving identifications of a second dataset, transforming the identifications of the second dataset, dispatching the transformed identifications of the second dataset, receiving a set of identifications, generating a first intersection of the received set of identifications and the transformed identifications of second dataset, and determining a first permutation based on the first intersection. The method also includes performing an oblivious shuffling based on the first permutation and a set of attributions to generate a first share. A size of the first share is the same as a size of the first intersection. The method further includes receiving a second share and constructing a first result based on the first share and the second share.

Growing community of inventors

Beijing, China

Haohao Qian