• DocumentCode
    2453613
  • Title

    An Efficient Digital Multisignature Scheme

  • Author

    Aboud, Sattar J.

  • Author_Institution
    Amman Arab Univ. for Graduate Studies
  • Volume
    2
  • fYear
    0
  • fDate
    0-0 0
  • Firstpage
    3298
  • Lastpage
    3303
  • Abstract
    An efficient digital multisignature scheme is suggested which enhance the Kiesler-Harn´s scheme. The suggested scheme has no bit expansion, in which every signer has the RSA modulus with the same bit length and the same most significant b bits pattern. In addition, the new algorithm has no limitations in signing order and in fact is more efficient than the Kiesler-Harn´s multisignature algorithm
  • Keywords
    digital signatures; Kiesler-Harn multisignature algorithm; RSA modulus; digital multisignature scheme; threshold scheme; Cryptography; Digital signatures; Polynomials; Public key; Security; Kiesler-Harn´s scheme; RSA scheme; bit length expansion; digital multisignature scheme; threshold scheme;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information and Communication Technologies, 2006. ICTTA '06. 2nd
  • Conference_Location
    Damascus
  • Print_ISBN
    0-7803-9521-2
  • Type

    conf

  • DOI
    10.1109/ICTTA.2006.1684945
  • Filename
    1684945
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2453613