NETDEX FOUNDATION
  • Introduction
  • Blockchain Challenges
    • Scale, Finalization, and Consensus
    • Decentralization vs. Functional Confirmation Times
    • Fees
    • Accessibility
    • Tokenomics
    • Reputation
  • NetDex Solutions
    • A Robust Blockchain Protocol
      • Scalability
      • Compatibility
      • Permissionless Decentralization
      • Leaderless Proof of Stake
      • Cryptography
    • Battle-Tested Security
      • Proof of Stake Security
      • Protection Against Sybil Attack
      • Protection from a Parasite Chain Attack
      • Protection Against Denial of Service Attack
      • Quantum Secure
    • Engaged Communities
      • Building Reputation
      • Engaged Tech-Literate Community
      • Engaged Wider Community
    • Resilient Economics
      • Bootstrapping
      • Deflation
      • Digital Asset Growth
  • Technical Overview
    • Netdex Chain and the Directed Acyclic Graph
    • The Lachesis Consensus Algorithm
    • Validator Node Minimum Requirements
  • Products
    • DEX
    • NFT Marketplace
    • LaunchPad
    • NetDex Metaverse
    • Cross-Chain Bridges
    • Yield Optimizers
    • Lending-Borrowing Portal
  • TOKENOMICS
    • Tokenomics
  • NETDEX
    • đź§°Privacy Policy
    • âś…Terms of Service
    • 📸Social Media
    • 📨Bug Bounty
  • More
    • 🔍Market Status
      • DeFi Market Overview
      • NFT Market Overview
Powered by GitBook
On this page
  1. NetDex Solutions
  2. Battle-Tested Security

Protection Against Sybil Attack

In the blockchain context, a Sybil attack is one in which an attacker subverts a system by creating myriad identities to run nodes, and applies them to gain a disproportionately large influence over the network. Alternatively, the attacker may run one node but attempt to operate that under multiple identities.

Blockchains such as Bitcoin's PoW are theoretically vulnerable to the variant of a Sybil attack, a 51% attack aka Double Spending. Such blockchains’ susceptibility to attack is proportional to the hashing power. Any agent that can hold 51% of the hashing power of the network, can overcome the security of that network. However, Blockchains such as Bitcoin are essentially protected from attack, because, to be economically viable, the market cap of the currency must be both sufficiently valuable to justify the cost of obtaining that hashing power, and affordable to the attacker.

In a double-spend attack, a malicious actor attempts to spend their funds twice. Say Bob has 10 tokens and attempts to send 5 tokens to Alice and 6 tokens to Jill. While Bob → Alice and Bob → Jill are both valid transactions initially, this validity depends upon the status of the other transaction. It might be that both of these transactions of equal nonce both succeed in being entered as events – which is unlikely due to internal procedures – however, both transactions can not be confirmed thanks to the aBFT consensus algorithm.

aBFT determines the event’s order, which is equal on all the nodes unless more than 1/3rd of nodes are malicious. First, the order of events is determined, and only then are the transactions executed. This means that there must be an agreement that Bob sent tokens to Alice first or to Jill first. Whichever the agreement falls upon, let’s say the 5 tokens sent to Alice for this example, this event will undergo a successful transaction.

The Bob → Jill transaction attempt will be rejected because its nonce was already "occupied" by the Bob → Alice transaction. Agreement on timing is everything.

PreviousProof of Stake SecurityNextProtection from a Parasite Chain Attack

Last updated 11 months ago