លំហសិក្សាកម្ពុជា លំហសិក្សាកម្ពុជា V1.0
ចូល ចុះឈ្មោះ

A brief definition of blockchain technology and the role in cryptography

មូលសង្ខេប / Abstract

This reference guide breaks down the twelve core cryptographic principles that keep blockchain networks secure and tamper-proof. For each key term—ranging from hash functions and public/private key pairs to Merkle trees and Proof-of-Work—this document provides a clear definition, explains its specific role in blockchain, and illustrates its real-world application.

ពាក្យគន្លឹះ
1. Hash Functions

  • Definition: A mathematical algorithm that converts an input of any size (like a word or a large file) into a fixed-length string of characters (a hash output).

  • Role in Blockchain/Cryptography: It creates unique digital "fingerprints" for data blocks, making it quick and easy to verify data integrity without revealing the actual contents.

  • Example Application: SHA-256 is used in Bitcoin to generate unique hash codes for transactions and block headers.

2. Deterministic Property


  • Definition: A feature of a function where a given input will always produce the exact same output every single time it is processed.

  • Role in Blockchain/Cryptography: Ensures consistency across all distributed nodes in a network so every computer independently arrives at the exact same hash output when verifying data.

  • Example Application: Hashing the word "Hello" using SHA-256 will always output 185f8db32271fe25f561a6fc938b2e264306ec304eda518007d1764826381969, no matter who calculates it or when.

3. Collision Resistance


  • Definition: A property of cryptographic hash functions that makes it computationally impossible to find two different inputs that produce the exact same hash output.

  • Role in Blockchain/Cryptography: Prevents malicious actors from forging or replacing legitimate data with fake data that generates a matching hash value.

  • Example Application: Ensuring an attacker cannot create a fraudulent contract that produces the same hash value as a legitimate contract signed by a user.

4. Public Key Cryptography


  • Definition: An asymmetric encryption system that uses a pair of mathematically linked keys: a public key (shareable) and a private key (secret).

  • Role in Blockchain/Cryptography: Allows users to receive funds or data securely using their public address without revealing their secret private key.

  • Example Application: Your wallet address on Ethereum (e.g., 0x123...) is derived from your public key, allowing anyone to send you tokens safely.

5. Private Key


  • Definition: A secret, randomly generated cryptographic key kept known only to its owner, used to decrypt messages or digitally sign transactions.

  • Role in Blockchain/Cryptography: Serves as the ultimate proof of ownership over funds or digital assets, granting full access to authorize transactions.

  • Example Application: Signing a transaction in a Crypto Wallet (like MetaMask) using your private key to approve sending Bitcoin or Ethereum to someone else.

6. Digital Signatures


  • Definition: A mathematical mechanism that combines a user's private key with transaction data to produce a unique signature that proves authenticity and non-repudiation.

  • Role in Blockchain/Cryptography: Confirms that a transaction was created by the true owner of the wallet and guarantees that the transaction data was not altered after signing.

  • Example Application: Signing a smart contract interaction so the network can verify you approved the execution without exposing your private key.

7. Merkle Tree


  • Definition: A hierarchical tree data structure in which every leaf node is labeled with a data hash, and every non-leaf node is labeled with the hash of its child nodes.

  • Role in Blockchain/Cryptography: Enables fast and secure verification of large volumes of transactions within a block using minimal computational memory (via a single Merkle Root).

  • Example Application: Bitcoin nodes use Merkle Trees to quickly verify if a specific transaction is included in a block without downloading the entire block data.

8. Immutability


  • Definition: The quality of being permanent, unchangeable, and unable to be modified or deleted once created.

  • Role in Blockchain/Cryptography: Ensures that historical transaction records cannot be modified retroactively without breaking all subsequent block links across the network.

  • Example Application: Storing land titles or birth certificates on a blockchain so that ownership histories can never be secretly altered or wiped clean.

9. Proof-of-Work (PoW)


  • Definition: A consensus protocol requiring network nodes (miners) to expend computational power solving complex mathematical puzzles to validate transactions and add new blocks.

  • Role in Blockchain/Cryptography: Secures the network against spam, double spending, and unauthorized changes by making block creation costly in terms of energy and hardware time.

  • Example Application: Bitcoin mining, where miners compute trillions of hash functions per second to find a hash output that meets the network's difficulty target.

10. Tamper Detection


  • Definition: The automated process of identifying unauthorized modifications or alterations in data or code.

  • Role in Blockchain/Cryptography: Because each block contains the hash of the previous block, modifying any past transaction immediately alters its hash, breaking the entire chain downstream and alerting all nodes.

  • Example Application: If a hacker changes a transaction amount from $10 to $10,000 in block #500, every node immediately rejects the modified chain because block #501's header hash no longer matches.

11. 51% Attack


  • Definition: A threat scenario where a single entity or group controls more than 50% of a blockchain network's mining power (hash rate) or staking power.

  • Role in Blockchain/Cryptography: Illustrates a central vulnerability where dominant control allows malicious actors to rewrite recent block history, block user transactions, or double-spend tokens.

  • Example Application: Successful 51% attacks carried out on smaller proof-of-work networks like Ethereum Classic (ETC) in past years, allowing attackers to reverse their own completed transactions.

12. Double Spending


  • Definition: A potential flaw in digital cash schemes where the exact same digital token or currency is spent more than once.

  • Role in Blockchain/Cryptography: Solved by blockchain networks using timestamped blocks and consensus mechanisms (PoW/PoS) to ensure once a token is spent, it cannot be reused.

  • Example Application: Preventing a user from paying $50 to Merchant A and simultaneously sending that exact same $50 token to Merchant B.
ចែករំលែក
រក្សាទុក
ការផ្សព្វផ្សាយ
ការផ្សព្វផ្សាយ
មតិយោបល់ 0
ចូលគណនី ដើម្បីបញ្ចេញមតិ