ABSTRACT
Resource constrained devices such as sensors and RFIDs are utilized in many application areas to sense, store and transmit the sensitive data. This data must be encrypted to achieve confidentiality. The implementation of traditional public key encryption (PKE) techniques by these devices is always challenging as they possess very limited computational resources. Various encryption schemes based on identity-based encryption (IBE) and certificate-less public key encryption (CL-PKE) have been proposed to overcome limitations of PKI. However, many of these schemes involve the computationally expensive exponentiation and bilinear pairing operations on elliptic curve group to encrypt the messages. In this context, we propose a lightweight optimized CL-PKE scheme in which exponentiation and pairing operations are completely eliminated during encryption and only involves computation of cheaper addition and multiplication operations on elliptic curve. Implementation of the proposed scheme confirms its lightweight nature as compared to original CL-PKE scheme.
- Sattam S Al-Riyami and Kenneth G Paterson. 2003. Certificateless public key cryptography. In International Conference on the Theory and Application of Cryptology and Information Security. Springer, 452--473.Google ScholarCross Ref
- Ian Blake, Gadiel Seroussi, and Nigel Smart. 1999. Elliptic curves in cryptography. Vol. 265. Cambridge University Press. Google ScholarDigital Library
- Dan Boneh and Xavier Boyen. 2004. Efficient selective-ID secure identity-based encryption without random oracles. In International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 223--238.Google ScholarCross Ref
- Dan Boneh and Matthew Franklin. 2003. Identity-based encryption from the Weil pairing. SIAM journal on computing 32, 3 (2003), 586--615. Google ScholarDigital Library
- Fuchun Guo, Yi Mu, Willy Susilo, Homer Hsing, Duncan S Wong and Vijay Varadharajan. 2017. Optimized identity-based encryption from bilinear pairing for lightweight devices. IEEE Transactions on Dependable and Secure Computing 14, 2 (2017), 211--220. Google ScholarDigital Library
- Craig Gentry. 2006. Practical identity-based encryption without random oracles. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 445--464. Google ScholarDigital Library
- Kerry A McKay, Kerry A McKay, Larry Bassham, Meltem Sonmez Turan, and Nicky Mouha. 2017. Report on lightweight cryptography. US Department of Commerce, National Institute of Standards and Technology.Google Scholar
- Kenneth G Paterson. 2002. ID-based signatures from pairings on elliptic curves. Electronics Letters 38, 18 (2002), 1025--1026.Google ScholarCross Ref
- Alka Sawlikar. 2012. Point Multiplication Methods for Elliptic curve Cryptography. International Journal of Engineering and Innovative Technology (IJEIT) 1, 1 (2012), 1--4.Google Scholar
- SM RiazulIslam, Daehan Kwak, MD Humaun Kabir, Mahmud Hossain and Kyung-Sup Kwak. 2015. The internet of things for health care: A Comprehensive Survey. IEEE Access 3 (2015), 678--708.Google ScholarCross Ref
- Serge Vaudenay. 2007. On privacy models for RFID. In International Conference on the Theory and Application of Cryptology and Information Security. Springer, 68--87. Google ScholarDigital Library
- Brent Waters. 2005. Efficient identity-based encryption without random oracles. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 114--127. Google ScholarDigital Library
- Xuefei Cao, Xingwen Zeng, Weidong Kou and Liangbing Hu. 2009. Identity-based anonymous remote authentication for value-added services in mobile networks. IEEE Transactions on Vehicular Technology 58, 7 (2009), 3508--3517.Google ScholarCross Ref
Index Terms
- Optimized CL-PKE with lightweight encryption for resource constrained devices
Recommendations
CBE from CL-PKE: a generic construction and efficient schemes
PKC'05: Proceedings of the 8th international conference on Theory and Practice in Public Key CryptographyWe present a new Certificateless Public Key Encryption (CL-PKE) scheme whose security is proven to rest on the hardness of the Bilinear Diffie-Hellman Problem (BDHP) and that is more efficient than the original scheme of Al-Riyami and Paterson. We then ...
New identity-based key-insulated convertible multi-authenticated encryption scheme
Elaborating on the merits of convertible multi-authenticated encryption (CMAE) schemes and key-insulated systems, we propose a novel identity-based key-insulated convertible multi-authenticated encryption scheme (IB-KI-CMAE), which can effectively ...
Chosen-Ciphertext Secure Proxy Re-encryption without Pairings
CANS '08: Proceedings of the 7th International Conference on Cryptology and Network SecurityIn a proxy re-encryption system, a semi-trusted proxy can convert a ciphertext originally intended for Alice into a ciphertext intended for Bob, without learning the underlying plaintext. Proxy re-encryption has found many practical applications, such ...
Comments