Sequential aggregate signatures with short public keys without random oracles
From MaRDI portal
Publication:2344760
Abstract: The notion of aggregate signature has been motivated by applications and it enables any user to compress different signatures signed by different signers on different messages into a short signature. Sequential aggregate signature, in turn, is a special kind of aggregate signature that only allows a signer to add his signature into an aggregate signature in sequential order. This latter scheme has applications in diversified settings such as in reducing bandwidth of certificate chains and in secure routing protocols. Lu, Ostrovsky, Sahai, Shacham, and Waters (EUROCRYPT 2006) presented the first sequential aggregate signature scheme in the standard model. The size of their public key, however, is quite large (i.e., the number of group elements is proportional to the security parameter), and therefore, they suggested as an open problem the construction of such a scheme with short keys. In this paper, we propose the first sequential aggregate signature schemes with short public keys (i.e., a constant number of group elements) in prime order (asymmetric) bilinear groups that are secure under static assumptions in the standard model. Furthermore, our schemes employ a constant number of pairing operations per message signing and message verification operation. Technically, we start with a public-key signature scheme based on the recent dual system encryption technique of Lewko and Waters (TCC 2010). This technique cannot directly provide an aggregate signature scheme since, as we observed, additional elements should be published in a public key to support aggregation. Thus, our constructions are careful augmentation techniques for the dual system technique to allow it to support sequential aggregate signature schemes. We also propose a multi-signature scheme with short public parameters in the standard model.
Recommendations
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Sequential aggregate signatures with short public keys: design, analysis and implementation studies
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- A certificateless sequential aggregate signature scheme
- Advances in Cryptology - EUROCRYPT 2004
- A practical lattice-based sequential aggregate signature
- Sequential aggregate signatures with lazy verification from trapdoor permutations
- Advances in Cryptology - EUROCRYPT 2004
- From rerandomizability to sequential aggregation: efficient signature schemes based on SXDH assumption
- History-free sequential aggregate signatures
Cites work
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Advances in Cryptology - EUROCRYPT 2004
- Aggregate Message Authentication Codes
- Candidate Multilinear Maps from Ideal Lattices
- Dual form signatures: an approach for proving security from static assumptions
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient Sequential Aggregate Signed Data
- Full domain hash from (leveled) multilinear maps and identity-based aggregate signatures
- How to aggregate the CL signature scheme
- scientific article; zbMATH DE number 2009971 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- Identity-based aggregate and multi-signature schemes based on RSA
- Identity-Based Multi-signatures from RSA
- New directions in cryptography
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Practical signatures from standard assumptions
- Public Key Cryptography - PKC 2006
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Sequential aggregate signatures made shorter
- Sequential aggregate signatures with lazy verification from trapdoor permutations. (Extended abstract)
- Sequential aggregate signatures with short public keys: design, analysis and implementation studies
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Tools for simulating features of composite order bilinear groups in the prime order setting
- Unrestricted Aggregate Signatures
Cited in
(13)- MQSAS -- a multivariate sequential aggregate signature scheme
- From rerandomizability to sequential aggregation: efficient signature schemes based on SXDH assumption
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- Efficient revocable identity-based encryption with short public parameters
- Sequential aggregate signatures made shorter
- History-free sequential aggregate signatures
- How to aggregate the CL signature scheme
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Dual form signatures: an approach for proving security from static assumptions
- Sequential aggregate signatures with short public keys: design, analysis and implementation studies
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Sequential Aggregate Signed Data
- Synchronized aggregate signature under standard assumption in the random oracle model
This page was built for publication: Sequential aggregate signatures with short public keys without random oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344760)
