A Multisignature Scheme without Predetermined Signing Order

張 鐸, 彭 順富, Erl-Huei Lu, 徐 學群

Research output: Contribution to journalJournal Article peer-review


     Harn與Kiesler[8]於1989年提出一多重簽章演算法,解決了RSA加密系統在多重簽 章環境中之模數值衝突與重組區段之問題 [5][6], 他們的演算法容許多個簽章者對同一份 電子文件做多重簽章並秘密地送給指定接收者,不論簽章人數多寡,其簽章後之密文長度可 維持不變。但其最大弱點是簽章者必須依事先排定好之順序簽章,且其順序在簽章過程中不 可任意變動。本文所提出之演算法可容許簽章順序不必事先排定,且在簽章過程中其簽章順 序可隨時變動。同樣地,其密文長度不因簽章人數多寡而有所變動。因此,本文所提出之演 算法可適用於區域或廣域網路之電子公文系統中。
     In 1989, Harn and Kiesler[8] presented a multisignature scheme that allow multiple signatories for signinig a document. It significantly remedied the problems of reblocking and moduli size clashes when multisignature is applied[5][6]. Their scheme, based on the RSA scheme, allows any number of users to sign a document and send it secretly to the receiver. The length of ciphertext remains constant, no matter how great the number of signatories. But, the drawbacks are that the users have to sign the document in a pre-determined order, and the order can not be altered during the process after. In this paper, we modified Harn-Kiesler scheme which allow un-ordered multisignature and the order can be changed during the process. The ciphertext, as in Harn-Kiesler scheme, remains constant, no matter how great the number of signatories is. Thus our new scheme is suitable for electronic document systems in LAN, even in WAN.
Original languageAmerican English
Pages (from-to)169-175
Issue number2
StatePublished - 1996


Dive into the research topics of 'A Multisignature Scheme without Predetermined Signing Order'. Together they form a unique fingerprint.

Cite this