A Secure Multisignature Scheme with Signing Order Verifiability(Special Section on Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
In an order-specified multisignature scheme, one can verify not only a set of signers who have signed the message but also its signing order. Though we have seen several schemes with such properties proposed, none of them is given the security proof against active adversaries. The scheme can be easily modified to be an order-specified multisignature scheme, but still has the restriction that the possible signing orders are only ones of the type of serial signing. In this paper, we propose the first order-specified multisignature scheme, which is shown to be secure against adaptive chosen-message insider attacks in the random oracle model, and which allows the signing orders to form like any series-parallel graphs. The security is shown by using ID-reduction technique, which reduces the security of multisignature schemes to those of multi-round identification schemes. Furthermore, we discuss the efficiency of the proposed scheme and the upper bound of the possible number of participating signers.
- 社団法人電子情報通信学会の論文
- 2003-01-01
著者
関連論文
- Provably Secure Multi-signature Scheme with Signers' Intentions
- Probabilistic Multi-Signature Schemes Using a One-Way Trapdoor Permutation(Discrete Mathematics and Its Applications)
- On the Security and the Efficiency of Multi-Signature Schemes Based on a Trapdoor One-Way Permutation(Discrete Mathematics and Its Applications)
- A Secure Multisignature Scheme with Signing Order Verifiability(Special Section on Cryptography and Information Security)
- A Digital Signature Scheme Based on NP-Complete Lattice Problems
- New NP-Complete Problems Associated with Lattices(Discrete Mathematics and Its Applications)