Advertisement

Security-Mediated Certificateless Undeniable Signature Scheme

  • Tsz Hon Yuen
  • Swee-Huay HengEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 797)

Abstract

Certificateless cryptosystems overcome the key escrow problem in identity-based cryptography. Mediated cryptography allows immediate revocation of public keys. Undeniable signatures limit the public verifiability of ordinary digital signatures. In this paper, we formalize the security models of undeniable signatures in a security-mediated certificateless setting for the first time and put forth the first example of such schemes in the literature. We also prove the security of our scheme under some well-studied assumptions in the random oracle model.

Keywords

Certificateless Undeniable signatures Security mediated 

Notes

Acknowledgements

The authors wish to acknowledge the Malaysia government’s Fundamental Research Grant Scheme (FRGS/1/2015/ICT04/MMU/03/5) for supporting this work.

References

  1. 1.
    Al-Riyami S, Paterson K (2003) Certificateless public key cryptography. In: Laih C-S (ed) Advances in cryptology-ASIACRYPT, vol 2894. Lecture notes in computer science. Springer, Berlin, pp 452–473Google Scholar
  2. 2.
    Bellare M, Garay J, Rabin T (1998) Fast batch verification for modular exponentiation and digital signatures. In: Nyberg K (ed) Advances in cryptology-EUROCRYPT 98, vol 1403. Lecture notes in computer science. Springer, Berlin, pp 236–250CrossRefGoogle Scholar
  3. 3.
    Boneh D, Ding X, Tsudik G, Wong CM (2001) A method for fast revocation of public key certificates and security capabilities. In: Proceedings of the 10th conference on USENIX security symposium, vol 10Google Scholar
  4. 4.
    Boyar J, Chaum D, Damgård I, Pedersen T (1991) Convertible undeniable signatures. In: Menezes A, Vanstone S (eds) Advances in cryptology-CRYPTO, vol 537. Lecture notes in computer science. Springer, Berlin, pp 189–205Google Scholar
  5. 5.
    Chaum D, van Antwerpen H (1989) Undeniable signatures. In: Brassard G (ed) Advances in cryptology-CRYPTO, vol 435. Lecture notes in computer science. Springer, Berlin, pp 212–216Google Scholar
  6. 6.
    Chow S, Boyd C, Nieto JG (2006) Security-mediated certificateless cryptography. In: Yung M, Dodis Y, Kiayias A, Malkin T (eds) Lecture notes in computer science, vol 2894. Public key cryptography-PKC 2006, volume 3958 (Lecture notes in computer science). Springer, Berlin, pp 508–524Google Scholar
  7. 7.
    Huang Q, Wong DS (2013) Short and efficient convertible undeniable signature schemes without random oracles. Theor Comput Sci 476:67–83MathSciNetCrossRefGoogle Scholar
  8. 8.
    Huang X, Mu Y, Susilo W, Wu W (2007) Provably secure pairing-based convertible undeniable signature with short signature length. In: Takagi T, Okamoto T, Okamoto E, Okamoto T (eds) Pairing-based cryptography, vol 4575. Lecture notes in computer science. Springer, Berlin, pp 367–391zbMATHGoogle Scholar
  9. 9.
    Jakobsson M, Sako K, Impagliazzo R (1996) Designated verifier proofs and their applications. In: Maurer U (ed) Advances in cryptology-EUROCRYPT, vol 1070. Lecture notes in computer science. Springer, Berlin, pp 143–154Google Scholar
  10. 10.
    Ju H, Kim D, Lee D, Lim J, Chun K (2005) Efficient revocation of security capability in certificateless public key cryptography. In: Khosla R, Howlett R, Jain L (eds) Lecture notes in computer science, vol 2894. Knowledge-based intelligent information and engineering systems, volume 3682 of Lecture notes in computer science. Springer, Berlin, pp 453–459Google Scholar
  11. 11.
    Laguillaumie F, Vergnaud D (2005) Time-selective convertible undeniable signatures. In: Menezes A (ed) Lecture notes in computer science, vol 3376. Topics in cryptology-CT-RSA. Lecture notes in computer science. Springer, Berlin, pp 154–171Google Scholar
  12. 12.
    Libert B, Quisquater J-J (2003) Efficient revocation and threshold pairing based cryptosystems. In: Proceedings of the twenty-second annual symposium on principles of distributed computing, PODC ’03. ACM, New York, pp 163–171Google Scholar
  13. 13.
    Shamir A (1985) Identity-based cryptosystems and signature schemes. In: Blakley G, Chaum D (eds) Advances in cryptology-CRYPTO, vol 196. Lecture notes in computer science. Springer, Berlin, pp 47–53Google Scholar
  14. 14.
    Yap W-S, Chow S, Heng S-H, Goi B-M (2007) Security mediated certificateless signatures. In: Katz J, Yung M (eds) Lecture notes in computer science, vol 2894. Applied cryptography and network security, volume 4521 of Lecture notes in computer science. Springer, Berlin, pp 459–477Google Scholar
  15. 15.
    Yuen TH, Au MH, Liu JK, Susilo W (2007) (Convertible) undeniable signatures without random oracles. In: Qing S, Imai H, Wang G (eds) Information and communications security, 9th international conference, ICICS 2007, vol 4861. Lecture notes in computer science. Springer, Berlin, pp 83–97Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Huawei SingaporeSingaporeSingapore
  2. 2.Faculty of Information Science and TechnologyMultimedia UniversityMelakaMalaysia

Personalised recommendations