Blockchain Technology,
Bitcoin, Hashing and Digital
signature
BY:-
ANIL CHAURASIYA
SCHOOL OF COMPUTER & INFORMATION
SCIENCES (SCIS)
UNIVERSITY OF HYDERABAD
HYDERABAD
1
contents
 What is Blockchain
 Blockchain contains
 Example of services using Blockchain
 What is Bitcoin
 Features of Bitcoin
 Decetralization in Bitcoin
 Hyperledger
 Hashing
 Proof of work
 Digital signature
2
What is Blockchain
A blockchain is a continuously growing
list of records, called block, which are
linked and secured using
cryptography. Each block typically
contains a hash pointer as a link to a
previous block, a timestamp and
transaction data.
3
Blockchain contains
 Usually contains financial transactions.
 Is replicated across a number of systems in
almost real-time.
 Usually exists over a peer-to-peer network.
 Uses cryptography and digital signatures to
prove identity, authenticity and enforce
read/write access rights.
4
Examples of services using
blockchain
 Finance
 Point/Reward
 Communication
 Authentication
 Medical
 Public sector
 IoT
 Future prediction
5
What is Bitcoin
Bitcoin is a virtual currency. Instead
of printing banknotes, or minting coins, a
list of the registration numbers of each of
the "coins" is kept and a record of who
owns them. People can pay one another by
transferring the registration numbers
online.
6
Features of Bitcoin
 Bitcoin infinitely divisible currency units
supporting eight decimal places 0.00000001.
 No central authority.
 Cannot be double-spent.
 Non-repudiation – no recourse and no one to
appeal to return sent tokens.
7
Decentralization in Bitcoin
 The “digital wallet” operates in a peer to peer
mode
 The wallet will synchronize with the network
by downloading ALL of the transactions
starting from the GENESIS block.
 Using a “gossip protocol” the wallets share all
transaction information with their peers.
8
Bitcoins flow from Inputs to
Outputs
9
Hyperledger
Hyperledger is an open source blockchain platform, started
in December 2015 by the Linux Foundation, to support
blockchain-based distributed ledgers. It is focused on
ledgers designed to support global business transactions,
including major technological, financial, and supply chain
companies, with the goal of improving many aspects of
performance and reliability. The project aims to bring
together a number of independent efforts to develop open
protocols and standards, by providing a modular framework
that supports different components for different uses.
10
Hashing
 A hash function is used to map digital data of arbitrary size
to digital data of fixed size, with slight differences in input
data producing very big differences in output data.
 MD5, SHA1, SHA256
 For example, the MD5 hashes of ‘abc’ compared to ‘abC’
abc
0bee89b07a248e27c83fc3d5951213c1
abC
2217c53a2f88ebadd9b3c1a79cde2638
11
Hashing
 Hashing is straightforward, but not challenging
 Unless the goal is to say, find me a hash value that
satisfies a certain level of “difficulty”
 For example, let’s say the challenge is find a hash-value
that begins with a number of zeros, for a given input
 The Proof of Work comes from finding a number
(known as a NONCE) that when added to the input
changes the output of the hash value to satisfy the
difficulty.
12
Proof of Work
 A publicly auditable cost-function can be efficiently verified
by any third party without access to any trapdoor or secret
information.
 A fixed cost cost-function takes a fixed amount of resources to
compute. The fastest algorithm to mint a fixed cost token is a
deterministic algorithm.
 A probabilistic cost cost-function is one where the cost to the
client of minting a token has a predictable expected time, but a
random actual time as the client can most efficiently compute
the cost-function by starting at a random start value.
Sometimes the client will get lucky and start close to the
solution.
13
Consensus achieved using Proof
of work
 New transactions are broadcast to all nodes.
 Each node collects new transactions into a block.
 Each node works on finding a difficult proof-of-work for its
block.
 When a node finds a proof-of-work, it broadcasts the block to
all nodes.
 Nodes accept the block only if all transactions in it are valid
and not already spent.
 Nodes express their acceptance of the block by working on
creating the next block in the chain, using the hash of the
accepted block as the previous hash.
 Nodes always consider the longest chain to be the correct one
and will keep working on extending it.
14
Purchase / Exchange Bitcoins
In addition to mining bitcoins, they can be acquired from an
exchange!
15
Who Accepts Bitcoins?
16
Merchants Accepting Bitcoin
Overstock.com
Newegg.com
Microsoft XBOX Network
Telsa Motors
17
Digital Signature
Digital signature is an electronic signature that can be used
to authenticate the identity of the sender of a message or the
signer of a document, and possibly to ensure that the
original content of the message or document that has been
sent is unchanged. Digital signatures are easily
transportable, cannot be imitated by someone else, and can
be automatically time-stamped. The ability to ensure that the
original signed message arrived means that the sender
cannot easily repudiate it later.
18
How digital signature works
The use of digital signatures usually involves two processes, one
performed by the signer and the other by the receiver of the digital
signature:
 Digital signature creation uses a hash result derived from and
unique to both the signed message and a given private key. For
the hash result to be secure, there must be only a negligible
possibility that the same digital signature could be created by
the combination of any other message or private key.
 Digital signature verification is the process of checking the
digital signature by reference to the original message and a
given public key, thereby determining whether the digital
signature was created for that same message using the private
key that corresponds to the referenced public key.
19
How digital signature works
20
21

