Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[HTML][HTML] Private set intersection: A systematic literature review
Abstract Secure Multi-party Computation (SMPC) is a family of protocols which allow some
parties to compute a function on their private inputs, obtaining the output at the end and …
parties to compute a function on their private inputs, obtaining the output at the end and …
Feature inference attack on model predictions in vertical federated learning
Federated learning (FL) is an emerging paradigm for facilitating multiple organizations' data
collaboration without revealing their private data to each other. Recently, vertical FL, where …
collaboration without revealing their private data to each other. Recently, vertical FL, where …
{ABY2. 0}: Improved {Mixed-Protocol} secure {Two-Party} computation
Secure Multi-party Computation (MPC) allows a set of mutually distrusting parties to jointly
evaluate a function on their private inputs while maintaining input privacy. In this work, we …
evaluate a function on their private inputs while maintaining input privacy. In this work, we …
A pragmatic introduction to secure multi-party computation
Secure multi-party computation (MPC) has evolved from a theoretical curiosity in the 1980s
to a tool for building real systems today. Over the past decade, MPC has been one of the …
to a tool for building real systems today. Over the past decade, MPC has been one of the …
Privacy preserving vertical federated learning for tree-based models
Federated learning (FL) is an emerging paradigm that enables multiple organizations to
jointly train a model without revealing their private data to each other. This paper studies {\it …
jointly train a model without revealing their private data to each other. This paper studies {\it …
Fast private set intersection from homomorphic encryption
Private Set Intersection (PSI) is a cryptographic technique that allows two parties to compute
the intersection of their sets without revealing anything except the intersection. We use fully …
the intersection of their sets without revealing anything except the intersection. We use fully …
MASCOT: faster malicious arithmetic secure computation with oblivious transfer
We consider the task of secure multi-party computation of arithmetic circuits over a finite
field. Unlike Boolean circuits, arithmetic circuits allow natural computations on integers to be …
field. Unlike Boolean circuits, arithmetic circuits allow natural computations on integers to be …
Efficient batched oblivious PRF with applications to private set intersection
We describe a lightweight protocol for oblivious evaluation of a pseudorandom function
(OPRF) in the presence of semihonest adversaries. In an OPRF protocol a receiver has an …
(OPRF) in the presence of semihonest adversaries. In an OPRF protocol a receiver has an …
SpOT-light: lightweight private set intersection from sparse OT extension
We describe a novel approach for two-party private set intersection (PSI) with semi-honest
security. Compared to existing PSI protocols, ours has a more favorable balance between …
security. Compared to existing PSI protocols, ours has a more favorable balance between …
Efficient two-round OT extension and silent non-interactive secure computation
We consider the problem of securely generating useful instances of two-party correlations,
such as many independent copies of a random oblivious transfer (OT) correlation, using a …
such as many independent copies of a random oblivious transfer (OT) correlation, using a …