File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Practical threshold signatures without random oracles
Title | Practical threshold signatures without random oracles |
---|---|
Authors | |
Keywords | CDH problem Bilinear groups Threshold signature |
Issue Date | 2007 |
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? |
Abstract | We 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 Identifier | http://hdl.handle.net/10722/260270 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Li, Jin | - |
dc.contributor.author | Yuen, Tsz Hon | - |
dc.contributor.author | Kim, Kwangjo | - |
dc.date.accessioned | 2018-09-12T02:00:58Z | - |
dc.date.available | 2018-09-12T02:00:58Z | - |
dc.date.issued | 2007 | - |
dc.identifier.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 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10722/260270 | - |
dc.description.abstract | We 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.language | eng | - |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.subject | CDH problem | - |
dc.subject | Bilinear groups | - |
dc.subject | Threshold signature | - |
dc.title | Practical threshold signatures without random oracles | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.scopus | eid_2-s2.0-38149090152 | - |
dc.identifier.volume | 4784 LNCS | - |
dc.identifier.spage | 198 | - |
dc.identifier.epage | 207 | - |
dc.identifier.eissn | 1611-3349 | - |
dc.identifier.issnl | 0302-9743 | - |