WO2022216204A1

WO2022216204A1 - Method and apparatus for handling secure communication using blockchains in a communications network

Info

Publication number: WO2022216204A1
Application number: PCT/SE2022/050338
Authority: WO
Inventors: Fredrik Johansson
Original assignee: Rz Capital Holding Ab
Priority date: 2021-04-06
Filing date: 2022-04-05
Publication date: 2022-10-13

Abstract

A method performed by an apparatus for handling secure communication in a communications network is provided. The apparatus obtains (201) first data to transfer. The apparatus determines (202) a first communication configuration. The apparatus selects (203) a first set of one or more network nodes. The apparatus transfers (204) the first data using the first set of one or more network nodes. The apparatus obtains (205) second data to transfer. The apparatus determines (206) a second communication configuration. The apparatus selects (207) a first set of one or more network nodes. The apparatus transfers (208) the second data using the second set of one or more network nodes.

Description

METHOD AND APPARATUS FOR HANDLING SECURE COMMUNICATION USING BLOCKCHAINS IN A COMMUNICATIONS NETWORK

TECHNICAL FIELD

Embodiments herein relate to an apparatus and a method therein. In some aspects, they relate to handling secure communication in a communications network.

BACKGROUND

Current systems relating to blockchains have given the world an ability to achieve more than just making a crypto transaction on a blockchain. Although each system provides its unique features, they face issues in many aspects of the real-world scenarios. Some aspects of blockchain systems will now be described.

Consensus algorithms

In recent times, an immense amount of research has been conducted in distributed data recording, peer-to-peer transmission, consensus mechanism, encryption algorithm and other computer technologies. SHA256 algorithm was proposed by Guilford J.D which is employed in the blockchain. The original exchange of any length recorded is computed twice by SHA256 algorithm so that it can acquire the hash value and the hash value’s length is 256. One of the many hashing applications is the Merkle tree and proof of work (POW). The Merkle tree has a structure of a tree, where every leaf node has a hash value and a non-leaf node carries its child node’s hash value. It stores transaction information and generates digital signatures. It increases the scalability and improves efficiency of the blockchain. It can verify data without extracting the complete blockchain network node. Timestamp was introduced to record the time of block data to solve the problem of “double spending”, making it possible for data to reconstruct the history. In addition to proof of existence, timestamp ensures that the database is not manipulated and saves from fraudulent activity. In peer-to-peer technology there is no central node or existence of any hierarchy structure, every node on the network has equal status. Each node will undertake the network routing, data validation and data transmission. To secure data transmission and allow ownership verification, blockchain uses the asymmetric encryption algorithm called Elliptic Curve Cryptography (ECC), with each user having a pair of keys, one public and one private. Users sign the transaction information with ECC, meanwhile, other users can verify the signature with the public key of the signed user. Furthermore, the public key is also used to identify different users and construct their Bitcoin addresses.

Proof-of-Work (POW)

PoW is a cryptographic puzzle first presented by C.Dwork and M.Noar. The foundation for it was set to prevent spams and curb the denial of service attacks. Satoshi Nakamoto was amongst the first to adopt this system in the Bitcoin system. Further, a hybrid protocol was presented by Bentov et al, that relied on PoW and Proof of Stake (POS) protocols and combined both of their advantages, establishing an element more superior. Ateniese et al proposed an alternative to PoW that is Proof of Space, which specified the amount of memory rather relied on memory access as in PoW. Arthur Gervais et al introduced “a novel quantitative framework to analyze the security and performance implications of various consensus and network parameters of PoW blockchains” by Gervais et al., 2016. They devised optimal adversarial strategies to affect double-spending and selfish mining considering real-world constraints and attacks. Alex Biryukov et al introduced Equihash that “an asymmetric proof-of-work with tuneable parameters”, it is a “PoW based on the generalized birthday problem and enhanced Wagner’s algorithm for it” (Biryukov et al., 2017).

Proof-of-Stake (POS)

