A d-multiplicative secret sharing (d-MSS) scheme over a finite field allows the players to multiply d shared secrets without recovering the secrets.
The verifiability of multiplication allows any receiver of the product of d secrets to detect a wrong value by using the corresponding proof with the ...
Oct 14, 2022 · In this paper, we focus on multipartite adversary structures and propose efficient multiplicative and verifiably multiplicative secret sharing schemes tailored ...
A d-multiplicative secret sharing (d-MSS) scheme allows the players to multiply d shared secrets without recovering the secrets by converting their shares ...
People also ask
What is secret sharing and how does it differ from multi sig?
What is the secret sharing algorithm?
In this paper, we focus on multipartite adversary structures and propose efficient multiplicative and verifiably multiplicative secret sharing schemes tailored ...
Missing: Compact | Show results with:Compact
In this paper, to further improve usefulness, we introduce and study the verifiability of multiplication, which is mainly formalized for the motivated ...
Missing: Compact | Show results with:Compact
Feb 21, 2018 · I was having a read of this question: "Is multiplicative secret sharing secure?" posted in 2013 which asks if the simple multiplicative scheme ...
Missing: Compact | Show results with:Compact
This paper proposes efficient multiplicative and verifiably multiplicative secret sharing schemes tailored to multipartite adversary structures and devise a ...
Missing: Compact | Show results with:Compact
Nov 29, 2017 · d-Multiplicative secret sharing enables n players to locally compute additive shares of the product of d secrets from their shares. Barkol ...
Missing: Compact | Show results with:Compact
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret ...
Missing: Compact | Show results with:Compact