Energy Efficient Optimal Transaction Selection and Elimination for Energy Efficient Secure Blockchain Transaction
How to Cite?
Michel Rwibasira, Suchithra R, "Energy Efficient Optimal Transaction Selection and Elimination for Energy Efficient Secure Blockchain Transaction," International Journal of Engineering Trends and Technology, vol. 70, no. 3, pp. 334-341, 2022. Crossref, https://doi.org/10.14445/22315381/IJETT-V70I2P238
Blockchain is a secure, shared, and distributed registry that makes recording and tracking resources easier without the use of a trusted third party. It enables both sides to communicate and share resources within a network of partners, rather than a single central body, where distribution decisions are determined by a majority. In general, what is valuable can be tracked in a blockchain network to reduce security risks and save on security check costs for all stakeholders. Ledger technology distributed in blockchain has emerged in recent years as a successful platform for machine-to-machine commerce. When writing a blockchain ledger requires a high memory of almost 395 GB in the system without permission. Therefore, any activity accepted by any participant is likely to increase the book size. On the other hand, the authorized system assumes that the registration is copied only in a closed group of known participants. This can lead to smaller registrations, but it can also mean that multiple ledgers are stored at the same time. To overcome these shortcomings, this paper has developed a proposed method for reducing the size of common notebooks in a blockchain system based on Energy Efficient Optimal Transaction Selection and Elimination (EEOTSE). EEOTSE approach reduces power and optimizes blockchain framework. In addition, multiple attacks such as 51% attacks, double costs, and selfish attacks affect the security of the blockchain. To prevent these attacks, the proposed method presented in this article is called the BLCMAShield method. BLCMAShield provides high security with low execution time compared to other existing methods. Attack detection rate, error rate, execution time, power consumption is used to analyse the performance of the BLCMAShield & EEOTSE method and are compared with the existing method. Experimental results show that BLCMAShield & EEOTSE provides the best results from existing methods.
Blockchain, 51% attacks, double costs, selfish attacks, BLCMA Shield and EEOTSE.
 Bitcoin virtual currency: Unique features present distinct challenges for deterring illicit activity. Technical report, Federal Bureau of Investigation, (2012).
 M. Babaioff, S. Dobzinski, S. Oren, and A. Zohar. On bitcoin and red balloons. In Proc. of Electronic Commerce, (2012).
 Tobias Bamert, Christian Decker. Lennart Elsen, Samuel Welten, and Roger Wattenhofer. Have a snack, pay with bitcoin. In IEEE 1nternation Conference on Peer-to-Peer Computing (P2P), Trento, Italy, (2013).
 Jorg Becker, Dominic Breuker, Tobias Heide, Justus Holler, Hans Peter Rauer, and Rainer Bohme. Geld stinkt, bitcoin auch - eine Okobilanz der bitcoin block chain. In BTC (2012). Workshop Bitcoin.
 M. Vasek, M. Thornton, and T. Moore, Empirical analysis of denial-of-service attacks in the bitcoin ecosystem, in International Conference on Financial Cryptography and Data Security. Springer, (2014) 57–71.
 D. Bradbury, The problem with bitcoin, Computer Fraud & Security, 2013(11) (2013) 5–8.
 M. Herrmann, Implementation, evaluation and detection of a double spend-attack on bitcoin,( 2012).
 C. Decker and R. Wattenhofer, Information propagation in the bitcoin network, in Peer-to-Peer Computing (P2P), 2013 IEEE Thirteenth International Conference on. IEEE, (2013) 1– 10.
 H. Watanabe, S. Fujimura, A. Nakadaira, Y. Miyazaki, A. Akutsu, and J. Kishigami, Blockchain contract: Securing a blockchain applied to smart contracts, in Consumer Electronics (ICCE), 2016 IEEE International Conference on. IEEE, (2016) 467–468.
 A. Badzar, Blockchain for securing sustainable transport contracts and supply chain transparency-an explorative study of blockchain technology in logistics, (2016).
 S. Wilkinson, J. Lowry, and T. Boshevski, Metadisk a blockchain-based decentralized file storage application, Technical Report. http://metadisk. org/metadisk. Pdf, Tech. Rep., (2014).
 X. Xu, C. Pautasso, L. Zhu, V. Gramoli, A. Ponomarev, A. B. Tran, and S. Chen, The blockchain as a software connector, in Software Architecture (WICSA), 2016 13th Working IEEE/IFIP Conference on. IEEE, (2016)182–191.
 Ian Miers, Christina Garman, Matthew Green, and Aviel D. Rubin. ZeroCoin: Anonymous distributed e-cash from bitcoin.( 2013) .
 I1ja Gerhardt and Timo Hanke. Homomorphic payment addresses and the pay-to-contract protocol. CoRR, abs/1212.3257, (2012).
 F. Reid and M. Harrigan. An analysis of anonymity in the bitcoin system. In Proc. of the Conference on Social Computing (social com), (2011).
 G.O. Karame, E. Androulaki, and S. Capkun. Two bitcoins at the price of one? Double-spending attacks on fast payments in bitcoin. In Proc. of Conference on Computer and Communication Security, (2012).
 Dorit. Ron and Adi Shamir. Quantitative analysis of the full bitcoin transaction graph.
 Matthew Elias. Bitcoin: Tempering the digital ring of gyges or implausible pecuniary privacy. Available at SSRN 1937769, (2011).
 Jeremy Clark and Aleksander Essex. Commitcoin: Carbon dating commitments with bitcoin. In Financial Cryptography and Data Security. (2012).
 Bitcoin wiki. https://en.bitcoin.it/wiki/Confirmation. Confirmation looked at on 2012-04-18.
 Bitcoin wiki. https://en.bitcoin.it/wiki/Myths#Point_of_sale_ with_bitcoins_isn.27t_possible_because_of_the_10_minute_wai t_ for_confirmation. Myths, looked at on 2012-04-18.
 G. Mwitende, Y. Ye, I. Ali, F. Li, Certificateless authenticated key agreement for blockchain-based wbans, J. Syst. Archit. 110 (11) (2020) 1–31.
 X. Li, Y. Mei, J. Gong, F. Xiang, Z. Sun, A blockchain privacy protection scheme based on ring signature, IEEE Access 8 (8) (2020) 76765–76772.
 F. Li, Z. Liu, T. Li, H. Ju, H. Wang, H. Zhou, Privacy-aware PKI model with strong forward security, Int. J. Intell. Syst. 8 (8) (2020) 1–17.