Compact sequential aggregate signatures

Authors:
Yi Mu;Willy Susilo;Huafei Zhu
Affiliations:
University of Wollongong, Wollongong, Australia;University of Wollongong, Wollongong, Australia;Institute for Infocomm Research, Singapore
Venue:
Proceedings of the 2007 ACM symposium on Applied computing
Year:
2007

Citing 9
Cited 4

A digital signature scheme secure against adaptive chosen-message attacks

SIAM Journal on Computing - Special issue on cryptography
Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Universally Composable Security: A New Paradigm for Cryptographic Protocols

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Universally Composable Signature, Certification, and Authentication

CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Aggregate and verifiably encrypted signatures from bilinear maps

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Efficient identity-based encryption without random oracles

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Sequential aggregate signatures working over independent homomorphic trapdoor one-way permutation domains

ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
Sequential aggregate signatures and multisignatures without random oracles

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques

Identity Based Aggregate Signcryption Schemes

INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Aggregate message authentication codes

CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
BAF and FI-BAF: Efficient and Publicly Verifiable Cryptographic Schemes for Secure Logging in Resource-Constrained Systems

ACM Transactions on Information and System Security (TISSEC)
Self-sustaining, efficient and forward-secure cryptographic constructions for Unattended Wireless Sensor Networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a new notion which we call compact sequential aggregate signatures is introduced and formalized. Informally, a compact sequential aggregate signature states the following thing: for a given message vector m=(m1, · · · mι), a public key vector PK=(PK1, · · · , PKι) and a path p=(v1, · · · , vι), where vi=(idi, PKi), the size of the third component σ in a sequential aggregate signature (m, p, σ) is independent of the path length ι We propose a novel implementation of RSA-based regular signature scheme that works in an extended domain, and then transform it into a compact sequential aggregate signature scheme that works in a common domain such that the size of overflow bits is independent of the path length ι Finally, we show that our implementation is provably secure in the random oracle model assuming that the RSA problem is hard.