Peercoin first time used Proof of Stake in 2012. PoS generally means proof of ownership of the currency. PoS does not have mining so it does not utilize computing power, like PoW. It solves the energy problem in the current blockchain system such as Bitcoin and Ethereum. The nodes possess a certain amount of stake, that is the currency, in a blockchain. The higher the stake of the party the more likely it is to release a new block and become the leader. A reward is also issued in PoS protocol just like it is issued in PoW. PoS is a more cost-effective method and saves energy. However, there is a problem of monopoly in PoS, which is unfair for many participants. Yuefei Gao et al proposed Proof of Stake sharding protocol to increase scalability. Fahad Saleh introduced the ‘first formal economic model’ of PoS and explained how the consensus works under it (Saleh, 2018).

Delegated Proof-of-Stake (DPOS)

DPOS is a relatively new consensus algorithm that is better than energy inefficient and poorly protected PoW and PoS. It ensures the representation of transactions within a blockchain. DPOS is a fast, outstanding and advantageous consensus algorithm model.

To solve the consensus problem, DPOS uses voting and elections, which is fairer and saves computing power. Every holder of the stake can vote, fulfilling a certain number of representatives and all have equal rights. To maintain the ‘long-term purity’ representatives can be changed by holders at any time. Its main advantage is that it saves computation energy and is more cost-effective than PoW and PoS. DPOS removes the biases caused by PoS with equity and decentralizes the decision making on the network.

Practical Byzantine Fault Tolerance (PBFT)

The Practical Byzantine Fault Tolerance (PBFT) is an algorithm that can tolerate Byzantine faults caused by the Byzantine General Problem. Miguel Castro and Barbara Liskov first introduced it in their paper, solving the problem caused by faulty nodes’ low efficiency. PBFT is based on message authentication codes that go through three-phase protocols and automatically cast the replicas if failure occurs. It depends on three-phase messages before to execute operations. PBFT consensus is highly efficient and enables high-frequency exchanging. All the nodes in the network are identified and all the faulty nodes are restricted in the network. The requirements set for this consensus algorithm is challenging to apply it to public blockchain Also, the great amount of calculations required for this consensus protocol made it impossible to employ.

Blockchain Applications Side Chains Side-chains are a new and innovative addition to the Bitcoin protocol which develops a connection between the main Bitcoin chain and an additional side-chain. The interaction will let the side-chains transfer each other’s assets with two-way peg. The vision for this framework is to increase the functionality and enhance capabilities through pegging with some other chains for the Bitcoin currency. This allows more extensibility that the Bitcoin system usually allows. Fundamentally, the validity of side-chains does not depend on provisions, the tokens of one chain are only secured by side-chain when it provides its miners' incentives to convert the data that can be represented by standard approved format. The security of the Bitcoin network cannot be easily changed for other blockchains. Furthermore, it is impossible and unfeasible to merge-mine of Bitcoin miners with side-chains and validate side chain changes. Cosmos is another innovation that allows trust-free communication between multiple chains to take place. It has deployed the Nakamoto PoW consensus method for Jae Kwon’s Tendermint algorithm leading to interchain communication. Essentially, it connects heterogeneous chains called zones with a master chain called Hub. This interchain communication is restricted only to the transfer of digital assets and not random information. Interchain communication allows a return path for data, e.g. to verify and validate the status of transfer from the sender. One of the significant unsolved problems is defining validator sets for the zoned chains and stimulating them like side-chains. The common assumption is that each zone holds a token of a certain value and pays them with it. The early stages of the design still lack thorough details to achieve scalability over validity. However, the lack of coherence between the zones and the hub can be beneficial as it can lead to additional flexibility over the zoned chains compared to a system with strong connections

SUMMARY

As a part of developing embodiments herein a problem was identified by the inventors and will first be discussed.

Scalability: Resource is consumed by a blockchain system to carry out a certain operation on a blockchain. Under peak requests, a problem that arises is whether the system can behave consistently or if it will grow over time depending on an availability of resources on a network.

Self-governing: There is a huge concern regarding that during peak requests, i.e. a highest number of requests, the system need to be autonomous enough to decide how to distribute resources. A system thus needs to be capable enough to make autonomous decisions in securing, improving and inter-linking the other systems. It is a statement of great advancement for the system to self-govern.

