Applying Diffie-Hellman algorithm to solve the key agreement problem in mobile blockchain-based sensing applications

10Citations
Citations of this article
36Readers
Mendeley users who have this article in their library.

Abstract

Mobile blockchain has achieved huge success with the integration of edge computing services. This concept, when applied in mobile crowd sensing, enables transfer of sensor data from blockchain clients to edge nodes. Edge nodes perform proof-of-work on sensor data from blockchain clients and append validated data to the chain. With this approach, blockchain can be performed pervasively. However, securing sensitive sensor data in a mobile blockchain (client/edge node architecture) becomes imperative. To this end, this paper proposes an integrated framework for mobile blockchain which ensures key agreement between clients and edge nodes using Elliptic Curve Diffie-Hellman algorithm. Also, the framework provides efficient encryption of sensor data using the Advanced Encryption Standard algorithm. Finally, key agreement processes in the framework were analyzed and results show that key pairing between the blockchain client and the edge node is a non-trivial process.

Cite

CITATION STYLE

APA

Owoh, N. P., & Singh, M. M. (2019). Applying Diffie-Hellman algorithm to solve the key agreement problem in mobile blockchain-based sensing applications. International Journal of Advanced Computer Science and Applications, 10(3), 59–68. https://doi.org/10.14569/IJACSA.2019.0100308

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free