A STRUCTURED AGGREGATE SIGNATURE SCHEME WITH PAIRING-BASED CRYPTOGRAPHY

In this study, we propose a new aggregate signature scheme with pairing-based cryptography that can describe the mixed/parallel structure of signers. Existing structured signature schemes are based on multisignature schemes, which are adapted for verification of a mixed/parallel structure if all signers sign the same document. However, if each signer wants to sign a document different from those of other signers, another scheme that is based on an aggregate signature scheme is required. To resolve the above problem, a denoted connective signature is generated in our scheme. In addition, our scheme is shown to be secure under the GapDiffie-Hellman assumption. Furthermore, we explain that our scheme is simple to construct, and its performance is efficient.

[1]  Masaki Inamura,et al.  A new tree-structure-specified multisignature scheme for a document circulation system , 2011, Proceedings of the International Conference on Security and Cryptography.

[2]  Hovav Shacham,et al.  Short Signatures from the Weil Pairing , 2001, J. Cryptol..

[3]  Alexandra Boldyreva,et al.  Efficient threshold signature , multisignature and blind signature schemes based on the Gap-Diffie-Hellman-group signature scheme , 2002 .

[4]  Alexandra Boldyreva,et al.  Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-Group signature scheme , 2002 .

[5]  Yuichi Komano,et al.  Provably Secure Multisignatures in Formal Security Model and Their Optimality , 2008, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[6]  Antoine Joux,et al.  Separating Decision Diffie–Hellman from Computational Diffie–Hellman in Cryptographic Groups , 2003, Journal of Cryptology.

[7]  Yuichi Komano,et al.  On the Security of Probabilistic Multisignature Schemes and Their Optimality , 2005, Mycrypt.

[8]  Atsuko Miyaji,et al.  A Multisignature Scheme with Message Flexibility, Order Flexibility and Order Verifiability , 2000, ACISP.

[9]  Hovav Shacham,et al.  Aggregate and Verifiably Encrypted Signatures from Bilinear Maps , 2003, EUROCRYPT.

[10]  Tzong-Chen Wu,et al.  A Structured Multisignature Scheme from the Gap Diffie-Hellman Group , 2003, IACR Cryptol. ePrint Arch..

[11]  David Pointcheval,et al.  The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes , 2001, Public Key Cryptography.

[12]  K. Itakura,et al.  A public-key cryptosystem suitable for digital multisignatures , 1983 .

[13]  Paul Erdös.  Some Applications of Ramsey's Theorem to Additive Number Theory , 1980, Eur. J. Comb..

[14]  Yvo Desmedt,et al.  A Structured ElGamal-Type Multisignature Scheme , 2000, Public Key Cryptography.

[15]  Antoine Joux,et al.  Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups , 2001, IACR Cryptology ePrint Archive.