File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Practical threshold signatures without random oracles

TitlePractical threshold signatures without random oracles
Authors
KeywordsCDH problem
Bilinear groups
Threshold signature
Issue Date2007
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2007, v. 4784 LNCS, p. 198-207 How to Cite?
AbstractWe propose a secure threshold signature scheme without trusted dealer. Our construction is based on the recently proposed signature scheme of Waters in EUROCRYPT'05. The new threshold signature scheme is more efficient than the previous threshold signature schemes without random oracles. Meanwhile, the signature share generation and verification algorithms are non-interactive. Furthermore, it is the first threshold signature scheme based on the computational Diffie-Hellman (CDH) problem without random oracles. © Springer-Verlag Berlin Heidelberg 2007.
Persistent Identifierhttp://hdl.handle.net/10722/260270
ISSN
2005 Impact Factor: 0.302
2015 SCImago Journal Rankings: 0.252

 

DC FieldValueLanguage
dc.contributor.authorLi, Jin-
dc.contributor.authorYuen, Tsz Hon-
dc.contributor.authorKim, Kwangjo-
dc.date.accessioned2018-09-12T02:00:58Z-
dc.date.available2018-09-12T02:00:58Z-
dc.date.issued2007-
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2007, v. 4784 LNCS, p. 198-207-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10722/260270-
dc.description.abstractWe propose a secure threshold signature scheme without trusted dealer. Our construction is based on the recently proposed signature scheme of Waters in EUROCRYPT'05. The new threshold signature scheme is more efficient than the previous threshold signature schemes without random oracles. Meanwhile, the signature share generation and verification algorithms are non-interactive. Furthermore, it is the first threshold signature scheme based on the computational Diffie-Hellman (CDH) problem without random oracles. © Springer-Verlag Berlin Heidelberg 2007.-
dc.languageeng-
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)-
dc.subjectCDH problem-
dc.subjectBilinear groups-
dc.subjectThreshold signature-
dc.titlePractical threshold signatures without random oracles-
dc.typeConference_Paper-
dc.description.natureLink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-38149090152-
dc.identifier.volume4784 LNCS-
dc.identifier.spage198-
dc.identifier.epage207-
dc.identifier.eissn1611-3349-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats