Distributing keys and random secrets with constant complexity
B Applebaum, B Pinkas - Theory of Cryptography Conference, 2025 - Springer
Theory of Cryptography Conference, 2025•Springer
Abstract In the Distributed Secret Sharing Generation (DSG) problem n parties wish to
obliviously sample a secret-sharing of a random value s taken from some finite field, without
letting any of the parties learn s. Distributed Key Generation (DKG) is a closely related
variant of the problem in which, in addition to their private shares, the parties also generate a
public “commitment”\(g^ s\) to the secret. Both DSG and DKG are central primitives in the
domain of secure multiparty computation and threshold cryptography.
obliviously sample a secret-sharing of a random value s taken from some finite field, without
letting any of the parties learn s. Distributed Key Generation (DKG) is a closely related
variant of the problem in which, in addition to their private shares, the parties also generate a
public “commitment”\(g^ s\) to the secret. Both DSG and DKG are central primitives in the
domain of secure multiparty computation and threshold cryptography.
Abstract
In the Distributed Secret Sharing Generation (DSG) problem n parties wish to obliviously sample a secret-sharing of a random value s taken from some finite field, without letting any of the parties learn s. Distributed Key Generation (DKG) is a closely related variant of the problem in which, in addition to their private shares, the parties also generate a public “commitment” to the secret. Both DSG and DKG are central primitives in the domain of secure multiparty computation and threshold cryptography.
Springer
Showing the best result for this search. See all results
