Multiplicative and Verifiably Multiplicative Secret Sharing for Multipartite Adversary Structures

ePrint Report: Multiplicative and Verifiably Multiplicative Secret Sharing for Multipartite Adversary Structures

Reo Eriguchi, Noboru Kunihiro, Koji Nuida

$d$-Multiplicative secret sharing enables $n$ players to locally compute additive shares of the product of $d$ secrets from their shares. Barkol et al. (Journal of Cryptology, 2010) show that it is possible to construct a $d$-multiplicative scheme for any adversary structure satisfying the $Q_d$ property, in which no $d$ sets cover the whole set of players. In this paper, we focus on …

adversary eprint report secret sharing