zbMATH — the first resource for mathematics

Adaptively secure Feldman VSS and applications to universally-composable threshold cryptography. (English) Zbl 1104.94042
Franklin, Matt (ed.), Advances in cryptology – CRYPTO 2004. 24th annual international cryptology conference, Santa Barbara, California, USA, August 15–19, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22668-0/pbk). Lecture Notes in Computer Science 3152, 317-334 (2004).
Summary: We propose the first distributed discrete-log key generation (DLKG) protocol from scratch which is adaptively-secure in the non-erasure model, and at the same time completely avoids the use of interactive zero-knowledge proofs. As a consequence, the protocol can be proven secure in a universally-composable (UC) like framework which prohibits rewinding. We prove the security in what we call the single-inconsistent-player UC model, which guarantees arbitrary composition as long as all protocols are executed by the same players. As an application, we propose a fully UC threshold Schnorr signature scheme.
Our results are based on a new adaptively-secure Feldman VSS scheme. Although adaptive security was already addressed by Feldman in the original paper, the scheme requires secure communication, secure erasure, and either a linear number of rounds or digital signatures to resolve disputes. Our scheme overcomes all of these shortcomings, but on the other hand requires some restriction on the corruption behavior of the adversary, which however disappears in some applications including our new DLKG protocol.
We also propose several new adaptively-secure protocols, which may find other applications, like a sender non-committing encryption scheme, a distributed trapdoor-key generation protocol for Pedersen’s commitment scheme, or distributed-verifier proofs for proving relations among commitments or even any NP relations in general.
For the entire collection see [Zbl 1058.94002].

94A62 Authentication, digital signatures and secret sharing
94A60 Cryptography
Full Text: DOI