Welcome to the InfoSci Platform
Reference Hub7
Efficient Pairing-Free Identity-Based Signcryption Scheme for Cloud-Assisted IoT

Efficient Pairing-Free Identity-Based Signcryption Scheme for Cloud-Assisted IoT

Medikonda Asha Kiran, Syam Kumar Pasupuleti, R. Eswari
Copyright: © 2022 |Volume: 12 |Issue: 1 |Pages: 15
ISSN: 2156-1834|EISSN: 2156-1826|EISBN13: 9781683182535|DOI: 10.4018/IJCAC.305216
Cite Article Cite Article

MLA

Kiran, Medikonda Asha, et al. "Efficient Pairing-Free Identity-Based Signcryption Scheme for Cloud-Assisted IoT." IJCAC vol.12, no.1 2022: pp.1-15. http://doi.org/10.4018/IJCAC.305216

APA

Kiran, M. A., Pasupuleti, S. K., & Eswari, R. (2022). Efficient Pairing-Free Identity-Based Signcryption Scheme for Cloud-Assisted IoT. International Journal of Cloud Applications and Computing (IJCAC), 12(1), 1-15. http://doi.org/10.4018/IJCAC.305216

Chicago

Kiran, Medikonda Asha, Syam Kumar Pasupuleti, and R. Eswari. "Efficient Pairing-Free Identity-Based Signcryption Scheme for Cloud-Assisted IoT," International Journal of Cloud Applications and Computing (IJCAC) 12, no.1: 1-15. http://doi.org/10.4018/IJCAC.305216

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The Internet of Things (IoT) has become a part of our everyday life. Due to limited storage and computational capabilities, data collected by IoT devices outsource to cloud servers. Although cloud servers provide many benefits, confidentiality and authenticity are the major issues. Signcryption is a cryptographic technique to address the above issues. Several identity-based signcryption schemes are proposed; however, these schemes create heavy computation and communication overhead because of bilinear pairings. This paper proposes an Efficient Pairing-Free Identity-based Signcryption (EPFIBSC) scheme based on Elliptic Curve Cryptography (ECC), which reduces computation and communication overhead. The EPFIBSC scheme's security is proven under Elliptic Curve Discrete Logarithm Problem (ECDLP). The scheme also meets the security requirements such as confidentiality, authenticity, and unforgeability. In performance analysis, the authors compare the scheme with some of the existing schemes; the comparison shows that this scheme is more efficient in computation and communication costs.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.