<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Indushree M on Medium]]></title>
        <description><![CDATA[Stories by Indushree M on Medium]]></description>
        <link>https://medium.com/@indushree-june1?source=rss-db91da9fa0b------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*loRg3H-N5FztttmGFOmD2g.jpeg</url>
            <title>Stories by Indushree M on Medium</title>
            <link>https://medium.com/@indushree-june1?source=rss-db91da9fa0b------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Sat, 21 Nov 2026 13:30:42 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@indushree-june1/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[“A Decentralized and Secure E-Voting Framework Using Blockchain Technology”]]></title>
            <link>https://indushree-june1.medium.com/a-decentralized-and-secure-e-voting-framework-using-blockchain-technology-778db80244a0?source=rss-db91da9fa0b------2</link>
            <guid isPermaLink="false">https://medium.com/p/778db80244a0</guid>
            <category><![CDATA[voting]]></category>
            <category><![CDATA[smart-contracts]]></category>
            <category><![CDATA[security]]></category>
            <category><![CDATA[ethereum]]></category>
            <category><![CDATA[blockchain]]></category>
            <dc:creator><![CDATA[Indushree M]]></dc:creator>
            <pubDate>Sat, 28 Nov 2020 14:45:38 GMT</pubDate>
            <atom:updated>2020-11-28T14:45:38.573Z</atom:updated>
            <content:encoded><![CDATA[<p><strong>Introduction</strong></p><p>Blockchain is an emerging technology, which offering numerous opportunities to develop decentralized and distributed digital services by ensuring privacy and transparency. The aspect of privacy, authenticity, transparency and security is a threat and challenging in the traditional voting systems. Controversial E-Voting could have been avoided if the election and counting process is transparent, verifiable and secure. The existing voting system does offer anonymity to the voter but the counting process by the officials is not transparent. The voters are supposed to trust the result which is provided by the government body or Election Commission. There are also other electoral flaws like ballot stuffing, voter fraud and booth capturing.</p><p><strong>Motivation</strong></p><p>Controversial E-Voting could have been avoided if the election and counting process is transparent, verifiable and secure. The existing voting system does offer voter privacy and even the vote counting by the officials is also not transparent. The voters are supposed to trust the result which is provided by the government body or Election Commission. There are also other electoral flaws like ballot stuffing, voter fraud and booth capturing. This issue makes difficult for election commission to differentiate between real votes and votes added without proper authentication and authorization.</p><p>Some of the problems in current Electoral process are listed below:</p><p>1. Designing a secure electronic voting system that offers the transparency, privacy and fairness has been a challenging.</p><p>2. Current E-Voting protocols require a centralized authority to monitor and control the whole procedure from ballot to results.</p><p>3. The centralized systems are vulnerable to security attacks like Distributed Denial-Of-Service (DDOS).</p><p>4. Intelligence agencies have access to network and sufficient computing resources to analyze voting informative for the potential modification.</p><p><strong>Global Scenario</strong></p><p>Mistrust in the E-Voting process is a common circumstance even in the developed countries. To ensure the transparency and security that can be implemented in Blockchain based E-voting system. This could helps in solving most of the issues being faced in the voting process.</p><p>The E-voting is based on centralized solution have a single point of failure, which leads to security attacks and vulnerabilities. In this context, Denial of Service, Man-In-The-Middle and insider attacks could crash the centralized databases and servers. The admins of the systems could act malicious and manipulate the information.</p><p><strong>Objectives</strong></p><p>Digital voting system it includes, a secure and decentralized Blockchain based E-Voting protocol has been proposed using Ethereum smart contracts. The proposed protocol ensures authentication, authorization and non-repudiation services. Further, the voter can cast a vote using private key, then the transaction will be recorded in the decentralized Blockchain network, with help of voter Ethereum address, he/she can verify the casted vote in the later stages. In addition, candidate count with details, Vote Count and winning proposal modules have been designed through smart contracts and deployed in Blockchain network.</p><p><strong>Details of project</strong></p><p>E-voting protocol is implemented using Ethereum platform called public Blockchain network. An Ethereum platform offers the wide range of applications, with help of smart contracts. Ethereum Blockchain consists of Ethereum nodes. Each node in the Blockchain is the device which runs an Ethereum protocol. Downloading and running an Ethereum node in the client system offers user to connect other nodes on Blockchain network. Even, Blockchain users can perform operations like mining, performing transactions, and deployment of chain code. Most of the DApps applications will require the web server to run smart contracts using Blockchain network. Hence, it is impossible to manipulate the transactions or smart contracts deployed in the Blockchain network.</p><p>The E-voting protocol is defined l through smart contracts, which consists programming code and stored on a Blockchain network, then it execute when certain terms and conditions are met. It is called smart because of its ability to verify and execute a contract without any help from third parties. The contract exists in the decentralized Blockchain network and contains all the terms of a particular agreement. The smart contracts are meant to provide accuracy, transparency, autonomy, security and standardization.</p><p><strong>Proposed work</strong></p><p>The proposed E-voting protocol is implemented using Ethereum platform called public Blockchain network. An Ethereum network provides a broader range of applications, with the power of smart contracts. The E-voting protocol is defined through smart contracts using solidity programming language and have been compiled using Remix IDE. Finally, compiled contracts have been deployed into decentralized Blockchain network using Ethereum MetaMask to ensure privacy, confidentiality and integrity services.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/503/1*3QjyyHKu1O4dWRNNI6OhhQ.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/558/1*PF9EWUXosFeSHT7ubhkQ4w.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/532/1*QPfeO000OI52g5_oj9mVlQ.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/508/1*rZvDWQCCHwE_XP-yaYpzAA.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/505/1*zCLSIrx4Y0qbPNk0pFQaGg.png" /><figcaption><strong>Blockchain E-Voting System Framework</strong></figcaption></figure><p><strong>Conclusion</strong></p><p>A Blockchain based decentralized and peer-to-peer electronic voting protocol is proposed. The legitimate voters could have the power to vote through Internet by using smart devices like Mobiles, PCs, etc. The transaction will be recorded in the Blockchain network, which is verifiable, anonymous and adversaries are unable to modify the records in the network. The solidity smart contract is used to accomplish recording, managing, validating the voters during the electoral process. In order to provide the privacy and transparency of E-Voting protocol, secure cryptographic functions have been employed to ensure that the registration and voting is anonymous. The digital signatures using public key infrastructure makes the voting process more secure and reliable.</p><p><strong>Other Links</strong></p><p><strong>Github Repository: </strong><a href="https://github.com/Indushreervce/Blockchain-Based-E-Voting">https://github.com/Indushreervce/Blockchain-Based-E-Voting</a></p><p><strong>LinkedIn URL</strong> — <a href="https://www.linkedin.com/posts/indushree-m-50b016119_blockchain-ethereum-voting-activity-6722150986674262016-bA2S">https://www.linkedin.com/posts/indushree-m-50b016119_blockchain-ethereum-voting-activity-6722150986674262016-bA2S</a></p><p><strong>E-Voting Framework Using Blockchain Technology URL</strong> — <a href="https://medium.com/@indushree.june1/a-decentralized-and-secure-e-voting-framework-using-blockchain-technology-778db80244a0">https://medium.com/@indushree.june1/a-decentralized-and-secure-e-voting-framework-using-blockchain-technology-778db80244a0</a></p><p>As Advised and Mentored by</p><p>Dr. Suneet Gupta</p><p>CSE Department</p><p>Bennett University</p><p>#Decentralized #Blockchain #Ethereum #Voting #DAPP #CSE BENNETT</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=778db80244a0" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[SELF-ADJUSTING DATA STRUCTURES]]></title>
            <link>https://medium.com/self-adjusting-data-structures/self-adjusting-data-structures-d69684e3088b?source=rss-db91da9fa0b------2</link>
            <guid isPermaLink="false">https://medium.com/p/d69684e3088b</guid>
            <dc:creator><![CDATA[Indushree M]]></dc:creator>
            <pubDate>Sat, 26 Sep 2020 07:13:48 GMT</pubDate>
            <atom:updated>2020-09-26T07:13:48.454Z</atom:updated>
            <content:encoded><![CDATA[<p>Self-adjusting data structures that adjust itself using information collect preferably from previous distribution queries likewise all of these data structures are well structured in an amortized manner. In addition, an individual operation might requires a maximum amount of time, but over a sequence of many operations the average time per operation is very small.</p><p>· A splay<em>-</em>tree is a self-adjusting binary search tree with the additional properties. It performs some operations like insertion, removal<em> and </em>look up. In addition, splay trees achieve better search than other search trees, even when some pattern of the sequences are unknown.</p><p>· Splaying the tree for a specific element rearranges the tree so that the element is placed at the root of the tree.</p><p>· Operations on a binary search tree are all normal and combined with one basic operation known as splaying.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/482/1*O33zqaThRjcgsd0Lz6R2BA.png" /><figcaption>Splaying in self-adjusting data structures.</figcaption></figure><p>The operations that can be performed on self-adjusting trees are as follows:</p><p><strong>a. Splaying Operation:</strong> When the node n is accessed, a splay operation is performed on n to move it to a root. In order to carry out the splay operation which requires a sequence of steps:</p><p>1. Whether n is a right or left child of the parent p,</p><p>2. Whether p is a root or not, and if not</p><p>3. Whether p is a right or left child of the parent q</p><p><strong>b. Join Operation:</strong> Given 2 trees P and Q such that all elements of S are smaller than the elements of Q. The subsequent steps will be used to join to the single tree:</p><p>1. Splay a largest element in S. Now this element is in a root of S, which has the null right child.</p><p>2. Set a right child of a new root to T.</p><p><strong>c. Split Operation</strong>: Given the tree and the item m, return two new trees: one containing all items less than or equal to <strong>M</strong> and the other containing all items greater than M.</p><p>Splay M. Now it is in the root so the tree to its left contains all elements smaller than <strong>M</strong> and the tree. It can be done by using the following properties:</p><p>1. Splay <strong>M</strong></p><p>2. Split a right subtree from a rest of the tree.</p><p><strong>d. Insertion</strong>: To insert the value <strong>M</strong> to the splay tree:</p><p>1. Insert M as with BST.</p><p>2. when the element is inserted, the splay operation is performed.</p><p>3. Therefore, the newly inserted node M becomes the root of a tree.</p><p><strong>f. Deletion</strong>: To delete the node M, use same method as with BST:</p><p>If M has two children, swap the value with that of either a right-most node of its right sub-tree or a rightmost node of its left sub-tree. Finally, remove that node instead.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/338/1*KiczuVOhP4_hqGYbC3uDNQ.png" /></figure><p>·<strong>Advantages</strong></p><p>· Self-organizing data structures is that they can often perform “natural” sequences of accesses much faster than their worst-case counterparts.</p><p>· Examples: accessing each of the elements in order using a stack or queue and performing many operations on the items.</p><p>· Creating a persistent data structure version of splay trees is a possible and which allows accessing both the previous and new versions after an update. It will very useful in the functional programming.</p><p>· Working with the nodes containing identical keys contrary to other types of self-balancing trees.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=d69684e3088b" width="1" height="1" alt=""><hr><p><a href="https://medium.com/self-adjusting-data-structures/self-adjusting-data-structures-d69684e3088b">SELF-ADJUSTING DATA STRUCTURES</a> was originally published in <a href="https://medium.com/self-adjusting-data-structures">SELF-ADJUSTING DATA STRUCTURES</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
    </channel>
</rss>