<?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 N Praveen Chandhar on Medium]]></title>
        <description><![CDATA[Stories by N Praveen Chandhar on Medium]]></description>
        <link>https://medium.com/@neevarp.star?source=rss-b4d8ec2b3bfc------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/2*Z0D40-vLqGmHtHScmCMc7w.jpeg</url>
            <title>Stories by N Praveen Chandhar on Medium</title>
            <link>https://medium.com/@neevarp.star?source=rss-b4d8ec2b3bfc------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Tue, 17 Nov 2026 00:40:42 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@neevarp.star/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[Blockchain — Demystified: Why is it the buzzword?]]></title>
            <link>https://medium.com/spidernitt/blockchain-demystified-why-is-it-the-buzzword-29e2fcebc7da?source=rss-b4d8ec2b3bfc------2</link>
            <guid isPermaLink="false">https://medium.com/p/29e2fcebc7da</guid>
            <category><![CDATA[spiders]]></category>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[tutorial]]></category>
            <category><![CDATA[cryptocurrency]]></category>
            <category><![CDATA[getting-started]]></category>
            <dc:creator><![CDATA[N Praveen Chandhar]]></dc:creator>
            <pubDate>Wed, 08 Jul 2020 11:42:32 GMT</pubDate>
            <atom:updated>2020-07-15T18:51:20.407Z</atom:updated>
            <content:encoded><![CDATA[<h3>Blockchain — Demystified: Why is it the buzzword?</h3><p>Every person would have heard about Blockchain at some point in their lives. Many hesitate to go further about it because of its apparently steep learning curve and the general mysticism shrouding it. It is actually pretty simple to learn the concepts as they are basically rooted on the problems faced by existing financial systems. However, blockchain has taken an interesting turn in this past 5 years. Let&#39;s look at all things Blockchain in this article!</p><p>“There are tons of articles about Blockchain! Why another one?”, you may ask. Existing ones are too high a level or too diluted. Personally, almost all of the articles I have read raise more questions than give answers. This article is the beginning of a big series that attempts to give answers to those questions that might arise for beginners who are getting started with blockchain and fill the knowledge gap.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*HKtkZuIw5LH5NY8O" /><figcaption>Photo by <a href="https://unsplash.com/@hiteshchoudhary?utm_source=medium&amp;utm_medium=referral">Hitesh Choudhary</a> on <a href="https://unsplash.com/?utm_source=medium&amp;utm_medium=referral">Unsplash</a></figcaption></figure><h3>What is Blockchain?</h3><p>I do not want to throw all kinds of jargon at you since I know how much intimidated I felt when I read my first article on Blockchain. Treat the rest of the article (and the series) as a book and grab a cup of coffee :)</p><p>The first conceivable idea of Blockchain was put forth only a mere 10 years ago, by a person who goes by the name <a href="https://en.wikipedia.org/wiki/Satoshi_Nakamoto">Satoshi Nakamoto</a> (No one really knows the actual name. Let&#39;s call this person ‘X’ for the time being).<a href="https://bitcoin.org/bitcoin.pdf"> X proposed an electronic form of currency</a> that can serve as an alternative for the existing fiat currency while still having some real value and as a follow-up, proposed a secure data structure that can store the transaction history and other information. Existing database systems fail easily because these rely on trusting personnel for security. Since the currency itself is digital, one cannot ‘trust’ trust. <strong>Blockchain</strong> is the data structure that X proposed that can solve this problem, without having the need to trust someone else for the maintenance. As the name suggests, it consists of a sequence (chain) of entities called blocks, which hold some details regarding the transaction. This is the very basic idea behind Blockchain. It has evolved since then.</p><blockquote>The blockchain data structure is implemented in such a way that humans need not trust anyone else when it comes to their transactions.</blockquote><p>The Blockchain, in the most general sense, is like a singly linked list. It consists of a sequence of blocks, each having pointers to the previous one.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/899/1*txx8n6Kf2ZaKSEihTqFfvA.png" /><figcaption>The basic structure. Do not worry if it does not make sense for now. Note how it follows a linked list pattern of having a pointer to a previous block. Image source: <a href="https://www.spheregen.com/blockchain-technology-basics/">spheregen</a></figcaption></figure><p>Before we discuss the problem it solves and how it addresses the serious trust issues we humans have (:D), let us take a look at some of the cryptographic math that powers the blockchain, its architecture and the implementation specifics so that when we actually discuss the problem it solves, we can understand it better.</p><h3><strong>BLOCKCHAIN LINGO 101</strong></h3><p>This subsection covers basic concepts about Hashing and Digital signatures. These are essential to understand how blockchains work. Feel free to skip ahead if you already know them.</p><h4><strong>HASHING</strong></h4><p>We have heard of functions, right? From our high school (If you are in high school when reading this article, congratulations on knowing about this tech so early), we know that functions are mappings that take in one value as input, does some processing and maps the input to a specific output.<strong> A hash function is a function that produces a unique output for every unique input. </strong>This property of the hash function is used in a variety of ways. For example, by mapping input to a reduced size output, image compression (with loss of data) is achieved.</p><p>Hashing has also found its way into cryptography. In cryptographic hashing, input of any size is converted into output of a fixed size. <strong>The defining property is that given the output, it is impossible to determine the input owing to random parameters used in the algorithm.</strong> There are a family of algorithms used for cryptographic hashing like MD5, SHA etc. The hash functions themselves can be complex to understand. However, all you need to know (at this point) is that the most secure hash family is SHA-3. It has various algorithms called SHA3–256, SHA3–512 etc where 256 and 512 represent the number of bits in the output. The Blockchain uses Keccak family hashing, which is a superset of SHA-3. The hash information inside a block is basically a hash of some important data.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/300/1*Y1yWdlBGqEQS0J8nPbZHLw.png" /><figcaption>Notice how a small change in input can produce a totally different output. Source: <a href="https://en.wikipedia.org/wiki/Avalanche_effect">Wikipedia</a></figcaption></figure><blockquote>It is <a href="https://en.wikipedia.org/wiki/Collision_(computer_science)">generally impossible</a> to determine the input to a cryptographic hash function from the output because the algorithm cannot be reverse engineered.</blockquote><h4>ASYMMETRIC KEY ENCRYPTION AND DIGITAL SIGNATURES</h4><p>Encryption and decryption are some of the common terms that you hear coming from a cryptographic background. Encryption is the process of converting the plain message to some gibberish <em>using a key</em> <em>K1</em> and decryption is the process of converting the gibberish back to plain text <em>using another key K2</em>. If K1 and K2 are same, its symmetric key encryption, while if they are not same, its asymmetric key encryption.</p><p>In asymmetric key encryption, the key that is used to encrypt is transmitted to everyone who wants to communicate and is therefore called as a public key. The key that is used to decrypt is called the private key and is kept private so that only you can actually decrypt the message and check its contents. This makes sure that snoopers, even though get access to your message, cannot decrypt it.</p><blockquote>Never transmit your private key in any channel</blockquote><figure><img alt="" src="https://cdn-images-1.medium.com/max/450/1*zfj704P2gDJc4SxRmPwCVw.gif" /><figcaption>Different keys are used. Source: <a href="https://www.ssl2buy.com/wiki/what-is-encryption-and-decryption">ssl2buy</a></figcaption></figure><p>Why are we talking about it? Well, these concepts are used in enforcing digital signatures. In the context of blockchain, digital signatures are used to verify that is it actually you whose initiating a transaction. Let us see in brief how it works and why is it foolproof.</p><p>Suppose you claim that you paid 25 bucks to Bob, then you will have to construct data in such a way that any person at any corner of the world (with your public key) can verify that it was actually you who paid 25 bucks. Moreover, middlemen should not be able to modify any part of the data and get away with it. In a nutshell, the hashed version of the document is encrypted with the sender’s private key and sent along with the document. The receiver decrypts the hash using the sender’s public key and compares both the hashes. If they match, then the document is valid. Since any middleman has no idea of the sender’s private key, they cannot forge a document and encrypt. If they hash in some other way, the final hashes won&#39;t match. Therefore, this technique can be used to verify the person whose initiating a transaction. In fact, this technique is already being used by banks to verify transactions. Note that public key is used for verification here since anyone must be able to verify. For more brevity on the topic, I suggest you take a look at this <a href="https://www.youtube.com/watch?v=704dudhA7UI">video</a></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/735/1*LNzoE9Z1ocB4e2DQNvw_pA.png" /><figcaption>The original data and the hashed data is sent so that the recipient verify. Source: <a href="https://www.geeksforgeeks.org/digital-signatures-certificates/">GeeksForGeeks</a></figcaption></figure><h3>ARCHITECTURE BASICS</h3><p>This is where the fun begins. A blockchain can be used in a lot of ways. Let us explore the very first-way blockchain was used in.</p><p>Let us assume we have our own electronic currency and want to transact with a set of people in a network. Let us call our currency MahiCoin. (This article was published a day after MSD’s birthday :D) Assume that MahiCoins can be exchanged with real currency. This makes preventing false transactions in the chain extremely important. The Blockchain protocol comes with a set of rules on how this can be prevented and who keeps the chain going.</p><p>This chain can also be called as a ‘ledger’ since it holds transaction data only. Assume there are three people — Alice, Bob and Charles each of whom has 100 MahiCoins. Since the ledger is a singly linked list, the first-ever block does not have a predecessor and usually contains information on the starting amount of each person. This block, the first block in the chain, is called a <strong>genesis block</strong>.</p><p>Since all the members are in the same system, they are connected with each other and they form a <strong>peer-to-peer </strong>network. This is a necessary property in a blockchain. In a peer-to-peer network, every node (the computer that the person uses) is connected with every other node and therefore can transact without the need of any middleman. Every node will have the public key of every other node so that transactions can be sent or verified. Further, <em>every node has a copy of the ledger in its local system.</em></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/520/1*s3PCrf1fG-XvlByHYUKq9w.gif" /><figcaption>Peer-to-peer networks. Every node has a copy of the entire chain. Source: <a href="https://thumbs.gfycat.com/ZealousCavernousChihuahua-max-1mb.gif">gyfcat</a></figcaption></figure><blockquote>Blockchain networks are <strong>peer to peer networks.</strong></blockquote><p>Coming back to our example, if Alice wants to send 10 MahiCoins to Bob, Alice will digitally sign the transaction and send the transaction to Bob and Charles as well (basically every other node) on the network. Other nodes will add the block to its local copy of the chain after verifying the digital signature. This gives every node the power to accept(or reject) a transaction, making the entire network decentralized.</p><blockquote>Blockchain networks are<strong> decentralized</strong>. There is no single authority of power.</blockquote><p>Assuming there are no errors and no malicious intentions from Alice, Bob and Charles will add a block to their chain with the transaction details (The transaction that removes 10 MahiCoins from Alice and deposits them to Bob).</p><h4>WHAT DOES THE BLOCK ACTUALLY CONTAIN?</h4><p>The block should necessarily contain the hash of the previous block, the data (sender, receiver and the amount to transfer) and the hash of all the contents. The data should be digitally signed.</p><h4>THE SYSTEM LOOKS INHERENTLY FLAWED!!!</h4><p>At the surface level, one can easily find out a hundred reasons on how to fool the system. For example, since no one is really interested in knowing from where the digitally signed transaction is coming from, Charles can add a block to his own copy of the chain stating Bob has transferred 50 MahiCoins to Alice and transmit the data. (This is impossible since Charles cannot sign the transaction, but for the sake of argument assume he can). Further, what if Charles sends a transaction stating he transferred 500 MahiCoins to Bob but has only 100 MahiCoins in his account? Since the transaction is digitally signed, every node will assume it is valid and all the nodes will think that Bob has 600 MahiCoins!!! This is where mutual agreement protocols come in.</p><h4>MUTUAL AGREEMENT — JUST BECAUSE YOU ALONE THINK ITS RIGHT, IT ISN&#39;T</h4><p>Mutual agreement protocols are an essential part of a blockchain since they determine whether the block actually gets added to the chain. (By protocol, I just mean a set of rules and regulations). At every node, after receiving a transaction and before adding it to the local copy of the chain, the transaction is <strong><em>validated</em></strong>. In a validation process, after verifying the digital signature, every node will go through its local copy of the chain and verify whether the transaction is actually valid. That is, whether the sender has enough balance <em>(according to it). </em>After verifying, it transmits a “yes/no” value to all other nodes, with “yes” being the transaction is valid. If majority of the nodes agree, only then the block is added to the chain. As you can see, the entire structure is based on democracy. This is the fundamental criteria for block addition.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/360/1*GqE1FcD0wNFaZpP2K72ddw.gif" /><figcaption>Validation in a peer-to-peer network. Source: <a href="https://thumbs.gfycat.com/DismalContentHare-max-1mb.gif">gyfcat</a></figcaption></figure><p>In some cases, this process can get computationally expensive as hash computations are involved for block addition and is outsourced to a set of nodes called <strong>miners. </strong>This solves a lot of interesting problems, but more on that, we shall discuss in the upcoming article.</p><blockquote>Every transaction is validated before adding to the chain</blockquote><h4>THE LONGEST CHAIN PROPERTY</h4><p>There is another problem. If Alice adds a block on her own and Bob does the same for his chain, which chain is considered final?</p><p>Their local chains will start having different lengths. Since they transmit their transaction to every other node, some nodes can accept or reject the transaction. Thereby, the other nodes will start having varying lengths or branch out into a separate chain based on timestamp information. To solve this problem<strong>, The node that has the longest chain is assumed to be correct.</strong> Every other node synchronizes that chain with its local chain. This longest chain notion is based on the fact that false transactions are rejected by more than half of the nodes.</p><blockquote>Only the longest chain is considered final chain.</blockquote><h4><strong>SUMMARIZING</strong></h4><p>A blockchain is basically characterized by the following:</p><p>a) <strong>The data of a block</strong>. Note that in our example, we trivialized the data. In practice, a single block may contain thousands of transactions.</p><p>b) <a href="https://dragonchain.com/blog/differences-between-public-private-blockchains/"><strong>The type of blockchain</strong></a>. In some variant of blockchains, a miner may not be compulsory because not much computation might be involved. (The purpose it solves might be different than our use case- Eg. Ethereum). Also, in some blockchains, access is restricted. That is, not all nodes might have access to transact. (Eg. Hyperledger)</p><p>c) <strong>The consensus protocol</strong> used to select which node is going to mine and validate the incoming data. (Eg. Proof-of-work, proof-of-stake, etc) — More on that in the upcoming article.</p><p>d) <strong>The cryptocurrency</strong>, and its conversion to real money. In our case, MahiCoins ❤.</p><p>e) <strong>The timestamp information. </strong>In any chain, all the blocks are arranged in the timestamp order.</p><p>A blockchain has the following properties:</p><p>a) <strong>Peer to peer</strong>: Every node has the address and the public key of every other node. This eliminates the need for any third party completely.</p><p>b) <strong>Decentralized</strong>: The entire decision-making power is distributed equally among the nodes. A single node cannot decide on behalf of all nodes.</p><p>c) <strong>Immutable.</strong> This is a consequence of hashing. Changing some data in the middle alters the hash of the data completely. Since it follows a singly linked list principle, this altered hash is a predecessor of some other block and therefore, that block’s previous hash pointer has to be changed, which results in changing the hash of that block and so on. This change further propagates and by virtue of the longest chain protocol, no other node will agree to the changes :)</p><h4>IT IS NOT ALL ROSES</h4><p>Blockchains are computationally intensive to sustain and thereby time intensive as well. This may not suit for all kinds of applications, especially time-critical ones. Care must be taken to decide where exactly this tech should be used.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*WjhEjpEhsxSKejpv" /><figcaption>Blockchain tech comes with its own disadvantages as well. Whether the pros outweigh the cons depends on your application. Photo by <a href="https://unsplash.com/@tom32i?utm_source=medium&amp;utm_medium=referral">Thomas Jarrand</a> on <a href="https://unsplash.com/?utm_source=medium&amp;utm_medium=referral">Unsplash</a></figcaption></figure><h4>This gets us to the last part of this article. Why.</h4><p>Can’t I use normal currency? Why undergo this entire process?</p><p>You can keep using fiat. However, there are some problems with the existing financial system.</p><p><strong>Middlemen</strong>: When you initiate any transaction, you communicate with a bank, which is a trusted third party. The third-party charges a “service-charge” (duh). However, with blockchain, you can directly communicate with the person you intend to transact with, without any service charge.</p><p><strong>Centralization: </strong>Existing financial systems are centralized. A centralized database holds all key information in one place and can be easily modified. To put into perspective how critical this is, bribing the right people, a person can modify any data that you have shared with the government. With blockchain, all of that is prevented since the system is immutable and everyone has the power to potentially restrict transactions.</p><p><strong>Opacity:</strong> No one really knows what data a system collects internally. Unfortunately, we become aware only when a massive scam is put to light. With blockchain, everything is transparent. Every node has a local copy of the chain and therefore can look at all the data.</p><p>All these promising features are indeed convincing enough. Blockchain has found its way into every field of technology. This disruptive tech has revolutionized various industries — from health care to gaming. This era of decentralized web is even regarded as the Web 3.0. (Web 1 being static HTML pages and Web 2 being able to render dynamic content)</p><h4>CONCLUSION</h4><p>This is just a broad overview of the Blockchain technology that has revolutionized the way we think. I hope the reader gets a better idea of blockchain after reading this. I also hope your cup of coffee is finished, by now (xD). The objective of the series is to enable people to see blockchain as a potential option and develop on the same.</p><p>Since this is an emerging technology, I personally believe more and more innovations will come from startups and people like us and not from well-established companies. The need of the hour is to set up blockchain scaling platforms that allow users to innovate on top of the platform. Companies like <a href="https://matic.network/about/">Matic</a> are performing a wonderful job of it.</p><p>We have come a long way, from the world’s first cryptocurrency (called BitCoin, invented by the same X we discussed at the start of the article), to the<a href="https://www.deccanherald.com/specials/ces-2020-bob-worlds-first-blockchain-phone-unveiled-792190.html"> world’s first Blockchain-Powered phone</a>, but there is still a long way to go.</p><p>Stay tuned for other articles in this series, In the next article, we will talk about how you can go ahead and implement your own cryptocurrency!</p><p>Happy coding!</p><h4>REFERENCES</h4><p><a href="https://101blockchains.com/blockchain-for-beginners/">Blockchain for beginners — 101bockchains.com</a> — A neat explanation on the blockchain intrinsics</p><p><a href="https://www.tradefinanceglobal.com/blockchain/history-of-blockchain/">History of blockchain — tradefinanceglobal.com</a> — Takes us through the first steps of blockchain along with its market value</p><p><a href="https://www.youtube.com/watch?v=bBC-nXj3Ng4">3Blue1Brown — How does BitCoin Actually work</a> — A Youtube video that beautifully illustrates the working of Bitcoin.</p><p>Read the next article on the series — <a href="https://medium.com/spidernitt/blockchain-demystified-creating-your-own-cryptocurrency-1afe72e7ab8f">Blockchain — Demystified: Creating Your Own Cryptocurrency</a>!</p><p><em>This article is published as a part of the ‘</em><strong><em>Blockchain Series’</em></strong><em> under </em><a href="https://medium.com/spidernitt"><em>Spider Research and Development Club, NIT Trichy</em></a><em> on a Web Wednesday!</em></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=29e2fcebc7da" width="1" height="1" alt=""><hr><p><a href="https://medium.com/spidernitt/blockchain-demystified-why-is-it-the-buzzword-29e2fcebc7da">Blockchain — Demystified: Why is it the buzzword?</a> was originally published in <a href="https://medium.com/spidernitt">Spider R&amp;D</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Denial of Service — If you can’t , no one else should]]></title>
            <link>https://medium.com/spidernitt/denial-of-service-if-you-cant-no-one-else-should-589a17203e57?source=rss-b4d8ec2b3bfc------2</link>
            <guid isPermaLink="false">https://medium.com/p/589a17203e57</guid>
            <category><![CDATA[hacker-series]]></category>
            <category><![CDATA[network]]></category>
            <category><![CDATA[do]]></category>
            <category><![CDATA[cyberattack]]></category>
            <category><![CDATA[spiders]]></category>
            <dc:creator><![CDATA[N Praveen Chandhar]]></dc:creator>
            <pubDate>Wed, 13 May 2020 14:27:36 GMT</pubDate>
            <atom:updated>2020-05-13T14:27:36.903Z</atom:updated>
            <content:encoded><![CDATA[<h3>Denial of Service — If you can’t, no one else should!</h3><p>We visit a lot of websites every day for our day to day purposes — be it information or shopping or just fun. For every purpose you have, there exists one website that lets you achieve that purpose. We have come a long way from the first webpage that was created only merely 20 years ago to present-day websites that can even be made mobile responsive.</p><h3><strong>IDEA BEHIND A SERVER</strong></h3><p>This rapid process of developing the technologies that powered us to view documents through the internet was not a simple one. The entire idea revolved around a client-server architecture. A client is an end-user (or software) that requests for a resource (document, images, etc) on the internet, and a server is a software that well, fulfils that request.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/740/1*-rWLz3MNY1AJGcBIhCXVAw.png" /><figcaption>A snapshot of how the world’s first webpage looked (Courtesy: <a href="https://www.cbc.ca/news/technology/1st-website-ever-restored-to-its-1992-glory-1.1350832">CBC</a>)</figcaption></figure><h4><strong>WEB SERVERS AND RESTAURANT SERVERS ARE SIMILAR IN A WAY!</strong></h4><p>Everything on the web is a resource that one can access through the internet. Every unique resource can be identified by <strong>an URL</strong> (Universal Resource Locator) — the link that you see at the top of your browser when you access that resource. A person browsing the internet has various needs and might want to consume various resources. These resources can exist anywhere in the world. The job of a server is to give you that resource when you request for it.<br>Consider this analogy with a restaurant. You enter a restaurant and order something to eat, to a waiter. After some time, you receive your order from your waiter. Comparing this with the client-server architecture, you are the client (Requesting a resource), the waiter is the server (Gives you the resource) and what you ordered is the resource.</p><blockquote>BUT SERVERS HAVE A MEMORY — THEY ARE COMPUTERS AFTER ALL</blockquote><p>A browser is an example of a client that we use to surf the internet. When we request something, the request ultimately finds its destination to a server which determines which resource to serve upon receiving the request. Note that here, requests have an actual form — they are sent via your router in the form of packets and have some data.<br>The servers are computers ultimately. They only have so much memory. The memory constraint on a computer is so important that it affects almost everyone on a wide range of magnitudes. For a gamer, is it the difference between playing GTA Vice City and GTA V. For a data scientist, the ability to run that few extra iterations in the given time can probably be the difference between a failed experiment and a publication! Okay, so coming back, yes, servers have limited memory. So what? Things get interesting when people use this very fact to their advantage (and much to the disadvantage of others)</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/740/1*ba9R_eYyk9Y0zrKh94Kjxg.png" /><figcaption>Sometimes, a few extra Gigabits of RAM can go a long way. (Courtesy:<a href="https://www.gamespot.com/videos/skyrims-ultra-low-graphics-mod-creates-a-bizarre-a/2300-6443905/"> SKYRIM@Gamespot</a>)</figcaption></figure><h3><strong><em>THE BIG PICTURE</em></strong></h3><p>Every request will ultimately trigger some processing on a server, even if the request is without any reasonable payload. (The server has to decide whether the payload is reasonable, that is processing as well). If a person, say, Bob, sends a lot of dummy requests to a server such that the memory of the server is always kept full because of processing, then efforts of any serious user, say Alice, who wants to avail the services of that server will go in vain. The server cannot process Alice’s requests simply because its memory is always full, thanks to Bob. In this context, Bob is said to have performed a Denial of Service Attack on the server. Its called Denial of Service (DOS) because by doing so, the services of the host (server) are denied to other people who need it.</p><blockquote>It is like having a chocolate jar full of empty wrappers. There is no space for actual chocolates.</blockquote><h4><strong>IS IT THAT SIMPLE? CAN I BRING DOWN ANY SERVER?</strong></h4><p>Yes and no. Orchestrating a DOS attack is extremely simple. You just need to write a script to send a ton of requests to a server. The first DOS attack was performed around 46 years ago, in 1974, by a 13-year old kid! We have come a long way from then. Servers now can be configured with an IP address based filter to effectively discard all requests from a particular IP. So if the request load suddenly spikes up from a particular IP, the servers are programmed to reject any request from that IP. (IP addresses are used to uniquely identify a computer in a network). That leaves us with the following question.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*ZHXlBMkfJTF3DsXr" /><figcaption>Photo by <a href="https://unsplash.com/@marcojodoin?utm_source=medium&amp;utm_medium=referral">Marc-Olivier Jodoin</a> on <a href="https://unsplash.com/?utm_source=medium&amp;utm_medium=referral">Unsplash</a></figcaption></figure><h4><strong>WHAT OTHER FORMS OF DOS ARE THERE?</strong></h4><p>It was fairly easy to prevent a Denial Of Service attack. The attackers, unfortunately, evolved.<strong> Distributed Denial of Service</strong> came into the picture. Instead of one person attacking, the script to flood a request to a server is sent to multiple users and all of them send requests at the same time, without a noticeable spike in network activity in each of them. For this kind of attack to be successful, it must be performed at a huge scale — A million people sending two requests at a time, for example, does not raise any suspicions yet the server with two million requests might find it impossible to serve them all.</p><blockquote>There’s a catch. Why would a million people agree to send requests at the same time? They don’t.</blockquote><p>The million people would not even know that they are performing the attack. Some malicious users can, for example, lure you into clicking a link (we get a ton of spam emails every day) which can then download a script into your system and execute it without your notice. This is also one of the reasons not to click spam.<br>The first successful DDOS attack was performed in 1990. It is somewhat tricky to identify and prevent a DDOS attack but it can be prevented nevertheless.</p><blockquote>A naive rule-set to prevent Distributed DOS can be — serve only one request per IP per minute, serve only for authorized users and discard packets that are less than a threshold packet size</blockquote><p>Another interesting type of DOS attack is <strong>Slow Loris</strong> attacks. Unlike D-DOS which relies on physical constraints, Slow Loris attack relies on logical constraints of a request-response life cycle. For any request, the length of the request payload is one of the first parameters that are transmitted to the server so that the server can make appropriate arrangements to handle that payload. In a Slow Loris attack, the request payload “length” is set more than the actual request payload. As a result, the server waits for the entire request to come. Will it wait for an eternity?</p><blockquote>Slow Loris attack relies on logical constraints of a request-response life cycle.</blockquote><p>No. The server closes the request after a set duration (called timeout — Default is 110 seconds). This is where the ingenuity of the attack comes in. The attacker sends a byte of data every 109 seconds. When the server receives a new byte, its timeout counter gets reset! It waits for another 110 seconds, but it will receive a new byte every109 seconds. This can go on forever, keeping a request open for eternity.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*CK5AgRBHFFchngux" /><figcaption>Photo by <a href="https://unsplash.com/@shaka?utm_source=medium&amp;utm_medium=referral">Justin Young</a> on <a href="https://unsplash.com/?utm_source=medium&amp;utm_medium=referral">Unsplash</a></figcaption></figure><p>This gives the attacker the power to keep any number of requests alive with a server. This is a gem of an attack that piqued my interest in DOS in the first place. This type of attack can be prevented as well. There are many other types of DOS attacks (ICMP flooding, Nuke attacks, etc — Ill leave them for you to explore)</p><blockquote><strong>WHY IS IT AN ATTACK? WHO AM I ATTACKING?</strong></blockquote><p>Well, the service downtime caused by DOS attacks can be overwhelming. <a href="https://www.a10networks.com/blog/5-most-famous-ddos-attacks/">Some popular websites have been taken down by DDOS</a>. Imagine a scenario where YouTube is down for a day. For both end-users and the company, this can be pretty frustrating. You are also engaged in “destruction of virtual property” as well and can be legally punished. Although D-DOS attacks can be resolved within a day or two, it sure does cost a lot.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/885/1*qcd_eRcD06POi2-8YybDuQ.jpeg" /><figcaption>The biggest D-DOS attack ever recorded, was performed on GitHub. (Source: <a href="https://www.wired.com/story/github-ddos-memcached/">Wired</a>)</figcaption></figure><h3><strong>LEGAL ISSUES</strong></h3><p>DOS attacks are something that you can perform probably as a prank on your friend or impress someone (at your own risk). It is illegal to perform DDOS on public servers and if performed without prior permission, the attacker will be punished. Section 43 (e), (f) and (g) of The Information Technology Act covers what exactly is punishable and Section 66-f of the same Act covers what kind of punishments you can get. Not surprisingly, lifetime imprisonment is one.</p><blockquote>HOW WORRIED SHOULD I BE?</blockquote><p>If you are one of those people who are about to start a business and in need of servers, make sure to subscribe to compute resources of companies that offer exclusive D-DOS Mitigation. <a href="https://azure.microsoft.com/en-ca/services/ddos-protection/">Azure</a> is a tried and tested example.</p><p>If you are one of those people looking to perform a DOS, I suggest you don’t.</p><h3><strong>SOURCES</strong></h3><p>Those who were patient enough to read through the entire article (or impatient enough to scroll) here are some resources for the curious mind.</p><p><strong>DDOS Attacks history</strong> — <a href="https://security.radware.com/ddos-knowledge-center/ddos-chronicles/ddos-attacks-history/">https://security.radware.com/ddos-knowledge-center/ddos-chronicles/ddos-attacks-history/</a></p><p><strong>Slow Loris Attacks </strong>— <a href="https://www.netscout.com/what-is-ddos/slowloris-attacks">https://www.netscout.com/what-is-ddos/slowloris-attacks</a></p><p><strong>DOS Wiki</strong> — <a href="https://en.wikipedia.org/wiki/Denial-of-service_attack">https://en.wikipedia.org/wiki/Denial-of-service_attack</a></p><h4><strong>Happy Learning!</strong></h4><p><em>This article is published as a part of the </em><strong><em>Hacker Series</em></strong><em> under </em><a href="https://spider.nitt.edu/"><em>Spider Research and Development Club, NIT Trichy</em></a><em> on a Web Wednesday!</em></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=589a17203e57" width="1" height="1" alt=""><hr><p><a href="https://medium.com/spidernitt/denial-of-service-if-you-cant-no-one-else-should-589a17203e57">Denial of Service — If you can’t , no one else should</a> was originally published in <a href="https://medium.com/spidernitt">Spider R&amp;D</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
    </channel>
</rss>