论文信息 - A Short Signature Scheme in the Standard Model

A Short Signature Scheme in the Standard Model

In this paper, by elaborately choosing the parameters of Waters Hash function, we propose a new efficient signature scheme. It is shown that the scheme is secure against strongly unforgeable chosen-message attacks in the standard model under Computational Diffie-Hellman (CDH) assumption. Further, among all the known secure signatures in the standard model, our scheme is the shortest one and has the efficient security reduction as well.

[1] Dan Boneh,et al. Short Signatures Without Random Oracles , 2004, EUROCRYPT.

[2] A. Miyaji,et al. New Explicit Conditions of Elliptic Curve Traces for FR-Reduction , 2001 .

[3] James H. Burrows,et al. Secure Hash Standard , 1995 .

[4] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[5] Ronald Cramer,et al. Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack , 2003, SIAM J. Comput..

[6] Jung Hee Cheon,et al. Security Analysis of the Strong Diffie-Hellman Problem , 2006, EUROCRYPT.

[7] Jonathan Katz,et al. Chosen-Ciphertext Security from Identity-Based Encryption , 2004, SIAM J. Comput..

[8] Brent Waters,et al. Strongly Unforgeable Signatures Based on Computational Diffie-Hellman , 2006, Public Key Cryptography.

[9] Moni Naor,et al. Universal one-way hash functions and their cryptographic applications , 1989, STOC '89.

[10] Brent Waters,et al. Efficient Identity-Based Encryption Without Random Oracles , 2005, EUROCRYPT.

[11] Hovav Shacham,et al. Short Signatures from the Weil Pairing , 2001, J. Cryptol..

[12] Xavier Boyen. The BB 1 Identity-Based Cryptosystem : A Standard for Encryption and Key Encapsulation , 2006 .