Revocable Anonymity of Undeniable Signature Scheme

  • Winson K. Y. Yeung
  • Song Han
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2690)


We present a new revocable anonymous protocol for the undeniable signatures. Our scheme allows some designated entity for example the government to revoke the anonymity of some signer who has done illegal actions in the group. Our scheme improves the signing algorithm of the traditional undeniable signatures such that the signing algorithm is more efficiency referring to the time and space cost.


Signature Scheme Emergence Case Jacobi Symbol Choose Message Attack Undeniable Signature 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bellare, M., Rogaway, P.: The Exact Security of Digital Signature–How to sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 399–416. Springer, Heidelberg (1996)Google Scholar
  2. 2.
    Camenisch, J., Micheal, M.: Confirmer Signature Schemes Secure Against Adaptive Adversaries. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 243–258. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  3. 3.
    Chaum, D., van Antwerpen, H.: Undeniable Signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 212–216. Springer, Heidelberg (1990)Google Scholar
  4. 4.
    Chaum, D.: Zero-Knowledge Undeniable Signatures. In: Damgård, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 458–464. Springer, Heidelberg (1991)Google Scholar
  5. 5.
    Cramer, R., Shoup, V.: A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13–25. Springer, Heidelberg (1998)Google Scholar
  6. 6.
    Galbraith, S.D., Mao, W.: Anonymity and Denial of Undeniable and Confirmer Signatures. HP Labs technical report HPL, 303 (2001)Google Scholar
  7. 7.
    Galbraith, S.D., Mao, W., Paterson, K.G.: RSA-Based Undeniable Signatures for General Moduli. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 200–217. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  8. 8.
    Gennaro, R., Krawczyk, H., Rabin, T.: RSA-Based Undeniable Signatures. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 132–149. Springer, Heidelberg (1997); Also in Journal of Cryptology 13, 397–416 (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Winson K. Y. Yeung
    • 1
  • Song Han
    • 2
  1. 1.Department of Computer ScienceCity University of Hong KongKowloon, Hong Kong
  2. 2.Department of MathematicsPeking UniversityBeijingP. R. China

Personalised recommendations