Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
An Identity-Based Signature from Gap Diffie-Hellman Groups
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Deterministic Identity-Based Signatures for Partial Aggregation
The Computer Journal
Proceedings of the 14th ACM conference on Computer and communications security
Efficient Signature Schemes with Tight Reductions to the Diffie-Hellman Problems
Journal of Cryptology
Practical forward secure sequential aggregate signatures
Proceedings of the 2008 ACM symposium on Information, computer and communications security
New Multiparty Signature Schemes for Network Routing Applications
ACM Transactions on Information and System Security (TISSEC)
Universal forgery of the identity-based sequential aggregate signature scheme
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
A Schnorr-Like Lightweight Identity-Based Signature Scheme
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
A Taxonomy of Pairing-Friendly Elliptic Curves
Journal of Cryptology
Aggregate and verifiably encrypted signatures from bilinear maps
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Efficient sequential aggregate signed data
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Identity-based deterministic signature scheme without forking-lemma
IWSEC'11 Proceedings of the 6th International conference on Advances in information and computer security
Efficient and provably-secure identity-based signatures and signcryption from bilinear maps
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Identity-Based aggregate and multi-signature schemes based on RSA
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Identity-Based aggregate signatures
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
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 and verifiably encrypted signatures from bilinear pairing
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Unrestricted aggregate signatures
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Security weaknesses of a signature scheme and authenticated key agreement protocols
Information Processing Letters
| Hi-index | 0.00 |
Since the introduction of identity based cryptography in 1984 by Adi Shamir, several identity based signature schemes were reported. However, there are only two deterministic identity based signature schemes available in the literature and both of them use probabilistic private key generation and uses bilinear pairing. Moreover, these signatures consist of either two or more group elements and hence they are not ‘short'. Thus an interesting and challenging open question is to design a deterministic signature scheme which does not use randomness either in the key generation phase or in the signing phase, avoid bilinear pairing and having a ‘short' signature-where the signature consists of only one element. While this problem is addressed by BLS scheme in the PKI based setting, this has been an open problem in the identity based setting since 1984. This paper settles the open problem affirmatively. Specifically, we propose a fully deterministic identity based signature scheme, without using bilinear pairing. The signature consists of just one group element of a composite order group and its security is related to strong RSA problem in the random oracle model. Our security reduction is tight as one need not use forking lemma during security reduction for fully deterministic signature schemes. The major and important consequence of our scheme is its use for aggregate signature scheme. Our scheme leads to the first full aggregate identity based signature scheme with no prior communication among different signers. Besides our aggregate signature scheme does not employ any computation that goes through several rounds.