Strongly Unforgeable ID-Based Signatures without Random Oracles

Authors:
Chifumi Sato;Takeshi Okamoto;Eiji Okamoto
Affiliations:
SBI Net Systems Co., Ltd., Tokyo, Japan 141---0021;Department of Computer Science, Faculty of Health Sciences, Tsukuba University of Technology, Ibaraki, Japan 305---0821;Graduate School of Systems and Information Engineering, University of Tsukuba, Ibaraki, Japan 305---8573
Venue:
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
Year:
2009

Citing 15
Cited 1

Identity-based cryptosystems and signature schemes

Proceedings of CRYPTO 84 on Advances in cryptology
Signature schemes based on the strong RSA assumption

CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Efficient Identity Based Signature Schemes Based on Pairings

SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference 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
Strong Key-Insulated Signature Schemes

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Candidate One-Way Functions on Non-Supersingular Elliptic Curves*A preliminary version was presented at ISEC2003 [22].

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Generic Transformation to Strongly Unforgeable Signatures

ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Secure hash-and-sign signatures without the random oracle

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
On the generic construction of identity-based signatures with additional properties

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
A new signature scheme without random oracles from bilinear pairings

VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Efficient identity-based encryption without random oracles

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Strongly unforgeable signatures based on computational diffie-hellman

PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Efficient identity-based signatures secure in the standard model

ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Efficient blind and partially blind signatures without random oracles

TCC'06 Proceedings of the Third conference on Theory of Cryptography

Efficient and strongly unforgeable identity-based signature scheme from lattices in the standard model

Security and Communication Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we construct a strongly unforgeable ID-based signature scheme without random oracles. The signature size of our scheme is smaller than that of other schemes based on varieties of the Diffie---Hellman problem or the discrete logarithm problem. The security of the scheme relies on the difficulty to solve three problems related to the Diffie---Hellman problem and a one-way isomorphism.