Blockchain On IOT
Blockchain On IOT
TABLE I
R ELATED S URVEYS ON B LOCKCHAIN T ECHNOLOGIES
Year Author Main focus/contributions
to apply the blockchain technology to IoV. Based on the P2P electricity trading. Using consortium blockchain method,
decentralized security model, Huang et al. [10] proposed the PETCON system can publicly audit and share transaction
a blockchain ecosystem model, named LNSC, for electric records without relying on a trusted third party. To solve
vehicle and charging pile management. The LNSC model uses the issues of forwarding reliable announcements without re-
elliptic curve cryptography (ECC) to calculate hash functions vealing users’ identities, Li et al. [14] proposed a privacy-
electric vehicles and charging piles. To avoid the location preserving scheme, named CreditCoin, for sending announce-
tracking in the IoV, Dorri et al. [11] proposed a decentralized ments anonymously in the IoV. The CreditCoin scheme uses
privacy-preserving architecture, where overlay nodes manage the blockchain via an anonymous vehicular announcement
the blockchain. In addition, the hash of the backup storage is aggregation protocol to build trust in the IoV communications.
stored in the blockchain. For data credibility assessment in the IoV, Yang et al. [15]
Without the administration from the central manager, Lei proposed a blockchain-based reputation system, which can
et al. [12] proposed a blockchain-based dynamic key man- judge the received messages as either true or false based on
agement for vehicular communication systems. Based on a the senders’ reputation values.
decentralized blockchain structure, the third-party authorities
are removed and the key transfer processes are verified and D. Internet of Energy
authenticated by the security manager network. Moreover, The Internet of energy (IoE) provides an innovative concept
Kang et al. [13] introduced a P2P electricity trading system, to increase the visibility of energy consumption in the Smart
named PETCON, to illustrate detailed operations of localized Grid. Based on the sovereign blockchain technology, Gao
5
TABLE II
M AJOR ATTACKS ON B LOCKCHAIN
Threat model Countermeasures Resistant protocols
Key attack - Elliptic curve encryption is used to calculate the hash functions LNSC protocol [10]
- Distributed SDN architecture DistBlockNet protocol [36]
- Decentralized mixing service CoinParty protocol [37]
DDoS/DoS attack
- Ring signature using ECDSA Liu et al.’s protocol [38]
-Block size limitation, attribute-based signatures, and multi-receivers encryption BSeIn protocol [39]
- Elliptic curve encryption is used to calculate the hash functions LNSC protocol [10]
Replay attack
- The freshness of public/private key pairs BSeIn protocol [39]
Hiding Blocks - An immutable chain of temporally ordered interactions is created for each agent TrustChain protocol [40]
False data injection attack - Blockchain consensus mechanisms Liang et al.’s protocol [21]
Tampering attack - Public-key cryptosystem Wang et al.’s protocol [41]
- Elliptic curve encryption is used to calculate the hash functions LNSC protocol [10]
Impersonation attack - Distributed incentive mechanism based blockchain and the node cooperation Wang et al.’s protocol [16]
based privacy protection mechanism
- Attribute-based signatures BSeIn protocol [39]
Refusal to Sign - Not interacting with the malicious agent, or splitting the transactions in smaller TrustChain protocol [40]
amounts
Overlay attack - Every transaction is embedded with a Time-Stamp to mark the uniqueness Wang et al.’s protocol [41]
- Multi signatures and anonymous encrypted message propagation streams Aitzhan and Svetinovic’s protocol [22]
Double-spending attack
- Time-Stamp and the Proof-of-Work mechanism Wang et al.’s protocol [41]
- Elliptic curve encryption is used to calculate the hash functions LNSC protocol [10]
Modification attack
- The attribute signature and the MAC BSeIn protocol [39]
Collusion attack - Blockchain-based incentive mechanism He et al.’s protocol [42]
Whitewashing attack - Lower priorities are given to the agents of new identities TrustChain protocol [40]
Quantum attack - Lattice-based signature scheme Yin et al.’s protocol [43]
- Elliptic curve encryption is used to calculate the hash functions LNSC protocol [10]
Man-in-the-middle attack
- Secure mutual authentication BSeIn protocol [39]
Sybil attack - An immutable chain of temporally ordered interactions is created for each agent TrustChain protocol [40]
et al. [20] introduced a monitoring system on Smart Grid, malware, especially on the open source Android platform.
named GridMonitoring, for ensuring transparency, provenance, By utilizing statistical analysis method, Gu et al. [46] intro-
and immutability. The GridMonitoring system is based on duced a malware detection system based on the consortium
four layers, namely, 1) Registration and authentication layer, Blockchain, named CB-MDEE, which is composed of de-
2) Smart meter, 3) Processing and consensus nodes, and tecting consortium chain by test members and public chain
4) Data processing on the smart grid network. In modern by users. The CB-MDEE system adopts a fuzzy comparison
power systems, Liang et al. [21] proposed a data protection method and multiple marking functions In order to reduce
framework based on distributed blockchain, which can resist the false-positive rate and improve the detection ability of
against data manipulation that are launched by cyber attackers malware variants. To protect the embedded devices in the
(e.g., false data injection attacks). To guarantee data accuracy, IoT, Lee et al. [47] a firmware update scheme based on the
Liang’s framework uses the consensus mechanism, which is blockchain technology, which the embedded devices have the
automatically implemented by every node and has the rep- two different operation cases, namely, 1) response from a
resentative characteristics, namely, 1) Setting of public/private verification node to a request node, and 2) response from a
key update frequency, 2) Block generation, 3) Miner selection, response node to a request node.
and 4) Release of meter’s memory periodically. For secure
energy trading in Industrial Internet of Things (IIoT), Li et al.
F. Access Management in IoT
[18] introduced the energy blockchain, which is based on the
consortium blockchain technology and the Stackelberg game. For managing IoT devices, Novo [48] proposed a distributed
Aitzhan and Svetinovic [22] implemented a token-based pri- access control system using the blockchain technology. The
vate decentralized energy trading system for in decentralized architecture of this system is composed of six components,
smart grid energy, which can be applied to the IoE. namely, 1) Wireless sensor networks, 2) Managers, 3) Agent
node, 4) Smart contract, 5) Blockchain network, and 6)
Management hubs. This system brings some advantages for
E. Internet of Things devices the access control in IoT, such as: 1) mobility, which can be
In the Internet of Things devices, attackers seek to exfiltrate used in isolated administrative systems; 2) accessibility, which
the data of IoT devices by using the malicious codes in ensures that the access control rules are available at any time;
6
3) concurrency, which allows that the access control policies extensive data sharing among entities and trust computation.
can be modified simultaneously; 4) lightweight, which means In order to deal with the privacy concerns that are raised by the
that the IoT devices do not need any modification to adopt data exchange and to suppress insider attacks, the blockchain
this system; 5) scalability, as the IoT devices can be connected technology is applied. In this way, the use of trusted third
through different constrained networks; 6) transparency, where party, which is also a single point of failure, that is needed in
the system can preserve the location privacy. traditional collaborative IDSs can be avoided.
In addition, to achieve k-anonymity privacy protection, the of ringer, which can be used for generic computations in the
mechanism uses a node cooperation method for participating outsourcing computing.
users.
III. T HREAT MODELS FOR B LOCKCHAIN
N. Data storage In this section, we present and describe the threat models
The data storage can deal with heterogeneous data resources that are considered by the blockchain protocols in IoT net-
for IoT-based data storage systems. How to share and protect works. A summary of 16 attacks are given in Table II, and
these sensitive data are the main challenges in IoT data are classified into the following five main categories: identity-
storage. Based on the blockchain technology, Jiang et al. [58] based attacks, manipulation-based attacks, cryptanalytic at-
proposed a private keyword search, named Searchain, for tacks, reputation-based attacks, and service-based attacks, as
decentralized storage. The Searchain architecture includes two presented in Figure 5.
component, namely, 1) transaction nodes in a peer-to-peer
structure and 2) a blockchain of all the ordered blocks. In A. Identity-based attacks
addition, the Searchain architecture can provide user privacy, The attacks under this category forge identities to masquer-
indistinguishability, and accountability. ade as authorized users, in order to get access to the system and
manipulate it. We classify four attacks, namely: Key attack,
O. Bitcoin Replay attack, Impersonation attack, and Sybil attack.
Launched in 2009, Bitcoin is the peer-to-peer (P2P) pay- • Key attack: This attack is defined in the context of a
ment network that does not need any central authorities. Based system combining electric vehicles and charging piles,
on the core technique of blockchain, Bitcoin users do not use as follows: "If the private key of an electric vehicle
real names; instead, pseudonyms are used. Therefore, Bitcoin that has been used for longtime leaks, the attacker can
is based on three main technical components: transactions, impersonate this electric vehicle to deceive others" [10].
consensus Protocol, and communication network. To deal with this attack, LNSC protocol [10] provides
The existing research on anonymity and privacy for Bitcoin a mutual authentication mechanism between the electric
system are presented in Tab. III. Khalilov and Levi [72] vehicles and charging piles. To this end, it employs the
have published an interesting investigation on anonymity and elliptic curve encryption to calculate the hash functions,
privacy in Bitcoin-like digital cash systems. Specifically, the and hence it ensures resiliency against the key leakage
study classified the methods of analyzing anonymity and attack.
privacy in Bitcoin into four categories, namely, 1) Transacting, • Replay attack: The aim of this attack is to spoof the
2) Utilizing off-network information, 3) Utilizing network, and identities of two parties, intercept their data packets,
4) Analyzing blockchain data. and relay them to their destinations without modifica-
As discussed by Wang et al. [71], Bitcoin works in practice, tion. To resist against this attack, LNSC [10] uses the
but not in theory,and the main issue is how to protect the idea of elliptic curve encryption to calculate the hash
potential buyers’ privacy in Bitcoin using the public key infras- functions. On the other hand, BSein [39] uses a fresh
tructure. Wang et al. [71] studied the designated-verifier proof one-time public/private key pair, which is generated for
of assets for bitcoin exchange using elliptic curve cryptogra- each request, to encrypt the message and compute the
phy. Specifically, the authors proposed a privacy-preserving Message Authentication Code (MAC). In this way, the
scheme, named DV-PoA, which can satisfy unforgeability. replay attack can be detected.
Note that the DV-PoA scheme uses elliptic curve discrete log- • Impersonation attack: An adversary tries to masquerade
arithm problem, elliptic curve computational Diffie-Hellman as a legitimate user to perform unauthorized operations.
problem, and collision-resistance of cryptographic hash func- As presented in Table II, there are three methods that
tion. In addition, to protect the privacy of simplified payment are proposed to protect against this attack. The idea of
verification (SPV) clients, Kanemura et al. [70] proposed a elliptic curve encryption to calculate the hash functions,
privacy-preserving Bloom filter design for an SPV client based is proposed by LNSC protocol [10]. Wang et al. [16]
on γ−Deniability. propose a distributed incentive-based cooperation mech-
By removing the trusted third party, Qin et al. [73] proposed anism, which protects the user’s privacy as well as a
a distributively blockchain-based PKI for Bitcoin system, transaction verification method of the node cooperation.
named Cecoin. To ensure the consistency, Cecoin uses an The mechanism hides the user’s privacy information
incentive mechanism and a distributed consensus protocol. within a group, and ensures their protection from the
To provide multi-certificate services and identity assignment, impersonation attack. BSeIn [39], on the other hand,
Cecoin converts a triple (address, domain, cert) to a tuple uses the idea of attribute-based signatures, i.e., only
(key, address, cert), and key represents path of cert in the tree. legitimate terminals can generate a valid signature, and
Therefore, to protect the transaction privacy in Bitcoin, Wang hence any impersonation attempt will be detected when
et al. [41] proposed a framework by adding the homomorphic its corresponding authentication operation fails.
Paillier encryption system to cover the plaintext amounts in • Sybil attack: Under this attack, an adversary creates many
transactions. To solve the trust problem in Bitcoin, Huang et al. fake identities. By performing many interactions in the
[57] proposed a commitment-based sampling scheme instead network, the adversary can gain a large influence within
8
TABLE III
E XISTING R ESEARCH ON A NONYMITY AND P RIVACY FOR B ITCOIN S YSTEMS
Year Protocol Countermeasures Security models
2013 CoinSwap [59] - The protocol requires four published transactions - Anonymity
2013 CoinJoin [60] - Each user check the mixing transaction before signing on it - Anonymity
2013 ZeroCoin [61] - Decentralized e-cash scheme with a tuple of randomized algorithms (Setup, - Anonymity
Mint, Spend, Verify)
- RSA accumulators and non-interactive zero-knowledge signatures of
knowledge
2014 Mixcoin [62] - Cryptographic accountability - Anonymity
- Randomized mixing fees
2014 Xim [63] - Anonymous decentralized pairing - Anonymity
2014 CoinShuffle [64] - Requires only standard cryptographic primitives - Anonymity
2014 Zerocash [65] - Publicly-verifiable preprocessing zero-knowledge - Privacy-preserving
2015 Blindcoin [66] - Blind signature scheme - Anonymity
2015 CoinParty [67] - Combination of decryption mixnets with threshold signatures - Anonymity
2016 Blindly Signed Contract [68] - Blind signature scheme - Anonymity
2017 TumbleBit [69] - Replaces on-blockchain payments with off-blockchain puzzle solving - Anonymity
2017 Kanemura et al. [70] - The privacy metric "Deniability" - Privacy-preserving
2017 Wang et al. [71] - Elliptic curve cryptography - Privacy-preserving
2017 Wang et al. [41] - Homomorphic paillier encryption system - Privacy-preserving
2018 Liu et al. [38] - Ring signature - Privacy-preserving
- Elliptic curve digital signature algorithm - Anonymity
2018 Huang et al. [57] - Commitment-based sampling scheme - Security requirement of completeness
- Security requirement of fairness
- Security requirement of accountability
Threat models
Key attack [10] False data injec- Quantum at- Hiding Blocks DDoS/DoS
tion attack [21] tack [43] attack [40] attack [36], [37],
Replay at- [38], [39]
tack [39], [10] Tampering Whitewashing [40]
attack [41] Refusal to Sign
Impersonation attack [40]
attack [13], [39], Overlay at-
[10] tack [41] Double-spending
attack [41], [22]
Sybil attack [40] Modification
attack [39], [10] Collusion
attack [42]
Man-in-the-middle
attack [39], [10]
In addition, the interactions among the nodes are based number, any agent in the network can request specific
on a consensus mechanism, which consists in executing records of others. The requested agents cannot refuse to
a distributed voting algorithm. Each node can verify the provide their records. Otherwise, other agents will stop
integrity of the received data. The latter is considered interacting with them.
correct when a positive agreement is reached. • Whitewashing: When an agent has negative reputation, it
• Tampering attack: The adversary may tamper the bitcoin can get rid of its identity and make a new one. There is no
transactions of the bitcoin addresses, amounts and other way to prevent this behavior. However, it is suggested in
information after signing. To prevent this attack, Wang et [40] to give lower priorities to the agents of new identities
al. [41] use a public-key cryptosystem that is compatible when applying the allocation policy.
with the existing Bitcoin system. They propose adding
the homomorphic Paillier encryption system to cover E. Service-based attacks
the plaintext amounts in transactions, and the encrypted
amounts will be checked by the Commitment Proof. They aim either to make the service unavailable or make it
• Overlay attack: It means that the attacker adds a forgery behave differently from its specifications. Under this category,
encrypted amount to the original encrypted amount under we can find the following attacks:
the receiver’s public key. In [41], this attack is detected as • DDoS/DoS attack: It involves sending a large amount of
every transaction is embedded with an timestamp to mark requests to cause the failure of the blockchain system.
its uniqueness. Different inputs under the same trader can As shown in Table II, there are four methods that are
be distinguished and linked to the different transactions, proposed to deal with this attack. The idea of distributed
and hence resistance against the overlay attack is ensured. SDN architecture is proposed by DistBlockNet protocol
• Modification attack: It consists in modifying the broadcast in [36]. CoinParty [37] proposes the idea of decentralized
transaction or the response message. To deal with this at- mixing service. Liu et al. [38] employ a ring-based
tack, LNSC [10] uses the idea of elliptic curve encryption signature with Elliptic Curve Digital Signature Algorithm
to calculate the hash functions. BSeIN [39], on the other (ECDSA). The resilience against DOS in BSeIn [39] is
hand, employs the attribute signature and the MAC. achieved by limiting the block size, checking the maxi-
• Man-in-the-middle attack: An attacker by spoofing the mum number of attribute signatures for the transaction
identities of two parties can secretly relay and even input, and using multi-receivers encryption to provide
modify the communication between these parties, which confidentiality for authorized participants.
believe they are communicating directly, but in fact the • Refusal to Sign attack: A malicious agent can decide
whole conversation is under the control of the attacker. to not sign a transaction that is not in his favor. Al-
To resist against this attack, BSeIn [39] provides secure though preventing this attack is not possible, punishment
mutual authentication. In [10], LNSC provides mutual au- measures can be taken against the refusal agents. It is
thentication by using elliptic curve encryption to calculate proposed in [40] to not interact with the malicious agent,
the hash functions. or split the transactions in smaller amounts. If an agent
refuses to sign a transaction, the interaction is aborted.
• Double-spending attack: It means that the attackers spend
C. Cryptanalytic attacks
the same bitcoin twice to acquire extra amounts. In [41],
They aim to break the cryptographic algorithm and ex- the Time-Stamp and the Proof-of-Work mechanism is
pose its keys. In [43] the quantum attack is investigated used. In [22], a multi-signature transaction is employed,
in blockchain. This attack is designed to solve the elliptic where a minimum number of keys must sign a transaction
curve digital logarithm, i.e., derive the private key from the before spending tokens.
elliptic curve public key. In this way, an adversary can sign • Collusion Attack: Nodes can collude with each other and
unauthorized transactions and forge the valid signature of behave selfishly to maximize their profit. In [42], an
users. To deal with this issue, Yin et al. [43] uses the idea of incentive mechanism and pricing strategy is proposed to
lattice-based signature scheme., which allows deriving many thwart the selfish behaviors.
sub-private keys from the seed in the deterministic wallet of
blockchain.
IV. E XISTING RESEARCH ON SECURITY AND PRIVACY IN
BLOCKCHAIN - BASED I OT
D. Reputation-based attacks
Table IV summarizes research for blockchain-based IoT
An agent manipulates his reputation by changing it to a
security and privacy.
positive one. In this category, we can find the following
attacks, namely: Hiding Blocks attack, and Whitewashing
attack. A. Authentication
• Hiding Blocks attack: Under this attack, an agent only In [78], Lin et al. proposed a novel transitively closed
exposes transactions that have a positive impact on his undirected graph authentication scheme that can support
reputation and hides the ones with negative reputation. In blockchain-based identity management systems. In compar-
[40], an immutable chain of temporally ordered interac- ison to other competing authentication schemes, their pro-
tions for each agent. Since each record has a sequence posal provides an additional capability of dynamically adding
10
TABLE IV
E XISTING RESEARCH FOR BLOCKCHAIN - BASED I OT SECURITY AND PRIVACY
Year Scheme Blockchain model Security model Goal Performance (+) and limitation (-) Comp. complexity
2016 Aitzhan - Blockchain technology - Privacy preserving - Enables peers to anony- + Combat double-spending attacks Medium
and with multi signatures and mously negotiate energy prices - A formal proof is not provided on the Sybil-
Svetinovic anonymous encrypted and securely perform trading resistance
[22] message propagation transactions
streams
2017 Otte et al. - Every participant grows - Distributed trust - Providing strict bounds on + A formal proof is provided on the Sybil- Up to 2n + 1 max-
[40] and maintains their own the profitability of a Sybil at- resistance flow computations
chain of transactions tack - Authentication is not considered
2017 Kanemura - Blockchain technology - Privacy preserving - Improving the privacy level + True positive Bitcoin addresses are hidden by the Medium
el al. [70] with Deniability of a simplified payment verifi- false positives in a Bloom filter
cation client - Authentication is not considered
2017 Wang et - Blockchain technology - Preserving transac- - Achieving delicate + Robust transaction Td e c = 2Tm +
al. [41] with the Paillier cryp- tion privacy anonymity and prevents + Prevent the following attacks: Tampering attack, 2iTE
tosystem for encryption active and passive attacks Overlay attack, Double-spending attack
and decryption - Sybil-resistance
2018 Yin et al. - Quantum attack in the - Transaction authenti- - Resisting quantum attack, + Strongly unforgeable under chosen message at- The length of signa-
[43] blockchain cation while maintaining the wallet tack ture is O(1)
lightweight - The Sybil-resistance is not considered
2018 Jong- - Consortium Blockchain - Identity and authenti- - Creating a new ID as a Ser- + It can be implemented as a cloud platform Medium
Hyouk cation management vice - The threat model is not defined
Lee [74]
2018 Fan et al. - The blockchain is a - Privacy preserving - Achieve the goal of every + Backward security M + Tm
[45] public, tamper-resistant - Access control data owner’s complete control + Forward security
ledger - The Sybil-resistance is not considered
2018 Wang et - Blockchain based in- - Privacy preserving - Achieve k-anonymity privacy + Resist the impersonation attacks in the open and Medium
al. [16] centive mechanism protection transparent blockchain
- The collusion attacks is not analysed
2018 Lin et al. - ID-based linearly ho- - Authentication - Avoiding the shortcomings of + Secure against existential forgery on adaptively High
[75] momorphic signature the use of public key certifi- chosen message and ID attack in the random oracle
cates model
- Adaptation with the Blockchain is not analyzed
2018 Li et al. - Blockchain based in- - Privacy preserving - Achieving privacy- + Maintains the reliability of announcements Medium
[14] centive mechanism - Authentication preserving in forwarding + Achieve Sybil-resistance
announcements - Location privacy is not considered
2018 Ziegeldorf - Blockchain technology - Anonymity - Achieving correctness, + Resilience against DoS attacks from malicious Medium
et al. [37] with Deniability - Deniability anonymity, and deniability attackers
+ Compatible with other crypto-currencies which
use the same ECDSA primitive, e.g., Litecoin and
Mastercoin
- Double-spending attacks is not considered
2018 Yang et - The blocks maintain the - Accountable trace- - Achieving public verification + Achieve public verification The data owner con-
al. [76] proofs produced by the ability without any trusted third party + Efficient in communication as well as in compu- ducts (2 + log2 m)
cloud server tation hash computations
- Tampering attack is not considered
2018 Hu et al. - The Ethereum - Distributed trust - Saving on the overall deploy- + Low-cost, accessible, reliable and secure pay- Low bandwidth
[77] blockchain ment and operational costs ment scheme
- Accountable traceability is not considered
2018 Liu et al. - The blockchain based - Preserving transac- - Help Bitcoin users protect + Resistant to DoS attacks High
[38] on the ring signature tion privacy their account and transaction + Prevent the mixing server from mapping input
with elliptic curve dig- information transactions
ital signature algorithm + Anonymity and scalability
(ECDSA) - Double-spending attacks is not considered
2018 Lin et al. - The structure of blocks - Authentication - Enforce fine-grained access + Resilience to hijacking attacks, user imperson- Medium
[39] is similar to that in Bit- - Access control control polices ation attacks, DDoS attacks, modification attacks,
coin replay attacks, and man-in-the-middle attacks
+ Mutual authentication
+ Session key agreement
+ Perfect forward secrecy
- The Sybil-resistance is not considered
2018 Lin et al. - The Ethereum - Authentication - Solving the existing in- + Update the certificates without the need to re- Signature size: 2
[78] blockchain tractability issue in transitive sign the nodes points in Z∗q
signature + Provide a proof when the edge between two
vertices does not exist
- Access control is not considered compared to the
scheme in [39]
Notations :
M : The time for one exponentiation;
Tm : The size of the ciphertext;
Td e c : The time for decryption;
Tm : The unit of modular multiplication time;
TE : The unit of modular exponentiation time
11
or deleting nodes and edges. Moreover, this novel scheme parties from passive eavesdropping by hiding non-content data.
that was built on Ethereum solves the authentication prob- For enhancing the transaction privacy in Bitcoin, Wang et al.
lem of non-existent edges, which is a known challenge in [41] achieve transaction by using cryptographic methods, i.e.,
transitive signature schemes. Lin et al.in [39] proposed a employs the public-key system. Through the standard ring
novel blockchain-based framework that can ensure a secure signature and ECDSA unforgeability, Liu et al. [38] proposed
remote user authentication. The proposed framework combines an idea that can achieve the anonymity.
attribute-based signatures, multi-receivers encryption and Mes- One other aspect of privacy in blockchain systems is about
sage Authentication Code. In [14], Li et al. proposed a novel anonymity. Although it is possible to design an almost im-
privacy-preserving Blockchain-based announcement network mutable, tamper-resistant transaction, this transaction can be
for Vanets that is based on a threshold authentication protocol seen throughout all of the nodes on the blockchain network.
called Echo-Announcement. One promising research on supporting private transactions
Authors in [75] proposed an ID-based linearly homo- inside a blockchain is zk-STARKs, which combines zCash
morphic signature schemes that can be used for realizing and Ethereum. The combination of both technologies makes it
authentication in blockchains. The system allows a signer possible to keep anonymity when conducting payments, blind
to produce linearly homomorphic signatures, and hence it auctions, and even voting [73].
avoids the shortcomings of public-key certificates. In addition,
it is shown to be robust against several attacks. In [74] C. Trust
authors introduced the concept of blockchain as a service. A blockchain-based payment scheme that is stet up in a
Their proposed blockchain based-ID as a Service (BIDaaS) remote region setting was introduced in [77]. The proposed
mechanism, is a new type of IDaaS that can be used for scheme is assumed to have an intermittent connectivity to a
identity and authentication management. Authentication can bank’s central system. Distributed trust is accomplished with
be achieved without the use of any preregistered information the use of a two-layer architecture, where the bank authorizes
of the user. Finally in [43] authors cope with the problem of a set of selected villagers to act as miners who on their
keeping the wallet in a relatively small size while ensuring turn authorize transactions among villagers with tokens and
the robustness of transaction authentication by introducing a the bank. In [40] authors present a mechanism where every
novel anti-quantum transaction authentication scheme. participant grows and maintains his own chain of transactions.
The proposed approach provides distributed trust, without the
need of any gatekeeper, while being robust against Sybil
B. Privacy-preserving
attacks.
In the core of blockchain philosophy lies the private key
that can unlock the cryptographic protection of the digital V. O PEN QUESTIONS AND RESEARCH CHALLENGES
assets. The private key becomes the highest vulnerability of To complete our overview, we outline both open questions
a blockchain system whether it is stored on a piece of paper, and research challenges that could improve the capabilities
screen, disk, in local memory or in the cloud. Users tend to and effectiveness of blockchain for the IoT, summarized in
use digital wallets that can be either software or hardware, e.g. the following recommendations:
Trezor or Keepkey, which are vulnerable to various attacks like
fault injections [79]. A. Resiliency against Combined Attacks
Another solution that is gaining ground nowadays is the As presented in this survey, many security solutions for
use of hardware security modules (HSMs), a crypto-processor bloackchain-based IoT have been proposed in the literature,
that securely generates, protects and stores keys. The entire each of which is designed to tackle different security issues
cryptographic key lifecycle happens inside the HSM. An HSM and threat models. The main question that might arise is how
can be a standalone device that operates offline or can be to design a security solution that can be resilient against com-
embedded in a server, can be hardened against tampering or bined attacks while taking into account the implementation
damage, and is usually located in a physically secure area to feasibility of the solution, especially in case of low resource-
prevent unauthorized access. Finally a new generation of ultra- constrained IoT devices.
secure PCs that have embedded an HSM and requires two-
factor authentication is recently introduced. This PC can be B. Dynamic and Adaptable Security Framework
protected against physical attacks with a tamper-proof casing Heterogeneous devices are deployed in the IoT network,
and mechanisms like automatic erasion of the private key in ranging from low-power devices to high-end servers. Hence,
case of any breach of the embedded physical or logical security a single security solution cannot be deployed for all the
controls [80]. Using trusted computers both as secure digital blockchain-based IoT architectures due to the different amount
wallets and blockchain nodes. Security assurance of users and of resources that are provided. Therefore, the security solution
organizations need in order to trust this new technology can should initially adapt itself to the existing resources, and
be provided in the near future. decide which security services to offer, so as to meet the
To achieve k-anonymity privacy protection, Wang et al. [16] minimum security requirements of the end-users. Thus, one
use a node cooperation verification approach, in which each of the challenges that should receive more attention in the
group contains K nodes to meet the objective of K-anonymity future is how to design such a dynamic and adaptable security
protection. Aitzhan et al. [22] proposed an idea that protects framework for blockchain-based IoT architectures.
12
[50] C. Xu, K. Wang, and M. Guo, “Intelligent Resource Management in [73] B. Qin, J. Huang, Q. Wang, X. Luo, B. Liang, and W. Shi, “Cecoin:
Blockchain-Based Cloud Datacenters,” IEEE Cloud Comput., vol. 4, A decentralized PKI mitigating MitM attacks,” Futur. Gener. Comput.
no. 6, pp. 50–59, nov 2017. Syst., oct 2017.
[51] P. K. Sharma, M.-Y. Chen, and J. H. Park, “A Software Defined Fog [74] J.-H. Lee, “BIDaaS: Blockchain Based ID As a Service,” IEEE Access,
Node Based Distributed Blockchain Cloud Architecture for IoT,” IEEE vol. 6, pp. 2274–2278, 2018.
Access, vol. 6, pp. 115–124, 2018. [75] Q. Lin, H. Yan, Z. Huang, W. Chen, J. Shen, and Y. Tang, “An ID-
[52] Q. Xia, E. B. Sifah, K. O. Asamoah, J. Gao, X. Du, and M. Guizani, based linearly homomorphic signature scheme and its application in
“MeDShare: Trust-Less Medical Data Sharing Among Cloud Service blockchain,” IEEE Access, pp. 1–1, 2018.
Providers via Blockchain,” IEEE Access, vol. 5, pp. 14 757–14 767, [76] C. Yang, X. Chen, and Y. Xiang, “Blockchain-based publicly verifiable
2017. data deletion scheme for cloud storage,” J. Netw. Comput. Appl., vol.
[53] N. Alexopoulos, E. Vasilomanolakis, N. R. Ivanko, and M. Muhlhauser, 103, pp. 185–193, feb 2018.
“Towards blockchain-based collaborative intrusion detection systems,” [77] Y. Hu, A. Manzoor, P. Ekparinya, M. Liyanage, K. Thilakarathna,
in Proc. Int. Conf. Critical Inf. Infrastruct. Secur, 2017, pp. 1–12. G. Jourjon, A. Seneviratne, and M. E. Ylianttila, “A Delay-Tolerant
[54] W. Meng, E. W. Tischhauser, Q. Wang, Y. Wang, and J. Han, “When Payment Scheme Based on the Ethereum Blockchain,” jan 2018.
Intrusion Detection Meets Blockchain Technology: A Review,” IEEE [Online]. Available: http://arxiv.org/abs/1801.10295
Access, vol. 6, pp. 10 179–10 188, 2018. [78] C. Lin, D. He, X. Huang, M. K. Khan, and K.-K. R. Choo, “A
New Transitively Closed Undirected Graph Authentication Scheme for
[55] T. Cruz, L. Rosa, J. Proença, L. Maglaras, M. Aubigny, L. Lev, J. Jiang,
Blockchain-based Identity Management Systems,” IEEE Access, pp. 1–
and P. Simões, “A cybersecurity detection framework for supervisory
1, 2018.
control and data acquisition systems,” IEEE Transactions on Industrial
[79] O. Boireau, “Securing the blockchain against hackers,” Network Secu-
Informatics, vol. 12, no. 6, pp. 2236–2246, 2016.
rity, vol. 2018, no. 1, pp. 8–11, 2018.
[56] K. Kalkan and S. Zeadally, “Securing internet of things (iot) with
[80] “This ultra-secure pc self destructs if someone messes with
software defined networking (sdn),” IEEE Commun. Mag., 2017.
it,” https://www.wired.com/2017/06/orwl-secure-desktop-computer/, ac-
[57] H. Huang, X. Chen, Q. Wu, X. Huang, and J. Shen, “Bitcoin-based fair cessed: 2018-06-01.
payments for outsourcing computations of fog devices,” Futur. Gener. [81] J. Lind, I. Eyal, F. Kelbert, O. Naor, P. Pietzuch, and E. G. Sirer,
Comput. Syst., vol. 78, pp. 850–858, jan 2018. “Teechain: Scalable blockchain payments using trusted execution en-
[58] P. Jiang, F. Guo, K. Liang, J. Lai, and Q. Wen, “Searchain: Blockchain- vironments,” arXiv preprint arXiv:1707.05454, 2017.
based private keyword search in decentralized storage,” Futur. Gener. [82] I. Bentov, Y. Ji, F. Zhang, Y. Li, X. Zhao, L. Breidenbach, P. Daian, and
Comput. Syst., sep 2017. A. Juels, “Tesseract: Real-time cryptocurrency exchange using trusted
[59] G. Maxwll, “Coinswap,” 2013. [Online]. Available: https://bitcointalk. hardware,” 2017.
org/index.php?topic=321228 [83] S. Dziembowski, S. Faust, V. Kolmogorov, and K. Pietrzak, “Proofs of
[60] G. Maxwell, “Coinjoin: Bitcoin privacy for the real world,” in Post on space,” in Proc. 35th Annual Cryptology Conference on Advances in
Bitcoin forum, 2013. Cryptology, Aug. 2015, pp. 585–605.
[61] I. Miers, C. Garman, M. Green, and A. D. Rubin, “Zerocoin: Anonymous [84] “DPOS description on bitshares,” accessed on 15 June, 2018. [Online].
Distributed E-Cash from Bitcoin,” in 2013 IEEE Symp. Secur. Priv. Available: http://docs.bitshares.org/bitshares/dpos.html
IEEE, may 2013, pp. 397–411. [85] “Telehash,” accessed on 15 June, 2018. [Online]. Available: http:
[62] J. Bonneau, A. Narayanan, A. Miller, J. Clark, J. A. Kroll, and E. W. //telehash.org
Felten, “Mixcoin: Anonymity for Bitcoin with Accountable Mixes,” in [86] B. F. França, “Homomorphic mini-blockchain scheme,” pp. 1–
Int. Conf. Financ. Cryptogr. Data Secur. Springer Berlin Heidelberg, 17, Apr. 2015, accessed on 15 June, 2018. [Online]. Available:
2014, pp. 486–504. http://cryptonite.info/files/HMBC.pdf
[63] G. Bissias, A. P. Ozisik, B. N. Levine, and M. Liberatore, “Sybil- [87] J. D. Bruce, “The mini-blockchain scheme,” 2014, accessed on
Resistant Mixing for Bitcoin,” in Proc. 13th Work. Priv. Electron. Soc. 15 June, 2018. [Online]. Available: http://www.cryptonite.info/files/
- WPES ’14. New York, New York, USA: ACM Press, 2014, pp. mbc-scheme-rev2.pdf
149–158. [88] N. Ayres and L. A. Maglaras, “Cyberterrorism targeting the general
[64] T. Ruffing, P. Moreno-Sanchez, and A. Kate, “CoinShuffle: Practical public through social media,” Security and Communication Networks,
Decentralized Coin Mixing for Bitcoin,” in Eur. Symp. Res. Comput. vol. 9, no. 15, pp. 2864–2875, 2016.
Secur. Springer, 2014, pp. 345–364. [89] Y. Chen, Q. Li, and H. Wang, “Towards trusted social networks with
[65] E. B. Sasson, A. Chiesa, C. Garman, M. Green, I. Miers, E. Tromer, blockchain technology,” arXiv preprint arXiv:1801.02796, 2018.
and M. Virza, “Zerocash: Decentralized Anonymous Payments from [90] Q. Kong, R. Lu, H. Zhu, and M. Ma, “Achieving secure and privacy-
Bitcoin,” in 2014 IEEE Symp. Secur. Priv. IEEE, may 2014, pp. 459– preserving incentive in vehicular cloud advertisement dissemination,”
474. IEEE Access, vol. 6, pp. 25 040–25 050, 2018.
[91] J. Hua, H. Zhu, F. Wang, X. Liu, R. Lu, H. Li, and Y. Zhang, “Cinema:
[66] L. Valenta and B. Rowan, “Blindcoin: Blinded, Accountable Mixes for
Efficient and privacy-preserving online medical primary diagnosis with
Bitcoin,” in Int. Conf. Financ. Cryptogr. Data Secur. Springer Berlin
skyline query,” IEEE Internet of Things Journal, pp. 1–1, 2018.
Heidelberg, 2015, pp. 112–126.
[67] J. H. Ziegeldorf, F. Grossmann, M. Henze, N. Inden, and K. Wehrle,
“Coinparty: Secure multi-party mixing of bitcoins,” in Proc. 5th ACM
Conf. Data Appl. Secur. Priv. - CODASPY ’15. New York, New York,
USA: ACM Press, 2015, pp. 75–86.
[68] E. Heilman, F. Baldimtsi, and S. Goldberg, “Blindly Signed Contracts:
Anonymous On-Blockchain and Off-Blockchain Bitcoin Transactions,”
in Int. Conf. Financ. Cryptogr. Data Secur. Springer Berlin Heidelberg,
2016, pp. 43–60.
[69] E. Heilman, L. AlShenibr, F. Baldimtsi, A. Scafuro, and S. Goldberg,
“TumbleBit: An Untrusted Bitcoin-Compatible Anonymous Payment
Hub,” in Proc. 2017 Netw. Distrib. Syst. Secur. Symp. Reston, VA:
Internet Society, 2017.
[70] K. Kanemura, K. Toyoda, and T. Ohtsuki, “Design of privacy-preserving
mobile Bitcoin client based on γ-deniability enabled bloom filter,” in
2017 IEEE 28th Annu. Int. Symp. Pers. Indoor, Mob. Radio Commun.
IEEE, oct 2017, pp. 1–6.
[71] H. Wang, D. He, and Y. Ji, “Designated-verifier proof of assets for bit-
coin exchange using elliptic curve cryptography,” Futur. Gener. Comput.
Syst., jul 2017.
[72] M. C. K. Khalilov and A. Levi, “A Survey on Anonymity and Privacy
in Bitcoin-like Digital Cash Systems,” IEEE Commun. Surv. Tutorials,
pp. 1–1, 2018.