Conference Papers
Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/28506
Browse
2 results
Search Results
Item Ethereum Blockchain Enabled Secure and Transparent E-Voting(Springer Science and Business Media Deutschland GmbH, 2021) Rao, V.; Singh, A.; Rudra, B.The blockchain’s revolutionary concept is the underlying technology behind the popular examples such as Bitcoin and it now relies on the Web and online services. Nowadays, blockchain is famous for its use in cryptocurrencies, but many fintech activities and routine processes that were done offline can be done using blockchain. Smart contracts are abstract pieces of codes that need to be inserted into the network and enforced as planned in every phase of upgrading blockchains. With the population growing so fast across the globe, e-voting is an emerging online service-related issue. The smart contracts of blockchain enable to have a easy, safe, cheap, secure and transparent e-voting due to which blockchain is one of the top solutions for e-voting. Even in the many blockchains available in the world, Ethereum is one of the most consistent available blockchain and has widespread use because of which it is suitable for e-voting. An e-voting system must ensure that it is secure, as it should not allow duplicated votes and it should be able to protect attendants’ privacy being fully transparent too. In this paper, Ethereum wallets and Solidity language for smart contracts were used to make a sample small scale e-voting application. The blockchain was tested on local blockchain using ganache and ropsten test network. The Ethereum blockchain keeps the records of ballots and votes after an election is held. Users can use Ethereum wallets to directly submit theirs vote and those votes are handled with the consensus of each Ethereum node. © 2021, Springer Nature Switzerland AG.Item Efficient PBFT: A Novel and Efficient Approach to the PBFT Consensus Algorithm(Springer Science and Business Media Deutschland GmbH, 2022) Rao, V.; Shenoy, A.R.; Manjappa, M.Blockchain technology, which is built upon the distributed and decentralised network, suffers from mutual trust among the nodes, and hence, it employs a consensus algorithm to achieve democracy. Consensus algorithm is one of the core elements of blockchain architecture, and a strong, reliable and efficient consensus algorithm is very much required for a blockchain network in order to prevent the intrusion of malicious nodes. A good consensus algorithm drives the blockchain network in the right direction by keeping the malicious transactions off the chain. Thus, in this article, a novel consensus algorithm referred to as efficient practical Byzantine fault tolerance (E-PBFT) is proposed for a private blockchain. E-PBFT finds the winner miner for mining the candidate blocks in an efficient manner which reduces the number of messages exchanged between the nodes. Further, in order to give additional security, a hidden winner miner concept is also included in E-PBFT which hides the winner miner from the adversaries, so that the adversaries will never come to know who is mining the transactions. The theoretical proof for the proposed algorithm is also given whose results are quite convincing when compared to classical PBFT algorithm. The proposed E-PBFT will definitely strengthen the blockchain network by quickly reaching the consensus and by hiding the winner miner, thereby giving additional security. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.