Interoperability: Interoperability was discovered recently and it solves the problem of blockchains working in silos. The current system’s concern is whether it will communicate with other blockchain systems or not. The idea of trading transactions from one blockchain to another is a huge milestone to achieve. With present applications upgrading, it is necessary for a system to align itself with a growth in the industry streamlined with interoperability.

Fairness: Blockchain became popular because one of its crucial features is a decentralized system. Users from around the globe are connected to various blockchains, giving them a right to equal representation. It is a matter of great responsibility that systems are fair in allowing regular computers to participate in a network to reach decentralization. A blockchain system may also under analyses to present itself fair in matters of the distribution of rewards. The present implementations of blockchains can only illustrate what they highlight when they are running on a system with high hardware specifications, which in return breaks the overall intent of fairness and true decentralization. As highlighted by Ethereum Parity client, it achieved throughput around 3,000 transactions per second which is only possible when it is running on a high- performance system. However, most practical implementations of the blockchains are limited to around 15 - 30 transactions per second because in the public network not all the nodes possess the same resources as tested during their initial prototyping. The other reason included is that the current consensus algorithms are limited to some extent, this slows down the processing time and the systems are currently based on the architecture of state transition mechanism. Hence, to reach consensus the underlying system needs to share the history of its root and reach the agreement based on the validity. This architecture is followed e.g. by Anastasia Koloskova, Sebastian Stich, and Martin Jaggi. Decentralized stochastic optimization and gossip algorithms with compressed communication. International Conference on Machine Learning (ICML), pages 3478- 3487, Released 26th October, 2020 and e.g. by POS based systems such as Bitcoin, Ethereum, NXT and Bitshares. To become successful a trade-off has to be made, therefore, the resulting system has proven to be a great success so far and making historical changes in the industry. Although, the resultant protocol is subjected to limitations in terms of scalability, security, interoperability and fairness. A trade-off system is subject to certain risks and failures, failing to accommodate improvements, only to become a performant and upgradeable solution for the future needs. Therefore, there is a need for a robust, optimal and autonomous solution, which not only satisfies and accommodates current systems but future systems as well.

Hence, embodiments herein provide a solution to some of the above-mentioned problems. Embodiments herein, may be powered by a consensus engine that is not only powered by Al but e.g. is also autonomous, interoperable, secure and scalable. As there is a need for a completely new architecture which could serve as a foundation to build future blockchains efficiently, embodiments herein comprises a five-layered architecture each with its strengths and functionality, revolutionizing the blockchain industry uniquely. Communication: There is a high communication among network nodes e.g. performing machine learning models, and/or when nodes communicate raw data among a network. In scenarios when uncompressed data is communicated over the network and same channel is utilized by the nodes for other purposes. It puts stress on the network, e.g. high congestion, which is a bottleneck when performing machine learning and distributing related raw data over a network.

An object of embodiments herein is to improve the performance of blockchain systems.

According to an aspect of embodiments herein, the object is achieved by a method for handling secure communication, performed by an apparatus using one or more blockchains in a communications network. The apparatus obtains first data to transfer.

The first data has a first type of data describing what is to be transferred. Based on the type of first data, the apparatus determines a first communication configuration. Based on the first communication configuration, out of multiple sets of one or more network nodes, the apparatus selects a first set of one or more network nodes for handling communication of the first data. This may comprise the apparatus selecting a swarm out of one or more swarms, e.g. wherein each swarm comprises one or more network nodes. The apparatus transfers the first data as a blockchain transaction, using the first set of one or more network nodes. The apparatus obtains a second data to transfer may be obtained. The second data has a second type of data describing what is to be transferred. Based on the type of second data, the apparatus determines a second communication configuration. Based on the second communication configuration, out of multiple sets of one or more network nodes, the apparatus selects a second set of one or more network nodes for handling communication of the second data. This may comprise the apparatus selecting a swarm out of one or more swarms. The apparatus transfers the second data as a blockchain transaction using the second set of one or more network nodes by transferring the second data to one or more of the network nodes in the second set.

