We explore Zero-Knowledge Proofs (ZKPs) of statements expressed as programs written in
high-level languages, eg, C or assembly. At the core of executing such programs in ZK is the …

In this work we formalize the notion of a two-party permutation correlation $(A, B),(C,\pi) $ st
$\pi (A)= B+ C $ for a random permutation $\pi $ of $ n $ elements and vectors $ A, B …

Given a graph G (V, E), represented as a secret-sharing of an adjacency list, we show how
to obliviously convert it into an alternative, MPC-friendly secret-shared representation, so …

Abstract SCALES (Small Clients And Larger Ephemeral Servers) model is a recently
proposed model for MPC (Acharya et al., TCC 2022). While the SCALES model offers …

Secure multi-party computation (MPC) is a crucial tool for privacy-preserving computation,
but it is getting increasingly complicated due to recent advancements and optimizations …

Data-dependent accesses to memory are necessary for many real-world applications, but
their cost remains prohibitive in secure computation. Prior work either focused on minimizing …

Secure merge considers the problem of combining two sorted lists into a single sorted secret-
shared list. Merge is a fundamental building block for many real-world applications. For …