ID-based threshold digital signature schemes on the elliptic curve discrete logarithm problem (Q556108): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
Property / DOI
 
Property / DOI: 10.1016/j.amc.2004.06.033 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2004.06.033 / rank
 
Normal rank

Revision as of 04:15, 9 December 2024

scientific article
Language Label Description Also known as
English
ID-based threshold digital signature schemes on the elliptic curve discrete logarithm problem
scientific article

    Statements

    ID-based threshold digital signature schemes on the elliptic curve discrete logarithm problem (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2005
    0 references
    The authors introduce three so-called {identification group-oriented theshold} digital signature schemes based on the elliptic curve discrete log problem. Their goal is to optimize these techniques for implementation within a network. They cite five distinct advantages to their approach, most notably involving efficiency of security for user identification and verification, as well as smaller bandwidth and certificate sizes than those for known public-key schemes. They conclude the paper with performance analyses.
    0 references
    ID-based
    0 references
    threshold digital signature
    0 references
    ellipic curve cryptography
    0 references

    Identifiers