A provably secure short transitive signature scheme from bilinear group pairs

Authors:
Siamak Fayyaz Shahandashti;Mahmoud Salmasizadeh;Javad Mohajeri
Affiliations:
School of Electrical Engineering, Sharif University of Technology, Tehran, Iran;Electronic Research Center, Sharif University of Technology, Tehran, Iran;Electronic Research Center, Sharif University of Technology, Tehran, Iran
Venue:
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Year:
2004

Citing 11
Cited 8

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
Identity-Based Encryption from the Weil Pairing

SIAM Journal on Computing
Transitive Signature Schemes

CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Homomorphic Signature Schemes

CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
On the Exact Security of Full Domain Hash

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Short Signatures from the Weil Pairing

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Transitive Signatures Based on Factoring and RSA

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The exact security of digital signatures-how to sign with RSA and Rabin

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
A secure signature scheme from bilinear maps

CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track

Transitive signatures from braid groups

INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Sanitizable signatures

ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Directed transitive signature scheme

CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
Short transitive signatures for directed trees

CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Computing on authenticated data

TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Computing on authenticated data for adjustable predicates

ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
A new definition of homomorphic signature for identity management in mobile cloud computing

Journal of Computer and System Sciences
Slight Homomorphic Signature for Access Controlling in Cloud Computing

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a realization of the transitive signature scheme based on the algebraic properties of bilinear group pairs. The scheme is proven secure, i.e. transitively unforgeable under adaptive chosen message attack, assuming hardness of the computational co-Diffie-Hellman problem in bilinear group pairs and the security of the underlying standard signature scheme under known message attack. Our scheme mostly conforms to previously designed schemes of Micali-Rivest and Bellare-Neven in structure; yet there are two contributions: firstly, we take advantage of bilinear group pairs which were previously used by Boneh, Lynn, and Shacham to build short signature schemes. Secondly, we show that a slight modification in previous definitions of the transitive signature relaxes the security requirement for the underlying standard signature from being secure under chosen message attack to being secure under known message attack; thus shorter and more efficient signatures can be chosen for the underlying standard signature. These two facts eventually yield to short transitive signatures with respect to both node and edge signature size.