On a Practical Distributed Key Generation Scheme Based on Bivariate Polynomials

An essential component of threshold cryptography is to generate a distributed key based on univariate symmetric polynomials, where a constant fraction of the players can reconstruct the key. We, however, with rigorous proof of security, present a new distributed key generation (DKG) protocol, using bivariate symmetric polynomials. It is regarded as more efficient in computation, simpler and more flexible in applications, compared with other solutions.