Efficient and provable secure pairing-free security-mediated identity-based identification schemes

Chin, Ji Jian and Tan, Syh Yuan and Heng, Swee Huay and Phan, Raphael Chung Wei (2014) Efficient and provable secure pairing-free security-mediated identity-based identification schemes. The Scientific World Journal, 2014. ISSN 1537-744X

[img] Text
Efficient and provable secure pairing-free security-mediated identity-based identification schemes.pdf
Restricted to Repository staff only

Download (1MB)
Official URL: http://www.hindawi.com/journals/tswj/2014/170906/

Abstract

Security-mediated cryptography was first introduced by Boneh et al. in 2001. The main motivation behind security-mediated cryptography was the capability to allow instant revocation of a user’s secret key by necessitating the cooperation of a security mediator in any given transaction. Subsequently in 2003, Boneh et al. showed how to convert a RSA-based security-mediated encryption scheme from a traditional public key setting to an identity-based one, where certificates would no longer be required. Following these two pioneering papers, other cryptographic primitives that utilize a security-mediated approach began to surface. However, the security-mediated identity-based identification scheme (SM-IBI) was not introduced until Chin et al. in 2013 with a scheme built on bilinear pairings. In this paper, we improve on the efficiency results for SM-IBI schemes by proposing two schemes that are pairing-free and are based on well-studied complexity assumptions: the RSA and discrete logarithm assumptions.

Item Type: Article
Subjects: T Technology > T Technology (General)
Divisions: Faculty of Engineering (FOE)
Faculty of Information Science and Technology (FIST)
Depositing User: Ms Nurul Iqtiani Ahmad
Date Deposited: 24 Jul 2014 08:43
Last Modified: 24 Jul 2014 08:43
URI: http://shdl.mmu.edu.my/id/eprint/5651

Actions (login required)

View Item View Item