This paper presents a blockchain-based high-efficiency security strategy with blockchain ledger-based recovery algorithm for software-defined optical networks. Numerical results show the proposed strategy has less recovery latency and superior network performances.
The goal of this research is to estimate the data propagation time on the Bitcoin network. Using network coordinates, we estimate the communication latency between computers. Such latency estimation contributes future optimization of data propagation. In this research, we report an experiment on computing the network coordinates. In the current Bitcoin network, it is very difficult to acquire internode delay because the network topology is not available. In this study, we calculate the delay based on our topology estimation and describe the effectiveness of the network coordinates using various topology estimation parameters.
Bitcoin has a low transaction throughput. In order to allow for an increase of this throughput without increasing orphan blocks, decreasing the block propagation time is important. One of the techniques to improve its block propagation time is to utilize relay networks. However, the effects of utilizing relay networks is not apparent. Existing studies and measurements on relay networks have not focused on the effect of relay networks on the individual miners. Moreover, the relation between the degree of the effect and relay network utilization rate is unknown. Herein, we performed simulations while finely changing the proportion of nodes utilizing a relay network. Moreover we quantitatively evaluated the effect of relay networks on the entire Bitcoin network and individual miners. Results show that the propagation time decrease to approximately 77% of the original value if the utilization rate is set to 3%. This rate is close to the actual utilization rate of relay network "Falcon". We also found that the probability of blocks created by utilizing nodes to become orphan blocks is surprisingly smaller than that of the non-utilizing nodes. Even in the worst case, the value of utilizing nodes is 15% of the value of non-utilizing nodes.
We first present a blockchain-based trusted cloud radio over optical fiber network architecture (BlockONet) with anonymous access identification for future 5G fronthaul. The feasibility and efficiency of the architecture are experimentally verified on our testbed.
Cloud radio access network (C-RAN) interconnects thousands of terminal devices to support the services of Internet of Things (IoT) in 5G area. However, centralized access authentication of each terminal has been performed in mobile core network which causes an extremely high operating and capital expenditure of network. Traditional C-RAN cannot provide an authentic mechanism to guarantee the security of services and creditability of device and resource accessing with low network cost. We first propose a blockchain-based trusted authentication (BTA) architecture for 5G with blockchain-based anonymous access (BAA) scheme in cloud radio over fiber network. The feasibility and efficiency are verified on enhanced SDN testbed to enable blockchain as a service.
In many technical systems, such as smart grids, the central issue is to enable multiple devices to solve a resource allocation problem. Because centralized solutions usually struggle with an increasing number of agents, regio-central or completely decentralized mechanisms, which solve the problem in a cooperative manner, are of utmost interest in large-scale systems. In this paper, we present a coalition-based algorithm that allows a multi-agent system to cooperatively solve a single-resource allocation problem. Our approach uses self-organization to dynamically identify groups of agents whose decisions have to be coordinated, while optimistically refraining from coordinating the actions between these coalitions. The basic idea of our algorithm is inspired by the way pressure compensates in gas or fluid pipeline systems. It therefore operates on the basis of an overlay network, i.e., a graph, that defines a topology of possible resource flows as well as resistances in the form of costs of transferring a resource from one agent to another. Throughout this paper, the problem of compensating for imbalances between energy production and consumption in autonomous power management systems serves to illustrate our algorithm and results.
We present a general framework for constructing non-interactive universally composable (UC) commitment schemes that are secure against adaptive adversaries in the non-erasure setting under a single re-usable common reference string. Previously, such “fully-equipped ” UC commitment schemes are only known in [8, 9], with an unavoidable overhead of O(κ) in the sense of communication and computational complexities; meaning that to commit λ bits, the communication and computational costs require O(λκ), where κ denotes the security parameter. Efficient construction of a fully-equipped UC commitment scheme was a long-standing open problem. We introduce a cryptographic primitive, called all-but-many encryptions (ABMEs), and prove that it is a translation of fully-equipped UC commitment in the primitive level. We then construct ABMEs from cryptographic primitives that we call a probabilistic pseudo random function family and extractable sigma protocols – the former is a probabilistic version of a pseudo random function family and the latter is a special kind of sigma (i.e., canonical 3-round public-coin HVSZK) protocols with some extractability. We provide fully-equipped UC commitment schemes from ABMEs under DDH and DCR-based assumptions, respectively. In particular, the DCR-based scheme is the first fully-equipped UC commitment scheme with optimal expansion factor Ω(1); to commit κ bits, the communication and computational costs are Ω(κ). We further construct a fully-equipped UC commitment scheme from a general assumption (in which trap-door permutations exist), which is far more efficient than the previous construction [9], because, unlike [9], our construction does not require non-interactive zero-knowledge proof systems. 1