Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Secure and private function evaluation with Intel SGX
Secure function evaluation (SFE) allows two parties to jointly evaluate a publicly known
function without revealing their respective inputs. SFE can be realized via well-known …
function without revealing their respective inputs. SFE can be realized via well-known …
Stacked garbling: Garbled circuit proportional to longest execution path
Secure two party computation (2PC) of arbitrary programs can be efficiently achieved using
garbled circuits (GC). The bottleneck of GC efficiency is communication. It is widely believed …
garbled circuits (GC). The bottleneck of GC efficiency is communication. It is widely believed …
Let's stride blindfolded in a forest: Sublinear multi-client decision trees evaluation
Decision trees are popular machine-learning classification models due to their simplicity and
effectiveness. Tai et al.(ESORICS'17) propose a privacy-preserving decision-tree evaluation …
effectiveness. Tai et al.(ESORICS'17) propose a privacy-preserving decision-tree evaluation …
Privmail: A privacy-preserving framework for secure emails
Emails have improved our workplace efficiency and communication. However, they are often
processed unencrypted by mail servers, leaving them open to data breaches on a single …
processed unencrypted by mail servers, leaving them open to data breaches on a single …
Valiant's universal circuits revisited: an overall improvement and a lower bound
A universal circuit (UC) is a general-purpose circuit that can simulate arbitrary circuits (up to
a certain size n). At STOC 1976 Valiant presented a graph theoretic approach to the …
a certain size n). At STOC 1976 Valiant presented a graph theoretic approach to the …
Pushing the limits of valiant's universal circuits: Simpler, tighter and more compact
A universal circuit (UC) is a general-purpose circuit that can simulate arbitrary circuits (up to
a certain size n). Valiant provides ak-way recursive construction of UCs (STOC 1976), where …
a certain size n). Valiant provides ak-way recursive construction of UCs (STOC 1976), where …
Linear-complexity private function evaluation is practical
Private function evaluation (PFE) allows to obliviously evaluate a private function on private
inputs. PFE has several applications such as privacy-preserving credit checking and user …
inputs. PFE has several applications such as privacy-preserving credit checking and user …
Breaking the size barrier: Universal circuits meet lookup tables
Abstract A Universal Circuit (UC) is a Boolean circuit of size Θ (n log n) that can simulate any
Boolean function up to a certain size n. Valiant (STOC'76) provided the first two UC …
Boolean function up to a certain size n. Valiant (STOC'76) provided the first two UC …
MOTIF:(Almost) Free Branching in GMW: Via Vector-Scalar Multiplication
MPC functionalities are increasingly specified in high-level languages, where control-flow
constructions such as conditional statements are extensively used. Today, concretely …
constructions such as conditional statements are extensively used. Today, concretely …
: Stacked Garbling with Computation
Secure two party computation (2PC) of arbitrary programs can be efficiently achieved using
garbled circuits (GC). Until recently, it was widely believed that a GC proportional to the …
garbled circuits (GC). Until recently, it was widely believed that a GC proportional to the …