According to another aspect of embodiments herein, the object is achieved by an apparatus configured to handle secure communication using one or more blockchains in a communications network. The apparatus being configured to: obtain first data to transfer, wherein the first data has a first type of data describing what is to be transferred, based on the type of first data, determine a first communication configuration, based on the first communication configuration, out of multiple sets of one or more network nodes, select a first set of one or more network nodes, for handling communication of the first data, transfer the first data as a blockchain transaction using the first set of one or more network nodes, obtain second data to transfer, wherein the second data has a second type of data, describing what is to be transferred, based on the type of second data, determine a second communication configuration, based on the second communication configuration, out of multiple sets of one or more network nodes, select a second set of one or more network nodes for handling communication of the second data, transfer the second data as a blockchain transaction, using the second set of one or more network nodes, by transferring the second data to one or more of the network nodes in the second set.

By transferring different data using different sets of network nodes, an improved handling of network resources is achieved, thus reducing congestion in the communications network. This is since the blockchain transactions for the first data is handled by the first set of network nodes and the block chain transactions for the second data is handled by the second set of network nodes. In other words, automatically selecting different communication configurations and network nodes for different data of different types results in a varied use of network nodes in a blockchain system and thus reduces congestion in the communications network.

BRIEF DESCRIPTION OF THE DRAWINGS

Examples of embodiments herein are described in more detail with reference to attached drawings in which:

Figure 1 is a schematic block diagram illustrating embodiments herein.

Figure 2 is a flowchart depicting an embodiment of a method herein.

Figure 3a-b are schematic block diagrams illustrating embodiments of an apparatus herein. DETAILED DESCRIPTION

Embodiments herein provide a communication module for a blockchain system.

To improve communication, embodiments herein may relate to a blockchain system, which may be implemented by an apparatus 101, which will further be illustrated in Figure 3.

In some embodiments the apparatus 101 may be any one out of or comprise any one or more out of: a computing device, a network node, a blockchain system, and a distributed system, e.g. comprising a first one or more network nodes and/or a second one or more network nodes.

Methods herein is performed in a communications network. Methods herein may be performed by the apparatus 101. As an alternative, a Distributed Node (DN) and functionality, e.g. comprised in a cloud, may be used for performing or partly performing the methods herein. Additionally or alternatively, methods herein may further be performed by any of the one or more network nodes, e.g. collectively as a system. The one or more network nodes may be the first one or more network nodes and/or the second one or more network nodes.

Some functionality used in embodiments herein is illustrated in Figure 1. For example, it may be possible to use a gossip function 111 to encrypt and prepare data to be transmitted in blockchain transactions to one or more network nodes forming one or more network swarms 130, 131.

A number of embodiments will now be described, some of which may be seen as alternatives, while some may be used in combination.

Figure 2 shows example embodiments of method for handling secure communication performed by the apparatus 101 using one or more blockchains in a communications network. The method comprises the following actions, which actions may be taken in any suitable order.

Action 201

The apparatus obtains first data to transfer. The first data has a first type of data. The first data or first type of data is describing what is to be transferred. In other words, the first data type may indicate what type of data is to be transferred in the one or more blockchains. The first data type may be obtained with the first data and/or determined by inspecting the first data.

Action 202

The apparatus 101, based on the type of first data, determines a first communication configuration. In other words, different types of data may be configured to be transferred in different manner e.g. to different network nodes based on the type of data.

Action 203

The apparatus 101, based on the first communication configuration, out of multiple sets of one or more network nodes, selects a first set of one or more network nodes for handling communication of the first data. In other words, action 203 may comprise the apparatus 101 selecting a first swarm out of one or more swarms 130, 131.

Action 204

The apparatus 101 transfers the first data as a blockchain transaction, using the first set of one or more network nodes by transferring the first data to one or more of the network nodes in the first set. In other words, the first data type is distributed in the first set of one or more network nodes, e.g. belonging to the first swarm.

Action 205

The apparatus 101 obtains second data to transfer. The second data has a second type of data describing what is to be transferred. In other words, the second data type may indicate what type of data is to be transferred in the one or more blockchains. The second data type may be different than the first data type.

Action 206

In some embodiments, the apparatus 101, based on the type of second data, determines a second communication configuration. In other words, since the first and second data type may be different, the second communication configuration may also be different and may indicate a different manner in which to communicate the second data, e.g. to which network nodes to transmit the second data to. The second data type may be obtained with the second data and/or determined by inspecting the second data. Action 207

