Over the past few years, homomorphic secret sharing (HSS) emerged as a compelling
alternative to fully homomorphic encryption (FHE), due to its feasibility from an array of …

Recently, number-theoretic assumptions including DDH, DCR and QR have been used to
build powerful tools for secure computation, in the form of homomorphic secret-sharing …

Schnorr signatures are a popular choice due to their simplicity, provable security, and linear
structure that enables relatively easy threshold signing protocols. The deterministic variant of …

This work introduces homomorphic secret sharing (HSS) with succinct share size. In HSS,
private inputs are shared between parties, who can then homomorphically evaluate a …

We consider the efficiency of protocols for secure multiparty computation (MPC) with a
dishonest majority. A popular approach for the design of such protocols is to employ …

A unit-vector (UV) correlation is an additive secret-sharing of a vector of length B that
contains 1 in a secret random position and 0's elsewhere. UV correlations are a useful …

Abstract Distributed Point Functions (DPFs) are a useful cryptographic primitive enabling a
dealer to distribute short keys to two parties, such that the keys encode additive secret …

Homomorphic secret sharing (HSS) is a distributed analogue of fully-homomorphic
encryption (FHE), where subsequent to an input-sharing phase, parties can locally compute …

An-homomorphic secret sharing (HSS) scheme for a function family allows clients to share
their data among servers and then distribute the computation of any function to the servers …

Secure computation enables mutually distrusting parties to jointly compute a function on
their secret inputs, while revealing nothing beyond the function output. A long-running …