Blockchain

  • 1.
    Blockchain Technology, Bitcoin, Hashingand Digital signature BY:- ANIL CHAURASIYA SCHOOL OF COMPUTER & INFORMATION SCIENCES (SCIS) UNIVERSITY OF HYDERABAD HYDERABAD 1
  • 2.
    contents  What isBlockchain  Blockchain contains  Example of services using Blockchain  What is Bitcoin  Features of Bitcoin  Decetralization in Bitcoin  Hyperledger  Hashing  Proof of work  Digital signature 2
  • 3.
    What is Blockchain Ablockchain is a continuously growing list of records, called block, which are linked and secured using cryptography. Each block typically contains a hash pointer as a link to a previous block, a timestamp and transaction data. 3
  • 4.
    Blockchain contains  Usuallycontains financial transactions.  Is replicated across a number of systems in almost real-time.  Usually exists over a peer-to-peer network.  Uses cryptography and digital signatures to prove identity, authenticity and enforce read/write access rights. 4
  • 5.
    Examples of servicesusing blockchain  Finance  Point/Reward  Communication  Authentication  Medical  Public sector  IoT  Future prediction 5
  • 6.
    What is Bitcoin Bitcoinis a virtual currency. Instead of printing banknotes, or minting coins, a list of the registration numbers of each of the "coins" is kept and a record of who owns them. People can pay one another by transferring the registration numbers online. 6
  • 7.
    Features of Bitcoin Bitcoin infinitely divisible currency units supporting eight decimal places 0.00000001.  No central authority.  Cannot be double-spent.  Non-repudiation – no recourse and no one to appeal to return sent tokens. 7
  • 8.
    Decentralization in Bitcoin The “digital wallet” operates in a peer to peer mode  The wallet will synchronize with the network by downloading ALL of the transactions starting from the GENESIS block.  Using a “gossip protocol” the wallets share all transaction information with their peers. 8
  • 9.
    Bitcoins flow fromInputs to Outputs 9
  • 10.
    Hyperledger Hyperledger is anopen source blockchain platform, started in December 2015 by the Linux Foundation, to support blockchain-based distributed ledgers. It is focused on ledgers designed to support global business transactions, including major technological, financial, and supply chain companies, with the goal of improving many aspects of performance and reliability. The project aims to bring together a number of independent efforts to develop open protocols and standards, by providing a modular framework that supports different components for different uses. 10
  • 11.
    Hashing  A hashfunction is used to map digital data of arbitrary size to digital data of fixed size, with slight differences in input data producing very big differences in output data.  MD5, SHA1, SHA256  For example, the MD5 hashes of ‘abc’ compared to ‘abC’ abc 0bee89b07a248e27c83fc3d5951213c1 abC 2217c53a2f88ebadd9b3c1a79cde2638 11
  • 12.
    Hashing  Hashing isstraightforward, but not challenging  Unless the goal is to say, find me a hash value that satisfies a certain level of “difficulty”  For example, let’s say the challenge is find a hash-value that begins with a number of zeros, for a given input  The Proof of Work comes from finding a number (known as a NONCE) that when added to the input changes the output of the hash value to satisfy the difficulty. 12
  • 13.
    Proof of Work A publicly auditable cost-function can be efficiently verified by any third party without access to any trapdoor or secret information.  A fixed cost cost-function takes a fixed amount of resources to compute. The fastest algorithm to mint a fixed cost token is a deterministic algorithm.  A probabilistic cost cost-function is one where the cost to the client of minting a token has a predictable expected time, but a random actual time as the client can most efficiently compute the cost-function by starting at a random start value. Sometimes the client will get lucky and start close to the solution. 13
  • 14.
    Consensus achieved usingProof of work  New transactions are broadcast to all nodes.  Each node collects new transactions into a block.  Each node works on finding a difficult proof-of-work for its block.  When a node finds a proof-of-work, it broadcasts the block to all nodes.  Nodes accept the block only if all transactions in it are valid and not already spent.  Nodes express their acceptance of the block by working on creating the next block in the chain, using the hash of the accepted block as the previous hash.  Nodes always consider the longest chain to be the correct one and will keep working on extending it. 14
  • 15.
    Purchase / ExchangeBitcoins In addition to mining bitcoins, they can be acquired from an exchange! 15
  • 16.
  • 17.
  • 18.
    Digital Signature Digital signatureis an electronic signature that can be used to authenticate the identity of the sender of a message or the signer of a document, and possibly to ensure that the original content of the message or document that has been sent is unchanged. Digital signatures are easily transportable, cannot be imitated by someone else, and can be automatically time-stamped. The ability to ensure that the original signed message arrived means that the sender cannot easily repudiate it later. 18
  • 19.
    How digital signatureworks The use of digital signatures usually involves two processes, one performed by the signer and the other by the receiver of the digital signature:  Digital signature creation uses a hash result derived from and unique to both the signed message and a given private key. For the hash result to be secure, there must be only a negligible possibility that the same digital signature could be created by the combination of any other message or private key.  Digital signature verification is the process of checking the digital signature by reference to the original message and a given public key, thereby determining whether the digital signature was created for that same message using the private key that corresponds to the referenced public key. 19
  • 20.
  • 21.