In some embodiments, the apparatus 101, based on the second communication configuration, out of multiple sets of one or more network nodes, selects a second set of one or more network nodes for handling communication of the second data. In other words, action 207 may comprise the apparatus 101 selecting a second swarm out of one or more swarms 130, 131.

Action 208

In some embodiments, the apparatus 101 transfers the second data as a blockchain transaction, using the second set of one or more network nodes, by transferring the second data to one or more of the network nodes in the second set. In other words, the second data type is distributed in the second set of one or more network nodes, e.g. belonging to the second swarm. Since the second data is distributed to different network nodes than the first data, handling of network resources is achieved, thus reducing a congestion in the communications network.

The above embodiments will now be further explained and exemplified below. The embodiments below may be combined with any suitable embodiment above. In some embodiments below, for brevity, network nodes may be referred to as nodes.

Some embodiments herein do not use previously mentioned conventional consensus algorithms. This is since these consensus algorithms have their own drawbacks and embodiments herein instead provides a flawless consensus engine that has been developed carefully. The consensus engine comprises, e.g. is performed using, a protocol which is based on an Artificial Intelligence (Al) consensus algorithm, also referred to as an Aphelion protocol. In other words, the consensus engine is an automated computer generated engine that, due to its automation, saves energy, time and gives high speed of transaction over other consensus protocols. In this way, in some embodiments, transactions may be processed by the Al engine in order to determine validity and/or consensus of a transaction. In other words, the Al may process blockchain transactions by using a pre-trained neural network to determine validity and/or consensus of the blockchain transactions. This ensures validity and/or consensus of the blockchain transactions without communication and/or traditional mining which uses a lot of computational resources. A system, e.g. the consensus engine/algorithm, being generated through/using Al is safe from any human corruption and is fully decentralized and additionally endorses complete transparency.

In some embodiments, embodiments herein may be extended to many different platforms, e.g. different blockchains.

In some embodiments, embodiments herein saves the energy of resources and time of its clients, e.g. users, so that everything is carried down effectively and efficiently. This is since the consensus may now be automated using an Al engine.

In some embodiments herein, a blockchain transaction may be a transfer of data distributed among multiple network nodes wherein the transfer of data is validated using a consensus mechanism such as an automated Al consensus mechanism.

Network and Communication

For the Aphelion protocol to run, as it is intended or programmed to be, it is necessary that a network layer of the protocol also supports fast communication and can scale over time.

There is a high communication among the nodes for the machine learning models and nodes can communicate raw data among the networks. The whole protocol can be badly affected, if the uncompressed data is communicated over the network and the same channel is utilized by the nodes. It puts stress on the network, and this could be regarded as the bottleneck for the whole operating system. To solve this problem, at the network layer, the embodiments herein, e.g. by means of peer to peer (p2p), utilizes a multi layered gossip swarming with compression mechanisms. In these embodiments, nodes interact with one another through one or more swarms and share compressed data in data streams of packets. In embodiments herein, a p2p communications network is referred to as a swarm.

Some embodiments herein comprises a mechanism where instead of utilizing a single swarm to handle the blockchain communication, embodiments herein are not limited to transaction-based communication but also allows the data to be stored in a blockchain in regard to file storage as well. Some embodiments herein, comprises a Multi- SWARM mechanism where within embodiments herein, there are multiple communication layers for network nodes depending on the type of communication, e.g. with functionality as illustrated in Figure 1. There may be one or more number of swarms 130, 131 within embodiments herein. In some embodiments, a blockchain is using the one or more swarms 130, 131 for e.g. cryptocurrency communication and file storage communication. Methods, e.g. algorithms, used herein distribute messages by two different mechanisms to ensure optimal distribution of resources takes place and reduces a network latency and/or network congestion. A network node may either be FULL-SYNC and META-SYNC node in it. In other words, a network node in the one or more swarms 130, 131 in the communications network may be a FULL-SYNC node or a META-SYNC node.

In some embodiments, FULL-SYNC nodes comprises a complete history of a blockchain and may be used for packets, e.g. communicated packets, comprising complete data of a block. In other words, FULL-SYNC nodes comprises fully synchronized data of a blockchain.

