Short and efficient identity-based undeniable signature scheme


Behnia, Rouzbeh and Heng, Swee-Huay and Gan, Che-Sheng (2012) Short and efficient identity-based undeniable signature scheme. In: Trust, Privacy and Security in Digital Business. Lecture Notes in Computer Science (7449). Springer Berlin Heidelberg, pp. 143-148. ISBN 978-3-642-32286-0

[img] Text
Short and efficient identity-based undeniable signature scheme.pdf
Restricted to Repository staff only

Download (162kB)


The first provably secure identity-based undeniable signature schemes was proposed by Libert and Quisquater, where they formulated the security model of undeniable signature schemes in an identity-based setting for the first time. Later, Wu et al. proposed a convertible identity-based undeniable signature scheme. Both of the proposed schemes require pairing evaluations in their signing algorithm. In this paper, we propose an efficient identity-based undeniable signature scheme and prove its security in the random oracle model. Due to its efficient signing algorithm and short signature length, our scheme can be applied to systems with low-computation power which are operating in low-bandwidth communication channels (e.g. mobile phones, PDAs, etc.).

Item Type: Book Section
Additional Information: 9th International Conference, TrustBus 2012, Vienna, Austria, September 3-7, 2012. Proceedings
Subjects: Q Science > Q Science (General)
Divisions: Faculty of Information Science and Technology (FIST)
Depositing User: Ms Rosnani Abd Wahab
Date Deposited: 10 Jan 2014 03:27
Last Modified: 10 Jan 2014 03:27


Downloads per month over past year

View ItemEdit (login required)