ULS-PBFT:An ultra-low storage overhead PBFT consensus for blockchain

Since the Practical Byzantine Fault Tolerance(PBFT)consensus mechanism can avoid the performance bottleneck of blockchain systems caused by Proof of Work(PoW),it has been widely used in many scenarios.However,in the blockchain system,each node is required to back up all transactions and block data of the system,which will waste a lot of storage resources.It is difficult to apply to scenarios with limited storage resources such as unmanned aerial vehicle networks and smart security protection;thus,it is often used in small-scale networks.In order to deploy PBFT-based blockchain systems in large-scale network scenarios,we propose an ultra-low storage overhead PBFT consensus(ULS-PBFT),which groups nodes hierarchically to limit the storage overhead within the group.In this paper,we first propose an optimal double-layer PBFT consensus from the perspective of minimizing the storage overhead,and prove that this consensus can significantly reduce the storage overhead.In addition,we also investigate the superiority of ULS-PBFT in terms of communication overhead while setting the security threshold in the presence of the possibility of Byzantine nodes.The simulation results demonstrate the advantages of ULS-PBFT.Then,we extend such grouping idea to the blockchain system with X-layer PBFT and analyze its storage and communication overhead.Finally,the node grouping strategy of double-layer PBFT is studied for four application scenarios when the performance of storage overhead,communication overhead,and security are considered comprehensively.

A Novel Hybrid Encryption Method Based on Honey Encryption and Advanced DNA Encoding Scheme in Key Generation

Nowadays, increased information capacity and transmission processes make information security a difficult problem. As a result, most researchers employ encryption and decryption algorithms to enhance information security domains. As it progresses, new encryption methods are being used for information security. In this paper, a hybrid encryption algorithm that combines the honey encryption algorithm and an advanced DNA encoding scheme in key generation is presented. Deoxyribonucleic Acid (DNA) achieves maximal protection and powerful security with high capacity and low modification rate, it is currently being investigated as a potential carrier for information security. Honey Encryption (HE) is an important encryption method for security systems and can strongly prevent brute force attacks. However, the traditional honeyword encryption has a message space limitation problem in the message distribution process. Therefore, we use an improved honey encryption algorithm in our proposed system. By combining the benefits of the DNA-based encoding algorithm with the improved Honey encryption algorithm, a new hybrid method is created in the proposed system. In this paper, five different lookup tables are created in the DNA encoding scheme in key generation. The improved Honey encryption algorithm based on the DNA encoding scheme in key generation is discussed in detail. The passwords are generated as the keys by using the DNA methods based on five different lookup tables, and the disease names are the input messages that are encoded by using the honey encryption process. This hybrid method can reduce the storage overhead problem in the DNA method by applying the five different lookup tables and can reduce time complexity in the existing honey encryption process.