In some embodiments, META-SYNC nodes transmit only a data index in compressed form which may be used for data reconstruction. In other words, META SYNC nodes comprises partially synchronized data of a blockchain, wherein only a data index in compressed may be transmitted and used for data reconstruction.

In some embodiments, whenever one or more network nodes participate in communicating the data over a swarm, e.g. one or more network nodes, instead of relaying the complete data, the network nodes may only hold the index of the data, as the index may be used to lookup the data. In other words, the index in META-SYNC nodes may be mapped to a particular data.

Thus, a swarm may comprise only META-SYNC nodes or FULL-SYNC nodes to be used for storing different types of data.

In some embodiments, a resultant data is then compressed and shared in the swarms. This ensures that the data size may be kept at the minimum possible level.

In some embodiments, a node's status is then checked in the swarms, by using a heartbeat mechanism and pulse-based communication at each interval, for retrieving the status.

In some embodiments, the checked status may determine the node's synchronization state. Instead of distributing a complete root history, nodes are communicated with the latest state, e.g. only if it lies in the META-SYNC state.

In some embodiments, a node, instead of relying on its network resource, may then utilize the system resource to re-index or re-construct the data, e.g. if determined to be needed.

In some embodiments, pulse based communication may give the nodes the ability to carry out the communication in byte streams manner. When a node communicates over the network, a digital signal may be broadcasted by the node, e.g. comprising the streams of metadata. This metadata e.g. helps to re-index and reconstruct the required data if it is lost. By utilizing the multi-layering gossip mechanism, it may e.g. maintain integrity and achieve fast communication on the network.

The gossip communication involves the multi-layered gossip or the nested gossip mechanism, which means that the gossip is layered not only at the swarm level, e.g. by using different sets of one or more network nodes, but also at the node level, e.g. using different sets of protocols, computing units, resources, etc. The protocol is being implemented in embodiments herein and even may allow any blockchain solution to utilize a network channel of embodiments herein in any system at network level. In other words, transmission of data and/or metadata is transmitted in blockchain transactions and distributed in different network nodes in the communications network based on its type.

To perform the method actions above, the apparatus 101 is be configured to perform any the above actions 201-208.

The apparatus 101 may comprise an arrangement depicted in Figures 3a and 3b.

The apparatus 101 may comprise an input and output interface 300 configured to communicate with network nodes e.g. in blockchain systems. The input and output interface 300 may comprise a wireless receiver (not shown) and a wireless transmitter (not shown).

The apparatus 101 may further be configured to, e.g. by means of an obtaining unit 310 in the apparatus 101, obtain first data to transfer, wherein the first data has a first type of data describing what is to be transferred,

The apparatus 101 may further be configured to, e.g. by means of the obtaining unit 310 in the apparatus 101 , obtain second data to transfer, wherein the second data has a second type of data describing what is to be transferred.

The apparatus 101 may further be configured to, e.g. by means of a determining unit 320 in the apparatus 101, based on the type of first data, determine a first communication configuration.

The apparatus 101 may further be configured to, e.g. by means of the determining unit 320 in the apparatus 101, based on the type of second data, determine a second communication configuration. The apparatus 101 may further be configured to, e.g. by means of a selecting unit 340 in the apparatus 101, based on the first communication configuration, out of multiple sets of one or more network nodes, select a first set of one or more network nodes for handling communication of the first data. The apparatus 101 may further be configured to, e.g. by means of the selecting unit 340 in the apparatus 101, based on the second communication configuration, out of multiple sets of one or more network nodes, select a second set of one or more network nodes for handling communication of the second data. The apparatus 101 may further be configured to, e.g. by means of a transferring unit 330 in the apparatus 101, transfer the first data as a blockchain transaction, using the first set of one or more network nodes e.g. by transferring the first data to one or more of the network nodes in the first set.

