A d-multiplicative secret sharing (d-MSS) scheme allows the players to multiply d shared
secrets without recovering the secrets by converting their shares locally into an additive sharing …

A d-multiplicative secret sharing (d-MSS) scheme over a finite field allows the players to multiply
d shared secrets without recovering the secrets by converting their shares locally into an …

… In this paper, we focus on multipartite adversary structures and propose efficient
multiplicative and verifiably multiplicative secret sharing schemes tailored to them. First, our …

In this paper, we explore the multi-server (ie, multiple servers are employed to perform
computations) and multi-client (ie, multiple clients outsource joint computations on their joint inputs…

… In this paper, we point out flaws in an existing verifiably multiplicative secret sharing (VMSS)
scheme. Namely, we show that a scheme proposed by Yoshida and Obana presented at …

There are two main security concerns in outsourcing computations. One is how to protect
the privacy of the outsourced data, and the other is how to ensure the correctness of the …

An $(n,m,t)$ -homomorphic secret sharing (HSS) scheme for a function family $\mathcal F$
allows $n$ clients to share their data $x_{1}, \ldots,x_{n}$ among $m$ servers and then …

Distributed secret sharing techniques, where a specific secret is encoded into its shares which
are conveyed to the IoT device or its user via storage nodes, are considered. A verifiably …

Dynamic proactive secret sharing (DPSS) allows a client to share a secret $s$ among a
committee of $n$ participants and allows the committee to reshare the secret among a new …

… Yoshida and Obana [30] constructed verifiably multiplicative secret sharing schemes that
enable the computation of polynomials over the shared data. However, the degrees of their …