With the rapid development of blockchain technology, its network size has increased by hundreds or thousands of times. For large-scale blockchain networks, consensus algorithms need to be used to achieve consensus amo...
详细信息
ISBN:
(纸本)9798350349184;9798350349191
With the rapid development of blockchain technology, its network size has increased by hundreds or thousands of times. For large-scale blockchain networks, consensus algorithms need to be used to achieve consensus among dispersed nodes. Only blocks approved by more than half of the nodes can truly achieve blockchain. Therefore, communication efficiency in blockchain networks is crucial, and the excessive communication delay generated as the number of nodes increases can seriously affect the processing efficiency of blockchain systems. Therefore, we have designed a consensus mechanism based on grouping for the structural characteristics of P2P communication networks in blockchain systems, and a deep learning based grouping algorithm for the decentralized P2P networks. Through experiments, it can be seen that our algorithm can improve the communication efficiency of 74.3%-76.1% compared to the unoptimized decentralized P2P network nodes.
In this paper, a robust diffusion averageestimate normalized least mean square (NLMS) algorithm is proposed to tackle the impulsive noise in adjacent node communication links over distributednetworks. Compared with t...
详细信息
ISBN:
(纸本)9781665484855
In this paper, a robust diffusion averageestimate normalized least mean square (NLMS) algorithm is proposed to tackle the impulsive noise in adjacent node communication links over distributednetworks. Compared with the diffusion NLMS algorithm, the key point of the new algorithm is that it introduces two additional steps: robust detection and average estimation, thus greatly reducing the negative effects of the impulsive link noise. In addition, the mean stability of the proposed robust diffusion average-estimate NLMS algorithm is analyzed. Finally, Monte-Carlo simulation results demonstrate the effectiveness of the proposed robust diffusion algorithm.
The distributed Denial-of-Service (DDoS) attack is a crucial cybersecurity threat for Software-Defined Network (SDN). However, DDoS in SDN severely affect network availability which reduces the classifier performance....
详细信息
Chronic Kidney Disease (CKD) is a pervasive health challenge necessitating accurate and timely diagnosis to mitigate its progression and associated complications. This study proposes an innovative framework for CKD de...
详细信息
We use bipartite graphs to model compatibility constraints that arise between tasks and servers in data centers, cloud computing systems and content delivery networks. We prove that servers with skewed graph neighborh...
详细信息
This paper deals with local certification, specifically locally checkable proofs: given a graph property, the task is to certify whether a graph satisfies the property. The verification of this certification needs to ...
详细信息
We present an approach to developing secure system specifications for IoT systems with decentralized data using the Refinement-Risk cycle (RR-cycle), a method for security engineering implemented in the proof assistan...
详细信息
ISBN:
(纸本)9783031541285;9783031541292
We present an approach to developing secure system specifications for IoT systems with decentralized data using the Refinement-Risk cycle (RR-cycle), a method for security engineering implemented in the proof assistant Isabelle. The RR-cycle enables interleaving attack analysis with system refinement using rigorous machine assisted proof in Isabelle to scrutinize and refine system specifications until security requirements are met. We illustrate this approach by a case study of a privacy critical scenario by refining it with a distributed ledger. The case study is motivated by the IoT project SUCCESS on security and privacy of healthcare IoT applications. We briefly summarize the RR-cycle method before focusing on its application of identifying a privacy attack that leads to a security refinement introducing the distributed ledger.
Software-Defined Networking (SDN) is the innovative development in network technology with a number of attractive features, including management and flexibility. Despite these advantages, SDN was compromised by Distri...
详细信息
computer applications are transitioning from centralised to decentralised automation in the modern industrial era. The consensus algorithm is a critical component in decentralised applications. Wait-free consensus is ...
详细信息
computer applications are transitioning from centralised to decentralised automation in the modern industrial era. The consensus algorithm is a critical component in decentralised applications. Wait-free consensus is an unresolved issue in asynchronous systems. Deterministic protocols are known to be incapable of solving the wait-free consensus problem. Wait-free consensus protocol implementation occurs when all processors complete their predefined steps regardless of the execution speed of the other processors. Many randomised algorithms for wait-free consensus have been proposed, but no deterministic algorithm is possible. In this paper, we present a survey of wait-free consensus algorithms that have been studied and are currently being used in some well-known applications. There is also discussion of open issues and challenges in deploying various consensus mechanisms. This survey will provide a detailed understanding of the wait-free consensus protocol and will aid in the direction of research in the field of designing consensus algorithms.
Hardware-assisted enclaves with memory encryption have been widely adopted in the prevailing architectures, e.g., Intel SGX/TDX, AMD SEV, ARM CCA, etc. However, existing enclave designs fall short in supporting effici...
详细信息
ISBN:
(纸本)9781665476522
Hardware-assisted enclaves with memory encryption have been widely adopted in the prevailing architectures, e.g., Intel SGX/TDX, AMD SEV, ARM CCA, etc. However, existing enclave designs fall short in supporting efficient cooperation among cross-node enclaves (i.e., multi-machines) because the range of hardware memory protection is within a single node. A naive approach is to leverage cryptography at the application level and transfer data between nodes through secure channels (e.g., SSL). However, it incurs orders of magnitude costs due to expensive encryption/decryption, especially for distributed applications with large data transfer, e.g., MapReduce and graph computing. A secure and efficient mechanism of distributed secure memory is necessary but still missing. This paper proposes Migratable Merkle Tree (MMT), a design enabling efficient distributed secure memory to support distributed confidential computing. MMT sets up an integrity forest for distributed memory on multiple nodes. It allows an enclave to securely delegate an MMT closure, which contains both data and metadata of a subtree, to a remote enclave. By reusing the memory encryption mechanisms of existing enclaves, our design achieves secure data transfer without software re-encryption. We have implemented a prototype of MMT and a trusted firmware for management, and further applied MMT to real-world distributed applications. The evaluation results show that compared with existing systems using the AES-NI instruction, MMT can achieve up to 13x speedup on data transferring, and gain 12%similar to 58% improvement on the end-to-end performance of MapReduce and PageRank.
暂无评论