Universally composable DKG with linear number of exponentiations
2005 (English)In: Security in Communication Networks: 4th International Conference, SCN 2004, Amalfi, Italy, September 8-10, 2004, Revised Selected Papers, Springer Berlin/Heidelberg, 2005, 263-277 p.Conference paper (Refereed)
Until now no distributed discrete-logarithm key generation (DKG) protocol is known to be universally composable. We extend Feld- man's verifiable secret sharing scheme to construct such a protocol. Our result holds for static adversaries corrupting a minority of the parties under the Decision Diffie-Hellman assumption in a weak common random string model in which the simulator does not choose the common random string. Our protocol is optimistic. If all parties behave honestly, each party computes O(3.5k) exponentiations, and otherwise each party computes O(k2) exponentiations, where k is the number of parties. In previous constructions each party always computes Ω(k2) exponentiations.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2005. 263-277 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 3352
Distributed Key Generation, Secure, Systems
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-62967DOI: 10.1007/978-3-540-30598-9_19ISI: 000228664000019ScopusID: 2-s2.0-23944484568ISBN: 3-540-24301-1OAI: oai:DiVA.org:kth-62967DiVA: diva2:481444
4th International Conference on Security in Communication Networks. Amalfi, Italy. SEP 08-10, 2004
QC 201201242012-01-202012-01-202014-12-03Bibliographically approved