Modified Lamport Merkle Digital Signature blockchain framework for authentication of internet of things healthcare data

Dickson polynomial-based secure group authentication scheme for Internet of Things

Internet of Things (IoT) paves the way for the modern smart industrial applications and cities. Trusted Authority acts as a sole control in monitoring and maintaining the communications between the IoT devices and the infrastructure. The communication between the IoT devices happens from one trusted entity of an area to the other by way of generating security certificates. Establishing trust by way of generating security certificates for the IoT devices in a smart city application can be of high cost and expensive. In order to facilitate this, a secure group authentication scheme that creates trust amongst a group of IoT devices owned by several entities has been proposed. The majority of proposed authentication techniques are made for individual device authentication and are also utilized for group authentication; nevertheless, a unique solution for group authentication is the Dickson polynomial based secure group authentication scheme. The secret keys used in our proposed authentication technique are generated using the Dickson polynomial, which enables the group to authenticate without generating an excessive amount of network traffic overhead. IoT devices' group authentication has made use of the Dickson polynomial. Blockchain technology is employed to enable secure, efficient, and fast data transfer among the unique IoT devices of each group deployed at different places. Also, the proposed secure group authentication scheme developed based on Dickson polynomials is resistant to replay, man-in-the-middle, tampering, side channel and signature forgeries, impersonation, and ephemeral key secret leakage attacks. In order to accomplish this, we have implemented a hardware-based physically unclonable function. Implementation has been carried using python language and deployed and tested on Blockchain using Ethereum Goerli's Testnet framework. Performance analysis has been carried out by choosing various benchmarks and found that the proposed framework outperforms its counterparts through various metrics. Different parameters are also utilized to assess the performance of the proposed blockchain framework and shows that it has better performance in terms of computation, communication, storage and latency.

BTDA: Two-factor dynamic identity authentication scheme for data trading based on alliance chain

With the increase in the market share of data trading, the risks such as identity authentication and authority management are increasingly intensified. Aiming at the problems of centralization of identity authentication, dynamic changes of identities, and ambiguity of trading authority in data trading, a two-factor dynamic identity authentication scheme for data trading based on alliance chain (BTDA) is proposed. Firstly, the use of identity certificates is simplified to solve the problems of large calculation and difficult storage. Secondly, a two-factor dynamic authentication strategy is designed, which uses distributed ledger to achieve dynamic identity authentication throughout the data trading. Finally, a simulation experiment is carried out on the proposed scheme. The theoretical comparison and analysis with similar schemes show that the proposed scheme has lower cost, higher authentication efficiency and security, easier authority management, and can be widely used in various fields of data trading scenarios.

Secure Medical Blockchain Model

The Internet of Medical Things (IoMT) uses wireless networks to help patients to communicate with healthcare professionals. Therefore, IoMT devices suffer from a lack of security controls, just like many Internet of Things (IoT) gadgets. Thus, in this paper, we develop a system that uses a blockchain to secure medical data for each transaction between physicians and patients. This system also helps the physician to send the treatment to the blockchain. The blockchain creates a new block for the treatment and connects it with the previous block. This system also helps patients to access their treatment through the blockchain. SHA-256 is used to hash the new block using some information about the last block. We modify SHA-256 using the LZ4 algorithm to compress data. We also prevent a new block hash code starting with a specific number of zeros, which made the proposed system give a time complexity better than all related work. In this paper, we also develop a party-authentication technique that ensures the two parties of the transaction. The proposed system makes a transaction with O(n) time complexity. Thus, our system takes 1 s to create a block for the transaction. We also make a green computing algorithm comparison between our proposed system and the blockchain version. This comparison proves that our proposed method consumes less energy to create a new block. This paper proves that our method performs better than all previous blockchain versions.