A General Model of Structured Multisignatures with Message Flexibility(Signatures,<Special Section>Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
Multisignature schemes enable us to integrate multiple signatures into a single short signature. In 2001, Mitomi and Miyaji proposed a general model of multisignatures, in which signed messages are flexible and the signing order is verifiable and flexible. Several schemes that satisfy these properties have been proposed, but to the best of our knowledge, their verifiable orders are limited to only sequential structures unlike some order-verifiable (but not message-flexible) multisignatures. We define a signing structure as a labeled tree, which can represent any natural signing order including series-parallel graphs, and formalize a general model of multisignatures that makes good use of our structure. We present a security model for such signatures, give the construction based on the general aggregate signature developed by Boneh et al., and provide a security proof in the random oracle model.
- 2007-01-01
著者
-
OGATA Wakaha
Tokyo Institute of Technology
-
Ogata Wakaha
Tokyo Inst. Of Technol. Tokyo Jpn
-
YAMAMOTO Dan
Tokyo Institute of Technology
関連論文
- Collision-Based Power Attack for RSA with Small Public Exponent
- New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
- New Identity-Based Blind Signature and Blind Decryption Scheme in the Standard Model
- Electronic Ticket Scheme for ITS(Special Section on Cryptography and Information Security)
- Provably Secure On-Line Secret Sharing Scheme
- Comments on the Security Proofs of Some Signature Schemes Based on Factorization(Information Security)
- New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
- New Identity-Based Blind Signature and Blind Decryption Scheme in the Standard Model
- Collision-Based Power Attack for RSA with Small Public Exponent
- Forgery Attacks on Time-Stamp, Signed PDF and X.509 Certificate
- General Conversion for Obtaining Strongly Existentially Unforgeable Signatures
- On Some Variations of Kurosawa-Desmedt Public-Key Encryption Scheme(Cryptography and Information Security)
- Efficient Divisible Voting Scheme(Application)(Cryptography and Information Security)
- Efficient Almost Secure 1-Round Message Transmission Schemes for 3t+1 Channels
- k out of n Oblivious Transfer without Random Oracles (Protocol) (Cryptography and Information Security)
- Relationship between Standard Model Plaintext Awareness and Message Hiding
- A General Model of Structured Multisignatures with Message Flexibility(Signatures,Cryptography and Information Security)
- Provably Secure On-Line Secret Sharing Scheme
- Matching Oblivious Transfer : How to Exchange Valuable Data(Special Section on Cryptography and Information Security)
- k out of n Oblivious Transfer without Random Oracles
- A Simple and Efficient Secret Sharing Scheme Secure against Cheating
- Undeniable and Unpretendable Signatures