Claims:The scope of the invention is defined by the following claims:

Claims:
1. A novel HSB algorithm is developed to encrypt and decrypt the large data size. Moreover, the Algorithm is more secure than other encryption algorithms used in secure blockchain transactions in terms of confidential rate, encryption time, decryption time, resource usage, and accuracy
a) The achieved accuracy rate of the HSB algorithm is compared with other existing replicas such as CH, MECC and cloud RSA.
b) SA replica has attained 96% accuracy with 16 bytes of data, and the MECC method has gained 85% accuracy.
c) The Cloud RSA method has attained 92 % accuracy for 16 bytes of data
d) The comparison of encryption time with other existing techniques is the CH technique as achieved 21 ms, the MECC technique has gained 196.6ms, Cloud RSA method has attained 95.56m and the developed HSB mechanism has obtained a 38ms encryption time for using 16 bytes of data. compared to other methods, the developed algorithm has taken less time
2. As per claim 1, the comparison shows that the existing CH method takes209ms, the MECC algorithm has taken 195ms, and the Cloud RSA algorithm has taken 94ms for 16 bytes of data. Consequently, the proposed HSB algorithm has achieved 34.92 ms decryption time, while compared to other methods, the developed algorithm has taken less time.
3. As per claim 1, The developed algorithm results are compared with other prevailing techniques like CH, MECC and cloud RSA, the existing CH has utilized 30%, MECC has used58%, and the cloud RSA approach has utilized 73%. Furthermore, the proposed HSB algorithm has utilized 96.23% of resources for 16 bytes of data.
4. As per claim 1, The performance of the confidential rate is compared with some of the conventional techniques such as CH, MECC and cloud RSA,. Consequently, the confidential rate of the developed method is compared with the existing methods. The conventional CH method has attained an 83% of the confidential rate, the MECC method has achieved a 79% confidential rate also the cloud RSA technique has achieved a 90% of confidential rate. , Description:Field of Invention
The present invention relates to, provide the privacy and security to blockchain data from Adversarial attacks. By combining two cryptographic algorithms (Homomorphic, Serpent) Secure the Transactions from privacy leakage in Blockchain Network.
Background of the invention
To enhance the blockchain security model, Hyunil Kim et al [(CEEC) IEEE, 2018] have designed the Ml model based on the stochastic gradient approach. In the experimental, it has verified that the designed replica has sufficient capacity to fight against adversarial attacks. Finally, the presented model has gained the finest accuracy than the previous models. But it takes more time to complete the process because of the large transaction system.
In recent, the intrusion diagnosis system in blockchain became the key factor in the blockchain appliance to enhance the privacy measure. So Osama Alkadi et al [(ICTACIS). Springer 2018] have projected an ensemble model to recognize the harmful malicious events to ensure info privacy. Also, this framework can function as decision support that can support the users to migrate the files securely. However, it is complex in design.
To prevent data forgery in the vehicular cloud environment, Younghun Lee et al [(CEE86) 2020] have presented smart architecture with the crypto model to rectify the attack vulnerability issues in a decentralized network. Hence, this scheme can help the users to share the information without any difficulties. However, this smart architecture is not easy to redesign again, once the flaw occurs.
Will Serrano [IEEE Access 7 (2019)] has utilized the blockchain strategy in 5G wireless communication to secure the communication among the user ends. Finally, the strength of the designed blockchain in the 5G wireless technology is proved by evaluating data broadcasting rate and throughput ratio. Hence it has gained a wide range of data broadcasting rates than other models. But comparing to other conventional models it has consumed more time.
To create an efficient intrusion detection paradigm, NourMoustafa et al[IEEE IoT Journal 8.12 (2020)] have developed a detailed review based on intrusion prediction framework in a blockchain environment. Finally, the authors have announced that developing an efficient attack prediction framework will enhance blockchain performance in cloud applications. Also, wide measures of resources are required to run the blockchain process.
Description of Prior Art
Research findings on the blockchain security have received considerable importance as patents because of its directly applied in Crypto-currency, cloud applications, IoT applications, supply chain ,Communication applications etc. One of the recent patents describes about A machine and approach offering a protection gateway for excessive protection blockchain systems, that acts as a firewall , has the capacity to recognize and put in force blockchain enterprise approaches policies, and might recognize tokens and their functionality, without definitely disabling code execution, for instance from clever contracts or tokens enabled through clever contracts. (US11042804B2). Some of the other patents discuss about enhancing security of blockchain technology by Implementing various techniques (US10542046B2, US10387684B2, US20200035339A1, US20200372154A1 & WO2020113139A1). Another one of recent patents talks about A private encryption key is generated from the biometric information and / or other user information and / or information obtained from a unpredictable physical process and are stored in a secure area of a device and a public key is transmitted to the blockchain network which acts as a service provider . In some embodiments , the private key depends upon at least partly on user information presented in the secure area (US20180144114A1).
The studies are focused on the privacy for online transactions (WO2021057180A1). In addition, several ML and DL models already exist to secure the files in the blockchain environment [(CEEC). IEEE, 2018]. But it couldn’t succeed because of complex data and attacks harmfulness. The advanced techniques such as the stochastic gradient approach [IEEE Access 7 (2019)], ensemble model [IEEE IoT Journal 8.12 (2020)], etc. to stop these issues but still the large data have recorded the complexity score.
Summary of the invention
In an online transaction, the malevolent activities are tried to decrypt the data without the help of a manipulator. In this current research, a novel blockchain algorithm will be designed with suitable parameters for an online transaction system among the source and destination. A secure homomorphic Serpent Blockchain (HSB) algorithm is proposed to preserve privacy and enhance security activities. Initially, the amounts of data bytes are trained to the system and stored in the particular database.
The objective of this invention is to improve security and speed of online data transactions in blockchain network. Homomorphic Serpent encryption was implemented on Transactions by modifying blockchain Encryption and it has improved the efficiency of blockchain network.
Detailed description of the invention
The proposed HSB algorithm is a combination of homomorphic and Serpent cryptography algorithm. Moreover, this algorithm is used for securing the data through the online transaction manner. Based on blockchain technology online transaction process will happen. In addition, the proposed algorithm is operating based on several sections like key generation; the encryption process has verification and decryption. Primarily, the proposed algorithm is to access user data based on unwanted external access. Here, the unwanted external access problems are lead to cause the security.
Hash-1 calculation. The homomorphic concept includes several functions like primary transformation, round function, etc. Here, the homomorphic concept is developed to deliver the data effectively in the online application. Moreover, the homomorphic encryption algorithm is a powerful strategy when compared to other encryption techniques, which are utilized to achieve higher security during the transaction process. In an existing approach, encrypted data is stored in the cloud storage system before the decrypted computation performance. In this, scenario the privacy data is completely endangered. In this, the homomorphic concept permits the ciphertext function to be processed directly. Therefore, the third party cannot perform the ciphertext operation without the help of the decryption process. Here, initially, a novel HSB algorithm is designed to calculate the hash function of original data. The proposed strategy is performed based on a homomorphic cryptography hash algorithm. Moreover, the calculation of hash function (Hi) is mentioned in eqn. (1) and (2), Where, H* is represented as a raw hash value, vi* is denoted as raw data and wi* is the weightage function of each raw data. Moreover, the homomorphic algorithms for two data that is O1* O2*and that weight functions w1* w2* hold that all hash function and verify whether data is hacked or not using eqn. (3)
The proposed algorithm has provided the finest security to transfer large data in the online application.
Data encryption .In the encryption process, 64-bit plaintext is taken and 64-bit ciphertext is generated through the corresponding plaintext. In addition, encryption has five major sections such as primary transformation, key generation, Substitution-box, direct transform, and final transformation. Consequently, the input plain text is configurated by the primary transformation, which is provided transformed output. In these transformed functions the correspondent key is used in decryption and encryption is similar and it's assumed as a symmetric key. Here, the 64-bit key length is generated from 128 user-defined key lengths. Moreover, the serpent encryption algorithm is used as an encryption process. Consequently, the generation of the key is using Eqn. (4),
Where Ci is denoted as ciphertext, E* is represented as the encrypted key of the correspondent plain text P FT is denoted final transformation. Additionally, sub keys are also generated linear information for accessing the online transaction details. Then, 64-bits and pre keys are identified using eqn. (5). Where i is denoted as 0 to 61,P*i-8 ……. P*i-1 is the 128 user-defined key which is split into 4 forms of the 32-bit plain text to develop 128. Shift rotation is denoted as <<< Moreover, this encrypted data is taken as the second hash function. Moreover, the transformation function is expressed in below eqn. (6)
Where bm,nis the nth bit in the binary representation of bm from lower-level to higher-level bit. Consequently, this process is iterating still each sub key are allotted to the particular plain text. Here, hash 2 is estimated using a serpent encryption algorithm and attained hash is stored in the cloud database. Therefore, the proposed algorithm is developed in terms of hash algorithm set it will split the data as well as provide high security during the transaction process. Here, key generation is an important part of this developed algorithm because the online transaction process is performed based on the key generation process. To transmit the data source to the destination needs to the encryption process. So, the sender node encrypts the data with the help of a suitable algorithm. Also, the destination node decrypts the data using the private key. In addition, the online transaction system generates the public key based on the below eqn. (7). WherePu*(k) is represented as the public key, Pi* is denoted as plain text. After that find the create the secret key of all plain text using below eqn. (8),
After the key generation process, the data is encrypted using a correspondent encryption algorithm. Here, the encrypted data consist of two cipher texts, which is calculated mathematically using eqn. (9) and (10), Where, Q is denoted as randomly choose the number in a particular range [1, 0],O* is represented as original data and H is denoted hash function. In addition, the encrypted data is changing the IP address during the transaction process.
4 Claims & 4Figures
Brief description of Drawing
In the figures which are illustrate exemplary embodiments of the invention.
Figure 1 Homomorphic Serpent Blockchain framework.
Figure 2 Process flow of the Homomorphic Serpent algorithm
Figure 3 Homomorphic Serpent Blockchain Algorithm
Figure 4 Performance comparison of CH, MECC, CRSA, HSB accuracy measure, validation encryption time and decryption time, Resource usage, confidential range
Detailed description of the drawing
The present invention relates to secure the online transitions in blockchain with novel Encryption. In figure1, A secure homomorphic Serpent Blockchain (HSB) algorithm is designed to preserve privacy and enhance security activities. Initially, the amounts of data bytes are trained to the system and stored in the particular database. At first, find the hash value using a homomorphic encryption algorithm in trained data and that value is considered as hash one. Consequently, the collected data bytes are encrypted using Serpent cryptographic algorithm, and that encrypted data is taken as hash two. Finally, hash 1 and hash 2 are verified successfully.
While decrypting the data the homomorphic Serpent Blockchain (HSB) algorithm is should be satisfied. From the satisfaction, if hash 1 is the same as hash 2 then the proposed condition is verified the data is cannot hack the external user or third parties. If hash 1 is not matched with hash 2 the data is hacked by the external user or third parties during the transaction process. Furthermore, the developed HSB replica workflow is demonstrated in the algorithm.1. Consequently, the flow of proposed work is illustrated in figure.2. Equations used for calculating Hash-1 calculation using Homomorphic, Hash-2 calculations using Serpent and Verification of Transaction by comparing hash-1 and hash2 are included in figure 3
In Figure 4, The HSB algorithm is a combination of homomorphic and Serpent cryptography algorithm. Moreover, this algorithm is used for securing the data through the online transaction manner. Based on blockchain technology online transaction process will happen. In addition, the proposed algorithm is operating based on several sections like key generation; the encryption process has verification and decryption. Primarily, the proposed algorithm is to access user data based on unwanted external access. Here, the unwanted external access problems are lead to cause the security. The achieved accuracy rate of the proposed HSB algorithm is compared with other existing replicas such as CH, MECC and cloud RSA. Thus the SA replica has attained 96% accuracy with 16 bytes of data, and the MECC method has gained 85% accuracy. Moreover, the Cloud RSA method has attained 92 % accuracy for 16 bytes of data. The accuracy comparison of the existing technique is demonstrated in figure 5(a).
A comparison of encryption time with other existing techniques is illustrated in Figure 5(b). Here, the CH technique as achieved 21 ms encryption time for using 16 bytes of data and the MECC technique has gained 196.6ms. Furthermore, the Cloud RSA method has attained 95.56ms encryption time for using 16 bytes of data. The developed HSB mechanism has obtained a 38ms encryption time for using 16 bytes of data. The comparison shows that the existing CH method takes209ms, the MECC algorithm has taken 195ms, and the Cloud RSA algorithm has taken 94ms for 16 bytes of data. Consequently, the proposed HSB algorithm has achieved 34.92 ms decryption time, while compared to other methods, the proposed algorithm has taken less time. This comparison shows that the proposed strategy has attained the finest result and is described in table 3 and figure 5(c).
The developed algorithm results are compared with other prevailing techniques like CH, MECC and cloud RSA, which is shown in figure 5(d). Consequently, the existing CH has utilized 30%, MECC has used58%, and the cloud RSA approach has utilized 73%, for 16 bytes of data. Furthermore, the proposed HSB algorithm has utilized 96.23% of resources for 16 bytes of data. The performance of the confidential rate is compared with some of the conventional techniques such as CH, MECC and cloud RSA, which is shown in figure 5(e). Moreover, the confidential rate is validated based on the data size in terms of bytes. Consequently, the confidential rate of the proposed method is compared with the existing methods, as shown in the table. 5. The conventional CH method has at-tained an 83% of the confidential rate, the MECC method has achieved a 79% confidential rate also the cloud RSA technique has achieved a 90% of confidential rate.