BlockChain Security PPT - Opt
BlockChain Security PPT - Opt
Security Professional™
Certified Blockchain Security Professional™
Certified Blockchain Security Professional™ (CBSP) is a Certification that aims to cover all known aspects of Blockchain
security existing in the Blockchain environment today. CBSP Certification is designed to evaluate the following skills of the
professionals interested in the Certification:
Inform the public that credetailled individuals meet or exceeds the minimum standards.
CENTRALIZED DECENTRALIZED
Nature A technology that records transactions The tools used in virtual exchanges
● Decentralization
● Peer-to-peer (P2P) network
● Security/Immutability
● Open Source
● Trust
● Ease-of-use
● Transparency
● Improved traceability
● Permanent ledger
● Cost reduction
● Node: Any device connected to the network of blockchains is considered as a node. Nodes which completely
implement all blockchain rules (i.e., bitcoin) are called full nodes. Many nodes on the network are lightweight nodes,
rather than full nodes, but full nodes form the network backbone.
● Network: The "peers" are computer systems that are connected to one another over the Internet and form a P2P
network. Files can be shared directly between networked computers, without a central server being required. To put
it another way, each device on a P2P network is both a file server and a client.
Cryptographic hash functions are one of the most important techniques in the field of cryptography and are used to
accomplish many safety goals such as authentication, digital signatures, generation of pseudo numbers, digital
steganography, digital time-stamping, etc.
Example: Bitcoin uses the SHA-256 hash function for verifying transaction integrity.
When an individual sends you bitcoins or some other digital currency, they essentially sign off coin ownership at your
wallet’s address. The private key kept in your wallet must match the public address with which the money is allocated to, in
order to be avail certain coins and access the funds. The balance in your digital wallet will rise if the public and private keys
match, and the balance of the sender will decrease accordingly.
Private and public keys both form the basis for a blockchain network. In cryptographic terms, any authentication
framework needs a public location key and a private access key.
Merkle trees are used for effective data validation in distributed systems. They are fully secure because instead of using
complete files, they use hashes. Hashes are ways to encrypt files that are slightly smaller in size than the real file.
Proof-of-Work (PoW)
Consensus Proof-of-Stake (PoS)
Voting Consensus
Many a times, nodes in the network cannot come to full agreement on the blockchain's potential existence. This case
leads to the forks, which means it leads to a point where the appropriate blockchain is split into two or three separate
chains.
Example:
The SegWit upgrade to the Bitcoin network added a new kind of addresses (Bech32). This did not invalidate the existing
P2SH addresses. However, a full node with an address of type P2SH may do a legitimate transaction with an address of type
Bech32.
Consensus algorithm may be defined as the mechanism through which a Blockchain network reaches consensus.
A decentralized system without a common consensus will fall into pieces in a second.
Consensus assure that the protocol rules are being followed and guarantee that all transactions occur in a trustless way.
● These rules are the set up protocols for validating the legitimacy of new blocks of data before they get added to the
chain.
● The rules apply to all the Blockchain participating nodes, collectively known as the Blockchain’s “network.”
● These rules provide consensus mechanism, which are processes for validating the new blocks of data. The
agreement based on governance structure is written in computer code using algorithms and is implemented on a
particular Blockchain application.
Proof-of-Work(PoW), which uses a scheme of rewards to encourage users to participate in mining by solving computer-
intensive puzzles.
For example: In cryptocurrency, miners invest in massive data centers and computational infrastructure in order to:
● solve these puzzles;
● gain or “mine” rights; and
● earn rewards for their efforts, such as fees.
Proof-of-Stake(PoS), which defines privileges according to the actual known investment of users in the Blockchain program
for the generation of new blocks.
If the users on the Blockchain network differ from the behavior of a publishing user who must stick to the accepted
procedure on the network, the user loses credibility and minimizes the user's reputation, and reduce the probability of
publishing a block.
In this mechanism, the confirmation time is fast, and the block creation rates are dynamic.
The miner did spend a lot of time and resources to solve those
problem.
● A General solves the problem of PoW, generating a block that is transmitted to the network such that it is
distributed to all the Generals.
● Each General verifies and works on solving the next PoW problem after receipt of this block, integrating the previous
solution into it.
● A block is created each time a General solves a PoW problem and the chain begins to expand.
● Since the Generals know essentially how long it takes to resolve a PoW solution, they would know after a certain
amount of time whether enough of the other Generals are still working on the same chain.
For example, if a single user or a group of users have more than 50% of the total hashing power in the Blockchain networks,
then the user or the group of users can exploit the 51% vulnerability. Gathering the mining power under a few mining pools
might lead to this issue. During a 51% attack, the attacker can:
Recently, GHash.io alone dominated 54% of the whole BTC network processing power for a day.
● Double-spending attacks: Attackers use the same coins in this form of attack to issue two or more transactions,
thereby efficiently spending multiple coins than they own. The latest analysis has demonstrated that it is risky to
allow transactions without needing approval from the Blockchain. The more approvals a transaction gets, the less
likely this transaction will be reversed in the future.
● Selfish mining: Miners raise their proportional mining share in the Blockchain in this attack through selectively
withholding mined blocks and then publishing them progressively. Recent studies indicate that a greedy miner
originally equipped with 33 percent mining power will effectively earn 50 percent of the mining power as a result of
these attacks.
When all nodes in the blockchain system are tightly synchronized, double-spending attacks and selfish mining can be
mitigated.
No block reward.
Miners take the transaction fees, that is why PoS system miners
are instead called forgers.
PoS-based networks do not depend on cryptocurrency mining, unlike PoW-based networks. A mechanism known as staking
is used instead.
Solutions have been deployed by a few PoS-based networks that avoid double spending attacks and other potential
security vulnerabilities that could arise as a result of Byzantine failures.
For example, Ethereum 2.0 (Serenity) would have a PoS algorithm named Casper, which allows nodes to achieve consensus
with a two-thirds majority before blocks can be formed.
● Penalties for attackers: For Blockchain attackers, some protocols using Proof-of-Stake include penalties. According
to this protocol, if the network is targeted, a malicious validator will lose all his confidence. Another punishment is in
the form of depletion of the valuation of the involving cryptocurrency, which in essence means loss of the attacker's
net worth.
● Barriers to 51 percent stake: Another safety feature is that buying a 51 percent stake in one go is very hard for a
single entity. Coin demand is bound to drive the price up , making it a very expensive choice.
● Double-spending attacks: Attackers use the same coins in this form of attack to issue two or more transactions,
thereby efficiently spending multiple coins than they own. The latest analysis has demonstrated that it is risky to
allow transactions without needing approval from the Blockchain. The more approvals a transaction gets, the less
likely this transaction will be reversed in the future.
However, selfish mining is not possible in PoS-based Blockchain because there is no reward for the miners in this
Blockchain.
Also, the new PoS Casper protocol impose penalties on malicious actors.
People who have more tokens will influence the network more than people who have very few tokens.
If a witness starts acting strange or stops doing a quality job securing the network, people in the community can remove
their votes, essentially firing the bad actor.
Delegates are elected in a manner similar to witnesses. They administer the Blockchain network. In transaction processing,
they do not play a role but can recommend a change in the size of a block or the rewards to be paid by a witness in
exchange for the validation of a block. When such amendments are suggested by delegates, Blockchain consumers vote on
whether to implement them.
There is no mining mechanism involved here, unlike PoW or PoS. There are different kinds of protocols for PoA based on
how they really operate. Hyperledger and Ripple are PoA-based. PBFT is based on Hyperledger, while ripple uses an
iterative method.
Burned coins are coins that have been sent to an “unspendable” address (also called as eater address), an address that has
no private keys. The number of coins in the address can be viewed by anyone, but they are not accessible.
The cryptocurrency counterparty was launched with Proof-of-Burn in which bitcoins were burned by users to produce a
proportional sum of native currency of the counterparty named XCP.
PoB was also used by the online peer-to-peer marketplace OpenBazaar to enable members to execute Credibility Pledges.
As they have invested resources on it, these pledges reflect a contribution to an identity on the web.
It removes the need for the mining-intensive process and replaces with a randomized timer system for network
participants.
PoET is a major increase in the performance of proof-of-work protocol. It's also an outstanding consensus mechanisms for
approved networks.
For distributed ledger systems, PoET represents another crack in providing Byzantine Fault Tolerance consensus
mechanisms. It is highly efficient and works with SGX itself, which is another novel technology.
The definition of Byzantine Fault Tolerance originated from the Byzantine General Problem that Leslie Lamport, Robert
Shostak and Marshall Please explained in a Microsoft Research paper in 1982.
● Arbitrary Node Failure is the other one. In the event of an arbitrary node malfunction, the node could fail to return a
response or respond to a misleading response intentionally.
Byzantine Fault Tolerance is the way of overcoming these challenges by the cryptocurrency network.
In PBFT, each “General” manages an internal state which is an ongoing information status.
A consensus decision is made based on the total number of decisions submitted by all the Generals.
Nodes are sequentially organized in a PBFT enabled distributed system with one node becoming the main (or the leader
node) and others being referred to as secondary (or the backup nodes).
The aim is that all truthful nodes, using the majority rule, help to find a consensus on the state of the system.
PoW and PoS are mechanisms focused on competition, and DAG is a mechanism geared towards accumulation.
Unique Data-structure via directed acyclic graphs ensures that scalability and TPS are high.
The arrangement of data reflects the mechanism of graphs where each transaction is autonomous.
The output of the current transaction is dependent on its ability to verify two prior transactions.
NXT is the first DAG platform and it was released on November 9, 2015. The most famous networks using the DAG base are
NXT, Tangle and ByteBall.
Any of the organizations mentioned are tied to smart contracts or cryptocurrencies. These are the most popular
implementations of the last decade following the introduction of cryptocurrencies using Blockchain technologies.
2011 2 1 0 2
2012 3 4 0 0
2013 1 8 0 3
2014 5 5 0 3
2015 1 6 0 4
2016 2 7 0 1
2017 2 5 2 3
2018 1 5 0 2
Total 17 41 3 17
Since public keys need to be exchanged but are too large to be quickly recalled, they are kept on digital certificates for safe
transport and exchange.
● Digital signatures: information is digitally signed with the private key of a person and is confirmed with the public
key of the person.
● Encryption: Information is encrypted with the public key of a person and can only be decrypted using the private key
of the person.
● Authentication - Since the unique private key of the individual is used to apply the signature, recipients should be
sure that the individual was the one who actually applied the signature.
● Non-repudiation - Because the person is the only person with access to the private key used to apply the signature,
he/she will not later say that the signature was not applied by him/her.
● Integrity - As the signature is checked, it checks that when the signature was applied, the contents of the text or
letter fit what was there. Even the slightest change to the original document would have the effect of failing this
check.
● Confidentiality - Since the information is encrypted with the public key of a person, it can only be decrypted with the
private key of the person, meaning that only the intended receiver can decrypt and access the contents.
● Integrity - Checking that the contents of the original encrypted message and the current decrypted match was part
of the decryption process, since even the slightest alteration to the original text will allow the decryption process to
Copyright ©fail.
Blockchain Council www.blockchain-council.org 3
Public Key Cryptography
ECC is a strong cryptographic approach and is an alternative technique to RSA. It generates security through the
mathematics of elliptic curves between key pairs for public key encryption.
ECC as well as RSA, is based on private-public key cryptography. However, with smaller key sizes, ECC provides the same
security as RSA offers. It is less computer-intensive because ECC has smaller key sizes, so it is suitable for mobile devices
and networks.
Transactions of different lengths are run through a given hashing algorithm, and all give an output of a fixed length, called
as hash.
Hash size will depend on the hash function used, but the output using a particular hashing algorithm will be of a specific
size.
The modifications that will be reflected in the hash will be enormous even if you make a small change in your input.
The hash function should be capable of quickly returning the output hash. The system just won't be effective if the
mechanism isn't quick enough.
Commonly used hashing algorithms is Bitcoin’s Secure Hashing Algorithm 256, often known as SHA-256.
A process called 'salting' is nowadays used by the cybersecurity industry. For hashing, salting involves applying random data
to a password and then storing the salt value with the hash. This approach makes it more difficult for hackers to use pre-
computing techniques and to break hashed data passwords that they have obtained.
A fixed-size string that looks nothing like the original is then generated by the hash function. These algorithms are designed
to be one-way functions, ensuring that it is nearly difficult to convert them back into the original data until they are
converted into their respective hash values.
SHA-1, SHA-2, and SHA-3 are a few algorithms of this type, each of which was successively built in reaction to hacker
assaults with progressively stronger encryption. Because of the commonly revealed bugs, SHA-0, for example, is now
redundant.
IP Security or IPSec does not provide a single protocol. Instead, IPSec includes a collection of encryption algorithms plus a
general structure that allows any algorithms to be used by a pair of interacting organizations to provide encryption suitable
for communication.
● Authentication - The authentication function means that an established source has delivered the submitted packet.
It also ensures that the packet in transit has not been changed.
● Confidentiality - The confidentiality facility requires contact nodes to encrypt communications in order to stop third
party eavesdropping.
● Key protection - The protected exchanging of keys is involved.
● Encapsulating Security Payload (ESP): covers packet format and general issues related to ESP.
● Authentication Header (AH): covers packet format and general issues related to AH.
● Encryption Algorithm: a document that describes how various encryption algorithms are used.
● Authentication Algorithm: documents that describe how various encryption algorithms are used for AH.
● Domain of Interpretation (DOI): contains the value needed for the other documents to relate to each other.
The key purpose of this algorithm was to override the DES algorithm after some of its vulnerable elements emerged.
This algorithm has its own basic framework for the encryption and decryption of sensitive data and is applied worldwide in
hardware and software.
AES is able to accommodate three different key weights, such as AES 128, 192 and 256 bits, and each of these cyphers has
a block size of 128 bits.
Governments and the military use it because it's the best protocol available today for encryption.
Keys are used for information encryption and decryption. Because AES is a symmetric cypher, both encrypting and
decrypting information can be used with the same key.
3DES was implemented in a wide variety of applications as the shortcomings of standard DES became more apparent.
Before the advent of AES, it was one of the most widely used encryption schemes.
Microsoft Office, Firefox and EMV payment schemes are some examples of its implementations. 3DES is no longer used by
many of these systems because there are better options.
It has an 8-byte fixed data block size and its keys can range from 32 to 448 bits
(4 to 56 bytes) in length.
Blowfish is considered to be safe and it is fast. Its keys can, however, be selected
to be wide enough to survive an attack of brute force (e.g. at least 16 bytes).
Blowfish is licence-free and unpatented, and is available free for all applications.
All is welcome to get Blowfish downloaded and included in their software.
● Allows monitoring of the value with regard to the transmitted information. The signature is invalidated if a
document is subjected to a fraudulent alteration unless it conforms exclusively to the original document status.
● Guarantees protection against falsification. In certain instances, the current signature algorithms find falsification
infeasible.
● Any signature is created using a private key that is known only to its author, who is therefore unable to repudiate
the signature attached to the paper.
● In the case of a disagreement, the latter aspect therefore causes the authorship of a text to be confirmed by
evidence.
Some Digital Signature algorithms are RSA-PSS, ECDSA, Ed25519, ElGamal signature scheme, Rabin signature algorithm,
Pairing-based schemes such as BLS.
In this scheme, until all the necessary private keys are given, a transaction will not continue. This makes any particular key
worthless to any criminal, because to make it work, they need to take all your private keys.
By preventing a single point of device failure, the Multisig solution offers more reliability than the conventional one-
signature solution.
Losing or getting one key compromised does not cause the account to be compromised.
Multi-sig allows more adoption-friendly, secure and more stable use of cryptocurrency and blockchain.
Ron Rivest, Adi Shamir , and Leonard Adleman (hence, RSA) first published the algorithm in the 1970s.
There are various forms of Message Authentication Code (MAC) models, as follows:
A digital certificate is a certificate issued to validate the identity of the certificate issuer by a certificate authority ( CA). The
CA issues an encrypted digital certificate containing the public key of the claimant and a number of other information for
authentication. Digital certificates are used to connect a public key to a single person or organization.
The digital signature and the message are both sent to Digital Certificate.
While these are the pros of Zero-knowledge proof, there are still some pitfalls to the definition. A few of those are:
● Lengthy: There are around 2k calculations in the zero-knowledge system, each taking a certain amount of time to
process.
● Imperfect: The messages sent to the verifier/prover can be destroyed or changed.
● Restricted: The protocol of zero knowledge allows the password to be a numerical value.
● Messaging
● Authentication
● Storage Protection
● Sending Private Blockchain Transactions
● Complex Documentation
● File System Control
● Security for Sensitive Information
In the figure, you can see list of domains where risks might
arise from using blockchain.
2) Cryptographic key management - To maintain the integrity of the overall structure and guarantee stability,
blockchains use cryptographic functions such as hashing algorithms and public key cryptography. Improper
maintenance of cryptographic key-pairs may lead to unauthorized network access.
3) Functional requirements - Careful decisions should be taken with regard to the decision to incorporate a blockchain;
not only with regard to the need to incorporate a blockchain into an established IT environment, but also what type
to choose.
4) Data management and Privacy - Any request for transactions approved by the ledger is deemed final. Incorrect,
incomplete or even illegal transactions, owing to the fact that personal data is available and the transaction
obligations may not be revoked (to adhere to the right to be erased/forgotten), can lead to unforeseen effects such
as degraded data security or breached privacy requirements.
4) Centralization and Collusion - Independent nodes form a blockchain. Although these nodes function independently
with respect to each other, they can be owned by a single entity or by organizational partnership. Competitors on
this device may be blocked from transacting or the risk of accessing such functionality may be restricted.
7) Scalability and Continuity - Coordination and interaction between nodes that are often spatially isolated from each
other and situated within the internal IT environments of the participant is necessary to achieve consensus. This may
potentially contribute to a loss of scalability or even endanger the continuity of the blockchain framework and the
operations of companies depending on the blockchain system in the (business) phase.
7) Third party and Governance - Where the efficient functioning of conventional IT systems ( i.e. any organization is
the owner of its IT) depends largely on the organization's own control environment, blockchains rely on both the
network's total control environment and the control environments of the individual participating organizations. One
may question if 'third parties' are in fact 'second parties' in a blockchain sense.
In order to strengthen their security strategy and tools, companies spend millions of dollars per year.
The organizations continue to analyze zero-day vulnerabilities, develop endpoint defence Artificial Neural Networks
(ANNs), make machine learning models for emerging threats, develop an efficient cybersecurity incident response
mechanism and awareness software, and so on.
Jon Pincus (Researcher at Microsoft), Jeannette M. Wing (Computer Scientist at Carnegie University) and Michael Howard
(Security Business Unit at Microsoft) have developed a technique to quantify the attack surface of every application and to
keep track of any modifications to the surface of the attack. They called it Relative Attack Surface Quotient (RASQ).
SMB is a Microsoft protocol that is widely used, an enterprise with Positive SMB behavior can be distinguished from poor
SMB behavior by full exposure.
Similarly, there are particular anomalies that are hard to defend against. Using current surveillance technologies, however,
the secret to disclosure is identification.
In post-infection research, certain malicious actions even assists this technique to further strengthens the security position
of an organization.
Firewalls and antivirus apps are important as the first line of protection for networks and endpoints, while high-profile
cyber attacks often make breaking news and attract organizations' interest in terms of defending against these attacks.
There are advanced and mysterious threats that have never been seen before, and they also behave just like a legitimate
person, and companies are implementing fresh approaches with the capabilities of quantitative and behavioral intelligence
to identify and respond to such threats; machine learning/deep learning; and the study of intruder techniques, tactics , and
procedures (TTPs).
The bad news is that, like any other malware, the majority of defenders already handle them, but the irony is that cyber
criminals have grown much more advanced, financially driven, and patient in nature.
They have become considerably more difficult to locate, they perform commands and instruments manually (criminals
seldom take chances in the case of a wider target), and attackers reach the network concurrently from multiple approach
avenues.
In order to make concept choices, the arrows only display one of the alternative sequences. Scalability (like block size and
frequency), stability (like consensus protocol), cost competitiveness (like blockchain type) and performance (like data
structure) are mostly influenced by certain decisions. There are also trade-offs between the blockchain 's fundamental
properties.
Finally, it is also important where to deploy the modules of the blockchain-based system.
Taxonomy can aid in decision-making in this design process by allowing a systematic comparison between the capabilities
of various design choices.
The taxonomy also illustrates the effect on the quality attributes of numerous design choices. A context for the contrast is
given by the trade-off review of quality attributes.
The organization will construct a trusted vulnerability blockchain knowledge flow based
on the blockchain. And outside the organization, IoT devices, external entities and
regulatory bodies are covered by the participants. IoT systems receive blockchains
immediately and change their own risk alert and response techniques dynamically.
Based on the SLA agreement with the organization, external entities immediately
activate corresponding risk response services. The monitoring of risk control and
controlled organizations by analyzing risk information in the blockchain is the responsibility
of the Regulatory Authorities.
● Anything that the user knows - This may be information such as a password, a hidden question answer, or even a
personal identification number (PIN).
● Anything that the customer has - This approach entails the second stage of authentication by smartphones, other
hardware, or a software token dependent on card data.
● Anything that the user is - This is one of the most successful ways to validate the user. Biometric data such as
dynamic keystroke and mouse behavior.
● Single-Factor Authentication (SFA) It is dependent on information pre-shared by the user—a PIN or a password, or,
a security question, most definitely. This is often a problem, though, as a user can forget this pre-shared knowledge
if the user does not use the application frequently.
● Multi-Factor Authentication (MFA) This has many second-level user verification techniques, such as voice
biometrics, facial recognition, hand geometry, ocular technique, fingerprint authentication, geographic location,
recognition of thermal images, and several more. This module is, however, limited to exploring Two-Factor
Authentication only.
● Better security SMS-based OTP eliminates the possibility of attackers impersonating legitimate users by adding a
second level of authentication. It lowers the chance of account fraud and data violations. And if the hacker gets the
user's credentials from the dark web, the second piece of information needed to fully authenticate them will not be
available.
● Productivity increase Mobile 2FA allows multinational organizations to seamlessly use the second authentication
standard. Without disclosing any private details, employees can easily access company software, records, and third-
party services from any computer or location.
● Reduction of theft and rise of trust Most victims of theft avoid going to those merchants even though the data loss
was not the fault of the merchant. 2FA creates a stronger trust layer with the customer and thus lowers attempts at
infringement on merchant sites.
● Cloud-based solution This is used extensively for e-commerce, online banking, and other web technologies related
to online services. Have a look at this diagram:
It is the duty of this central registry to store all the information required to authenticate the customer. While 2FA increases
the level of protection for the second authentication layer, it also faces the downside of providing a list of confidential user
information stored by the centralized database.
Targeted attacks can tamper with or corrupt the central database, and this can lead to major data breaches.
The cybersecurity solutions-based CIA defence triad theory has been broken by Blockchain.
In security procedures, 2FA has been important for many years, however, attackers often manage to breach such devices.
We will learn how the 2FA mechanism can be transformed by Blockchain to achieve an enhanced protection process.
We can guarantee that this confidential information only resides on one database by using blockchain; instead, it can be
immutable within blockchain nodes and can not be changed or removed.
In this process, a third-party 2FA vendor can authenticate consumer devices via the blockchain network.
In order to create the second-level password, each party in the blockchain network will retain the endpoint information
safely and will enable the 2FA device.
The BTC addresses are derived from ECC public keys, and digital signatures created by the ECDSA are used to authenticate
the transaction.
The use of ECC is ineffective, since it does not have the randomness required, which may compromise the private key of
the user.
To generate a digital signature, a random value must be used for the private key, where the random value for each
transaction must be different.
For instance, 158 separate public keys were found in the Bitcoin Blockchain, which used the same random value (nonce) in
more than one signature, making it possible to compromise the private keys of the users.
The hash function is one of these primitives. SHA256, for example, is the hash function used in the Bitcoin Blockchain, and
is vulnerable to multiple cybersecurity challenges, such as preimage and collision attacks.
A preimage attack is where an output Y from hashing an input m is given to the attacker; the attacker seeks to find an input
m * such that hashing m * is equal to Y; however, the effort by the attacker to find two inputs that have the same hash is
called a collision attack.
In order to carry out such attacks, tremendous computational power is required, attacks may be possible only if the
adversary has quantum computing or a massive mining pool dominates.
Researchers initiated a cryptojacking initiative in February 2018 alone, which infected more than 4,000 websites, including
UK and US government pages; millions of Android users were attacked by the other initiative.
A deep-learning image-based research for malware detection was suggested by Venkatraman along with others (IT
Department, Melbourne Polytechnic). Furthermore, on the European water utility operating network, a vital infrastructure
technology firm discovered cryptocurrency mining ransomware, which had a major effect on the networks.
Flaws in the blockchain programme that is used in the blockchain network may result in the private keys of users being
exposed.
In 2014, during their software upgrade, Blockchain.info, which is a hybrid wallet provider, made an error during the update
when their users created a new key pair on their local device using the affected software, the ECDSA inputs were not
appropriately random, which means that an adversary could have run the software by only accessing the public address to
compromise the private keys of the users.
For eg: an opponent might execute a man-in-the-middle attack to change the target Bitcoin address to the adversary's
address.
To receive payments intended for the target, the adversary could vandalize the target website.
The result of the attack is devastating, since once the nodes in the network agree and record it in the database, it gets
difficult to refund the payment in the Bitcoin Blockchain.
The 51% vulnerability also extends to blockchain networks based on the PoS mechanism. If a single miner gets more than
50% of the total coins in the network, the vulnerability can be exploited; a 51% vulnerability progresses to a 51% attack,
which helps the attacker to do the following:
Following the validation, the intruder may obtain a product or service from the target.
He or she propagates his or her malicious fork and recovers the coins if the attacker succeeds in locating more blocks than
the legitimate chain; otherwise, he or she must extend his or her malicious fork to meet the honest miners' fork.
The attack would fail if the attacker is unable to keep up with the other nodes.
One transaction is pre-mined in a block in this attack, and a duplicated version of this transaction is sent by the attacker to
the user.
The attacker propagates the block, which includes the initial transaction. After the transaction is accepted and the recipient
delivers the product.
The transaction sent to the recipient will then be null, and the attacker will be successful in creating a double-spend
transaction.
The first transaction is sent to the victim who, without waiting for confirmation of the transaction, accepts the payment
(for example, sends a product ).
Around the same time, a conflicting transaction is broadcast to the network that returns the same amount of
cryptocurrency to the attacker, ultimately rendering the first transaction null.
To assess the timing of the propagating transactions of network nodes and how they broadcast across the network, the
attacker wants to analyze the blockchain network.
The attacker then determines the nodes that are earlier than the target in the propagating transactions and creates a direct
relation with the target. After that, without transmitting it to the network, the attacker initiates a transaction that makes a
legal deposit into the target and mines it into a stack.
If the attacker succeeds in triggering a legitimate block, he or she will not broadcast it until a block is mined by any other
nodes.
This attack is often considered a 'Sabotage Attack' because nothing is gained by the scoundrel miner, but it allows everyone
to fail.
The aim of the attack is to cause the mining pool 's profitability to decline. This kind of assault will bankrupt a pay-per-share
pool if continued for a long enough time.
Due to the random nature of mining, minimizing a Block Withholding attack is difficult, but some techniques have been
developed, such as different cryptographic commitment schemes combined with hash functions.
Usually, these mechanisms prohibit the pool administrator from cheating on the entire pool and make it difficult for miners
in the pool to discriminate between a partial Proof-of-Work and a full Proof-of-Work.
In the out-of-band payment, the owner of computational services is paid directly by the attacker to mine the blocks of the
attacker.
The attacker builds a pool in the negative-fee mining pool by awarding the higher return.
The attacker tries to bribe the blockchain itself in in-band payment by making a fork, which involves free bribe money to
any miner who endorses the fork of the attacker.
In order to understand how many shares have been submitted and how many blocks have been identified, the attacker
uses details about the amount of submitted shares in the target mining pool.
Using this data, the attacker in the target pool stops mining and contributes elsewhere.
The core principle behind this attack is that to achieve full profits, the attacker prefers separate pools to mine.
If the attacker is aware of recently mined blocks, he or she automatically publishes his or her own block, which must be
quicker than the rest of the network; thus, when a node publishes a block, the attacker will instantly spread his or her own
blocks to discard the blocks of honest nodes.
In order to manipulate the rewards, the attackers mine into their own blockchain and broadcast it depending on the
difference in length between the public and the owned blockchains.
With an example, let's illustrate selfish mining. Suppose that the overall hash rate is split equally between four miners:
Alice, Bob, Carol, and Dan (with 25% each). Alice, Bob, and Carol play by the rules, but Dan attempts to exploit the system
for his own benefit.
In normal conditions, we would expect a miner who discovers a block to automatically attach it to the chain. And as truthful
members, this is what Alice, Bob, and Carol do. But Dan withholds it if he finds a block (it's a valid solution, but it has yet to
be added). Dan can get lucky and find two blocks in a row, before anyone else.
The Selfish mining attack and the BWH attack are merged in this attack.
In the Single-pool FAW attack, the attacker joins the target mining pool and executes the attack against it.
In the Multipool FAW attack, by expanding the attack against many pools, the attacker intends to maximise his or her
revenue.
The adversary hijacks the most unique prefixes which host the IP address of each of the isolated nodes to redirect the
traffic destined for them.
When he or she is on the route, the traffic is intercepted by the adversary and decides which connections cross the
partition that the adversary tries to establish.
If the link does not reach the partition, packets are dropped by the adversary; otherwise, the link is stored within the
isolated nodes.
To evaluate the leakage points, the adversary records the transmitted messages; there are nodes in the isolated group that
retain relations with the external nodes which can not be intercepted by the adversary. In the isolated group, the adversary
eventually isolates the leakage points from other nodes.
Next, to postpone the block delivery, the attacker modifies the content of individual messages; this is possible due to a lack
of integrity checks and BTC message encryption.
Furthermore, the opponent makes use of the fact that nodes first send block requests to the peer that propagated per
block and wait 20 minutes before requesting it from another peer to deliver it. The opponent then sends a block at a 20-
minute interval to a target node, making the target ignorant of the most recently mined blocks and making the target
unable to contribute to the network.
These attacks have frequently been faced by the Blockchain platform networks, such as Ethereum and Bitcoin.
For example, over two years, 40 BTC services suffered from 142 DDoS attacks, and the targets included 7 percent of all
common operators.
Due to the greater probability of revenue, most of these attacks attacked vast mining pools and currency exchange
platforms.
These attacks have caused companies such as BitQuick and CoinWallet, within a few months of their beginning, to shut
down their operation.
To isolate the target and detach the transactions generated by the target, the adversary can use a group of exposed nodes
to execute the attack, or the attacker may make the user select only the blocks that are maintained by him or her.
The opponent with malicious nodes will encircle the target. The target would assume that by multiple truthful nodes, he or
she already connects to the network; but the fact is that the target has restricted access to the network since all the nodes
to which he or she connects are managed by the opponent.
He or she may fail to relay the target 's transactions until the opponent surrounds the target. In addition to the goal of the
network state the adversary will feed misleading data.
An effective Sybil attack could disable the functionality of the consensus algorithm and trigger a possible double-spending
attack.
The network time is obtained from the adjacent nodes by receiving a version message.
The median time of all neighbouring nodes is determined, and if the median time of all neighbouring nodes reaches 70
minutes, the network time counter returns to the machine time of the node by default.
He or she tries to show imprecise timestamps while the adversary is connecting to the target node.
Once the competitor modifies the time counter of the node network, a replacement blockchain may be implemented by
the incorrect node.
This attack would separate the target node from the network or reduce the validation rate of the transaction on the whole
network.
The adversary withdraws from an exchange and then, with another TXID, republishes the same transaction, and one of
them appears on the network. Owing to delays, rather than the initial withdrawal, it is extremely likely that the changed
transaction will win.
The currency exchange will not find the original transaction on the network and will assume that if the exchange only
depends on TXIDs, the transaction has failed. The opponent will therefore withdraw continuously.
Mt. Gox was one of the biggest exchanges in the history of the BTC; it declared bankruptcy due to the loss of over USD 450
million worth of coins. In attempt to steal coins from the exchange, the attackers carried out a transaction malleability
attack, which caused the exchange to freeze user accounts and avoid withdrawals.
As seen in the case of the 2016 DAO attack, the primary cause was the reentrancy flaw of smart contracts.
Reentrancy is a form of insecurity only seen in the Ethereum Smart Contract. An attacker first deposits a quantity X to a
multiparty smart contract, as the name suggests. Before the balance of funds deposited and withdrawn has been settled,
the attacker then performs a function to remove a quantity Y, which is more than X.
The result is that the attacker essentially takes the money in the deal from other parties.
Our report shows that Ethereum Smart Contract flaw incidents have increased from one incident in 2016 to two incidents
in 2017 to four in 2018.
A DLT is based on the mathematical model of a Directed Acyclic Graph, and its implementation is often termed as “Tangle”.
DAG and Tangle are, for this purpose, are also used interchangeably.
The DAG data structure is a system of nodes/vertices/sites (squares) that are linked to each other via edges (arrows).
It is necessary to connect each node to at least two other nodes. The node must check and confirm two previous nodes to
establish a new node. Tips are considered unvalidated nodes. A collection of data or transaction information is stored in
each node.
A DAG's data structure is a ledger that stores transactions in a graph format that points in one direction ( i.e., directed) and
is non-circular such that the future and current transactions (i.e. acyclic) will not be checked by past transactions.
This increases the technology's scalability, as the tangle generates a transaction graph that references older transactions.
Since the consensus process only allows two randomly chosen previous transactions to be accepted for any new
transaction, several transactions may be automatically checked rather than having to wait for the next block.
● Direct A direct implies the transaction sequences in this case. The links point to earlier transactions connected to
later transactions in the same direction, and so on.
● Acyclic A main component of the DAG-Acyclic suggests exactly what it looks like-no back-cycling. Loops won't be
possible since connecting to another transaction the transaction does not circle back upon itself.
● Graph The interlinked network forms a topology-like graph in which nodes are linked to other nodes. The network of
linked transactions can be interpreted as nodes in a network of graphs in which nodes are linked to each other.
● DAGs facilitate effective scaling, and user costs are also minimized.
● DAGs are well suited for high volumes of transactions, including micro and nano-transactions. The larger the number
of transactions, the earlier they are validated by a DAG.
● DAGs have also eliminated the need for miners and mining infrastructure, which means lower energy usage.
● DAGs employ a "Co-ordinator" to avoid malicious attacks on the network, serving as a centralized, voluntary and
temporary alternate consensus mechanism.
● We can argue that using a node of the coordinator suggests that the technology is not decentralized enough.