Change search
ReferencesLink to record
Permanent link

Direct link
Universally composable DKG with linear number of exponentiations
KTH, School of Computer Science and Communication (CSC), Numerical Analysis and Computer Science, NADA.ORCID iD: 0000-0003-4157-1371
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)
Abstract [en]

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
Keyword [en]
Distributed Key Generation, Secure, Systems
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-62967DOI: 10.1007/978-3-540-30598-9_19ISI: 000228664000019ScopusID: 2-s2.0-23944484568ISBN: 3-540-24301-1OAI: diva2:481444
4th International Conference on Security in Communication Networks. Amalfi, Italy. SEP 08-10, 2004

QC 20120124

Available from: 2012-01-20 Created: 2012-01-20 Last updated: 2014-12-03Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Wikström, Douglas
By organisation
Numerical Analysis and Computer Science, NADA
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 10 hits
ReferencesLink to record
Permanent link

Direct link