Advances in Information and Computer Security

Volume 4266 of the series Lecture Notes in Computer Science pp 88-103

Short Traceable Signatures Based on Bilinear Pairings

  • Seung Geol ChoiAffiliated withDept. of Computer Science, Columbia University
  • , Kunsoo ParkAffiliated withDept. of Computer Science and Engineering, Seoul National University
  • , Moti YungAffiliated withDept. of Computer Science, Columbia University

* Final gross prices may vary according to local VAT.

Get Access


We propose a short traceable signature scheme based on bilinear pairings. Traceable signatures, introduced by Kiayias, Tsiounis and Yung (KTY), support an extended set of fairness mechanisms (mechanisms for anonymity management and revocation) when compared with the traditional group signatures. Designing short signatures based on the power of pairing has been a current activity of cryptographic research, and is especially needed for long constructions like that of traceable signatures. The size of a signature in our scheme is less than one third of the size in the KTY scheme and about 40% of the size of the pairing based traceable signature (which has been the shortest till today). The security of our scheme is based on the Strong Diffie-Hellman assumption and the Decision Linear Diffie-Hellman assumption. We prove the security of our system in random oracle model using the security model given by KTY.


traceable signatures group signatures anonymity cryptographic protocols bilinear pairings