The apparatus 101 may further be configured to, e.g. by means of the transferring unit 330 in the apparatus 101, transfer the second data as a blockchain transaction using the second set of one or more network nodes by transferring the second data to one or more of the network nodes in the second set. The embodiments herein may be implemented through a respective processor or one or more processors, such as the processor 360 of a processing circuitry in the apparatus 101 depicted in Figure 3a, together with respective computer program code for performing the functions and actions of the embodiments herein. The program code mentioned above may also be provided as a computer program product, for instance in the form of a data carrier carrying computer program code for performing the embodiments herein when being loaded into the apparatus 101. One such carrier may be in the form of a CD ROM disc. It is however feasible with other data carriers such as a memory stick. The computer program code may furthermore be provided as pure program code on a server and downloaded to the apparatus 101.

The apparatus 101 may further comprise a memory 370 comprising one or more memory units. The memory 370 comprises instructions executable by the processor in apparatus 101. The memory 370 may be arranged to be used to store e.g. information, indications, data, configurations, and applications to perform the methods herein when being executed in the apparatus 101. In some embodiments, a computer program 380 comprises instructions, which when executed by the respective at least one processor 360, cause the at least one processor of the apparatus 101 to perform the actions above.

In some embodiments, a respective carrier 390 comprises the respective computer program 380, wherein the carrier 390 may be one of an electronic signal, an optical signal, an electromagnetic signal, a magnetic signal, an electric signal, a radio signal, a microwave signal, or a computer-readable storage medium.

Those skilled in the art will appreciate that the units in the apparatus 101 described above may refer to a combination of analog and digital circuits, and/or one or more processors configured with software and/or firmware, e.g. stored in the apparatus 101, that when executed by the respective one or more processors such as the processors described above. One or more of these processors, as well as the other digital hardware, may be included in a single Application-Specific Integrated Circuitry (ASIC), or several processors and various digital hardware may be distributed among several separate components, whether individually packaged or assembled into a system-on-a-chip (SoC). When using the word "comprise" or “comprising” it shall be interpreted as non limiting, i.e. meaning "consist at least of".

The embodiments herein are not limited to the above described preferred embodiments. Various alternatives, modifications and equivalents may be used.

Claims

1. A method for handling secure communication using one or more blockchains, in a communications network, the method comprising: obtaining (201) first data to transfer, wherein the first data has a first type of data describing what is to be transferred, based on the type of first data, determining (202) a first communication configuration, based on the first communication configuration, out of multiple sets of one or more network nodes, selecting (203) a first set of one or more network nodes for handling communication of the first data, transferring (204) the first data as a blockchain transaction, using the first set of one or more network nodes. obtaining (205) second data to transfer wherein the second data has a second type of data describing what is to be transferred, based on the type of second data, determining (206) a second communication configuration, based on the second communication configuration, out of multiple sets of one or more network nodes, selecting (207) a second set of one or more network nodes for handling communication of the second data, transferring (208) the second data, e.g. as a blockchain transaction, using the second set of one or more network nodes by transferring the second data to one or more of the network nodes in the second set.

2. The method according to claim 1 wherein the method is performed by any one out of: a computing device a network node (101), a blockchain system (101), and a distributed system (101).

3. A computer program (380) comprising instructions, which when executed by a processor (360), causes the processor (360) to perform actions according to any of the claims 1-2.

4. A carrier (390) comprising the computer program (380) of claim 3, wherein the carrier (390) is one of an electronic signal, an optical signal, an electromagnetic signal, a magnetic signal, an electric signal, a radio signal, a microwave signal, or a computer-readable storage medium.

5. An apparatus (101) configured to handle secure communication using one or more blockchains in a communications network, the apparatus 101 further being configured to: obtain first data to transfer, wherein the first data has a first type of data, describing what is to be transferred, based on the type of first data, determine a first communication configuration, based on the first communication configuration, out of multiple sets of one or more network nodes, select a first set of one or more network nodes for handling communication of the first data, transfer the first data as a blockchain transaction, using the first set of one or more network nodes, obtain second data to transfer, wherein the second data has a second type of data describing what is to be transferred, based on the second data, e.g. the type of second data, determine a second communication configuration, based on the second communication configuration, out of multiple sets of one or more network nodes, select a second set of one or more network nodes for handling communication of the second data, transfer the second data as a blockchain transaction, using the second set of one or more network nodes by transferring the second data to one or more of the network nodes in the second set.