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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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–473
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–250
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 10
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–205
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–216
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–524
Huang Q, Wong DS (2013) Short and efficient convertible undeniable signature schemes without random oracles. Theor Comput Sci 476:67–83
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–391
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–154
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–459
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–171
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–171
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–53
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–477
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–97
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Yuen, T.H., Heng, SH. (2019). Security-Mediated Certificateless Undeniable Signature Scheme. In: Yang, XS., Sherratt, S., Dey, N., Joshi, A. (eds) Third International Congress on Information and Communication Technology. Advances in Intelligent Systems and Computing, vol 797. Springer, Singapore. https://doi.org/10.1007/978-981-13-1165-9_3
Download citation
DOI: https://doi.org/10.1007/978-981-13-1165-9_3
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-1164-2
Online ISBN: 978-981-13-1165-9
eBook Packages: EngineeringEngineering (R0)