ID-Based Deniable Ring Signature with Constant-Size Signature

Abstract:

Article Preview

The ring signature can guarantee the signer’s anonymity. Most proposed ring signature schemes have two problems: One is that the size of ring signature depends linearly on the ring size, and the other is that the signer can shift the blame to victims because of the anonymity. Some authors have studied the constant-size ring signature and deniable ring signature to solve these two problems. This paper shows that an identity-based ring signature scheme with constant size has some security problems by using an insecure accumulator and its verification process does not include the message m. Then we combine the concepts of “constant-size” and “deniable” to form an id-based deniable ring signature with constant-size signature. The new scheme with constant-size signature length is proposed based on an improved accumulator from bilinear pairings and it solves the problem of anonymity abuse.

Info:

Periodical:

Advanced Materials Research (Volumes 255-260)

Edited by:

Jingying Zhao

Pages:

2192-2196

DOI:

10.4028/www.scientific.net/AMR.255-260.2192

Citation:

C. Y. Hu and P. T. Liu, "ID-Based Deniable Ring Signature with Constant-Size Signature", Advanced Materials Research, Vols. 255-260, pp. 2192-2196, 2011

Online since:

May 2011

Export:

Price:

$38.00

[1] R. Rivest, A. Shamir, and Y. Tauman: How to leak a secret, Proceedings of AsiaCrypto'01. Springer-Verlag, LNCS Vol. 2248(2001), pp.552-565.

DOI: 10.1007/3-540-45682-1_32

[2] E. Bresson, J. Stern, and M. Szydlo: Threshold ring signatures for Ad-hoc Groups, Proceedings of Crypto'02. Springer-Verlag, LNCS Vol. 2442(2002), pp.465-480.

DOI: 10.1007/3-540-45708-9_30

[3] F. Zhang and K. Kim: ID-based blind signature and ring signature from pairings, Proceedings of Asiacrypt'02. Springer-Verlag, LNCS Vol. 2501(2002), pp.533-547.

DOI: 10.1007/3-540-36178-2_33

[4] C. Tang, Z. Liu, M. Wang: An Improved Identity-Based Ring Signature Scheme from Bilinear Pairings, MM Research Preprints, No. 22(2003), pp.231-234.

[5] A. Shamir: Identity based cryptosystems and signature schemes, Proceedings of Crypto'84. Springer-Verlag, LNCS Vol. 196(1984), pp.47-53.

[6] D. Boneh and M. Franklin: Identity based encryption from the Weil pairing, SIAM Journal on Computing, Vol. 32, No. 3(2003), pp.586-615.

DOI: 10.1137/s0097539701398521

[7] M H. Au, J K. Liu, W. Susilo, et al: Constant-Size ID-Based Linkable and Revocable-iff-Linked Ring Signature, Proceedings of INDOCRYPT'06. Springer-Verlag, LNCS Vol. 4329(2006), pp.364-378.

DOI: 10.1007/11941378_26

[8] H. Wang and X. Guo: Cryptanalysis and Improvement of a Constant-Size Identity Based Ring Signature Scheme, Proceedings of International Conference on Computational Intelligence and Security Workshops(2007), pp.803-806.

DOI: 10.1109/cisw.2007.4425617

[9] L. Wang, G. Zhang and C. Ma: An Identity-Based Ring Signature Scheme with Constant-Size Signature, Journal of Electronics and Information Technology, Vol. 29, No. 11(2007), pp.2645-2648.

[10] Y. Komano, K. Ohta, A. Shimbo and S. Kawamura: Toward the fair anonymous signatures: deniable ring signatures, Proceedings of CT-RSA'2006. Springer-Verlag, LNCS Vol. 3860(2006), pp.174-191.

DOI: 10.1007/11605805_12

[11] A J. Menezes, T. Okamoto and S.A. Vanstone: Reducing elliptic curve logarithms to a finite field, IEEE Transactions on Information Theory, Vol. 39, No. 5(1993), pp.1636-1646.

DOI: 10.1109/18.259647

[12] C. Tartary, S. Zhou, D. Lin, H. Wang and J. Pieprzyk: Analysis of bilinear pairing-based accumulator for identity escrowing, IET Information Security, Vol. 2, No. 4(2008), pp.99-107.

DOI: 10.1049/iet-ifs:20070091

[13] L. Nguyen: Accumulator from bilinear pairings and application to ID-based ring signatures and group membership revocation, Proceedings of CT-RSA'05. Springer-Verlag, LNCS Vol. 3376(2005), pp.275-292.

[14] F. Zhang and X. Chen: Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CTRSA'05, http: /eprint. iacr. org/ 2005/103.

In order to see related information, you need to Login.