首页 > 最新文献

IET Blockchain最新文献

英文 中文
WASMOD: Detecting vulnerabilities in Wasm smart contracts WASMOD:检测Wasm智能合约中的漏洞
Pub Date : 2023-05-15 DOI: 10.1049/blc2.12029
Jianfei Zhou, Ting Chen

Over the past few years, blockchain platforms supporting WebAssembly (Wasm) smart contracts are gaining popularity. However, Wasm smart contracts are often compiled from memory-unsafe languages (e.g. C and C++). And there is a lack of effective defense against integer overflow and stack overflow at the compiler and virtual machine (VM) layers, making Wasm smart contracts even more exploitable than native C and C++ programs. In this paper, the authors propose wasm overflow detector (WASMOD) to address the integer overflow and stack overflow vulnerabilities. The authors’ approach combines bytecode instrumentation, run-time validation, and grey-box fuzzing to detect these vulnerabilities. The authors applied their approach to the popular EOSIO blockchain and evaluated it on 4616 deployed Wasm smart contracts. The authors’ approach detected 13 real-world vulnerable smart contracts.

在过去的几年里,支持WebAssembly (Wasm)智能合约的区块链平台越来越受欢迎。然而,Wasm智能合约通常是用内存不安全的语言(例如C和c++)编译的。而且,在编译器和虚拟机(VM)层缺乏对整数溢出和堆栈溢出的有效防御,这使得Wasm智能合约比本地C和c++程序更容易被利用。在本文中,作者提出了asm溢出检测器(WASMOD)来解决整数溢出和堆栈溢出漏洞。作者的方法结合了字节码检测、运行时验证和灰盒模糊测试来检测这些漏洞。作者将他们的方法应用于流行的EOSIO区块链,并在4616个部署的Wasm智能合约上进行了评估。作者的方法检测了13个现实世界中易受攻击的智能合约。
{"title":"WASMOD: Detecting vulnerabilities in Wasm smart contracts","authors":"Jianfei Zhou,&nbsp;Ting Chen","doi":"10.1049/blc2.12029","DOIUrl":"10.1049/blc2.12029","url":null,"abstract":"<p>Over the past few years, blockchain platforms supporting WebAssembly (Wasm) smart contracts are gaining popularity. However, Wasm smart contracts are often compiled from memory-unsafe languages (e.g. C and C++). And there is a lack of effective defense against integer overflow and stack overflow at the compiler and virtual machine (VM) layers, making Wasm smart contracts even more exploitable than native C and C++ programs. In this paper, the authors propose wasm overflow detector <b>(WASMOD)</b> to address the integer overflow and stack overflow vulnerabilities. The authors’ approach combines bytecode instrumentation, run-time validation, and grey-box fuzzing to detect these vulnerabilities. The authors applied their approach to the popular EOSIO blockchain and evaluated it on 4616 deployed Wasm smart contracts. The authors’ approach detected 13 real-world vulnerable smart contracts.</p>","PeriodicalId":100650,"journal":{"name":"IET Blockchain","volume":"3 4","pages":"172-181"},"PeriodicalIF":0.0,"publicationDate":"2023-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/blc2.12029","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74856433","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
FP-BFT: A fast pipeline Byzantine consensus algorithm FP-BFT:一种快速流水线拜占庭共识算法
Pub Date : 2023-05-14 DOI: 10.1049/blc2.12030
Xinlei Liu, Yang Liu, Xiangyang Li, Haohao Cao, Yaoqi Wang

The Byzantine Fault Tolerant (BFT) consensus algorithms have been widely applied in the blockchain systems because of their fault tolerance capability to determine system consistency in the presence of malicious nodes. However, the BFT consensus algorithms are confronted with low efficiency and scalability problems caused by multiple rounds of handshake communication. In this paper, a pipeline-based Fast Pipeline Byzantine Fault Tolerance consensus algorithm (FP-BFT) is proposed, which adopts a non-leader pipeline framework to process different rounds of transactions in parallel. By means of randomly selecting 2f+1 nodes to form a committee for one round of transactions, consensus agreement can be reached within the committee via nodes broadcasting and voting. Committee nodes participating in the consensus are chosen by chance to avoid the monopoly of which becomes the block producer. Consensus efficiency and the system throughput can be significantly improved with the pipeline framework. Comparison experiments are conducted to verify the superiority of the FP-BFT algorithm, and the theoretical proof is given to guarantee the Byzantine fault-tolerant security. Experimental results show that FP-BFT has improved the consensus efficiency by decreasing communication overhead to make it better applied both in public blockchain and consortium blockchain systems.

拜占庭容错(BFT)共识算法由于其在存在恶意节点的情况下确定系统一致性的容错能力,已在区块链系统中得到广泛应用。然而,BFT共识算法面临着由于多轮握手通信而导致的低效率和可扩展性问题。本文提出了一种基于流水线的快速流水线拜占庭容错共识算法(FP-BFT),该算法采用非前导流水线框架并行处理不同轮次的事务。通过随机选择2f+1个节点组成委员会进行一轮交易,可以通过节点广播和投票在委员会内部达成共识。参与共识的委员会节点是偶然选择的,以避免其垄断成为区块生产者。流水线框架可以显著提高共识效率和系统吞吐量。通过对比实验验证了FP-BFT算法的优越性,并给出了保证拜占庭容错安全性的理论证明。实验结果表明,FP-BFT通过降低通信开销提高了共识效率,使其更好地应用于公共区块链和联盟区块链系统。
{"title":"FP-BFT: A fast pipeline Byzantine consensus algorithm","authors":"Xinlei Liu,&nbsp;Yang Liu,&nbsp;Xiangyang Li,&nbsp;Haohao Cao,&nbsp;Yaoqi Wang","doi":"10.1049/blc2.12030","DOIUrl":"https://doi.org/10.1049/blc2.12030","url":null,"abstract":"<p>The Byzantine Fault Tolerant (BFT) consensus algorithms have been widely applied in the blockchain systems because of their fault tolerance capability to determine system consistency in the presence of malicious nodes. However, the BFT consensus algorithms are confronted with low efficiency and scalability problems caused by multiple rounds of handshake communication. In this paper, a pipeline-based Fast Pipeline Byzantine Fault Tolerance consensus algorithm (FP-BFT) is proposed, which adopts a non-leader pipeline framework to process different rounds of transactions in parallel. By means of randomly selecting 2<i>f</i>+1 nodes to form a committee for one round of transactions, consensus agreement can be reached within the committee via nodes broadcasting and voting. Committee nodes participating in the consensus are chosen by chance to avoid the monopoly of which becomes the block producer. Consensus efficiency and the system throughput can be significantly improved with the pipeline framework. Comparison experiments are conducted to verify the superiority of the FP-BFT algorithm, and the theoretical proof is given to guarantee the Byzantine fault-tolerant security. Experimental results show that FP-BFT has improved the consensus efficiency by decreasing communication overhead to make it better applied both in public blockchain and consortium blockchain systems.</p>","PeriodicalId":100650,"journal":{"name":"IET Blockchain","volume":"3 3","pages":"123-135"},"PeriodicalIF":0.0,"publicationDate":"2023-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/blc2.12030","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50141719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Zero-trust-based security model against data breaches in the banking sector: A blockchain consensus algorithm 针对银行业数据泄露的零信任安全模型:区块链共识算法
Pub Date : 2023-03-23 DOI: 10.1049/blc2.12028
Umair B. Chaudhry, Aysha K. M. Hydros

Cyber security in the banking sector is of high importance nowadays. The rate of cyberattacks is spiking every year, and the implementation of strong cybersecurity models is required to ensure the confidentiality and integrity of data. Since protecting a bank requires a wide range of security practices, this paper focuses on protecting the bank resources from malicious actors and securing the transactions using a blockchain consensus mechanism that uses a zero-trust security approach among the participants in the transaction. In addition to the framework, an algorithm for blockchain-based online transactions was designed to make use of practical implementation in the future. The ideas formulated during the research and literature review were integrated to design the framework and the algorithm. The proposed framework ensures that the security of the banking sector can be enhanced by adopting the zero-trust concept and blockchain technology. The consensus algorithms used for the transaction make it immutable and decentralized. Zero-trust principles adopted in the model ensure the confidentiality and integrity of the banking system.

如今,银行业的网络安全具有高度重要性。网络攻击的发生率每年都在飙升,需要实施强有力的网络安全模型来确保数据的机密性和完整性。由于保护银行需要广泛的安全实践,本文侧重于保护银行资源免受恶意行为者的攻击,并使用区块链共识机制保护交易安全,该机制在交易参与者之间使用零信任安全方法。除了该框架外,还设计了一种基于区块链的在线交易算法,以利用未来的实际实施。将研究过程中提出的思想和文献综述相结合,设计了框架和算法。拟议的框架确保通过采用零信任概念和区块链技术来增强银行业的安全性。用于事务的一致性算法使其不可变且去中心化。该模型采用的零信任原则确保了银行系统的机密性和完整性。
{"title":"Zero-trust-based security model against data breaches in the banking sector: A blockchain consensus algorithm","authors":"Umair B. Chaudhry,&nbsp;Aysha K. M. Hydros","doi":"10.1049/blc2.12028","DOIUrl":"https://doi.org/10.1049/blc2.12028","url":null,"abstract":"<p>Cyber security in the banking sector is of high importance nowadays. The rate of cyberattacks is spiking every year, and the implementation of strong cybersecurity models is required to ensure the confidentiality and integrity of data. Since protecting a bank requires a wide range of security practices, this paper focuses on protecting the bank resources from malicious actors and securing the transactions using a blockchain consensus mechanism that uses a zero-trust security approach among the participants in the transaction. In addition to the framework, an algorithm for blockchain-based online transactions was designed to make use of practical implementation in the future. The ideas formulated during the research and literature review were integrated to design the framework and the algorithm. The proposed framework ensures that the security of the banking sector can be enhanced by adopting the zero-trust concept and blockchain technology. The consensus algorithms used for the transaction make it immutable and decentralized. Zero-trust principles adopted in the model ensure the confidentiality and integrity of the banking system.</p>","PeriodicalId":100650,"journal":{"name":"IET Blockchain","volume":"3 2","pages":"98-115"},"PeriodicalIF":0.0,"publicationDate":"2023-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/blc2.12028","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50142222","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
K-Go: An executable formal semantics of Go language in K framework K-Go:K框架下Go语言的可执行形式语义
Pub Date : 2023-03-13 DOI: 10.1049/blc2.12024
Can Zhao, Qin Liu, Zonghua Hu, Ze Yu, Dejun Wang, Bo Meng

Go is a relatively new programming language and has become one of the most important programming languages used widely in blockchain. A formal semantics plays an important role in program synthesis, analysis and verification. The existed formal semantics of Go are not executable and do not cover the core features, hence, this paper presents an executable formal semantics for Go, called K-Go, using rewriting logic in K$mathbb{K}$ framework to make sure the semantics is both executable and applicable. K-Go includes syntax, configuration and rules and covers the declaration and definition of basic types, basic expression, concurrency, main statement data reading and writing based on channel. K-Go is validated by test set with 100% semantic coverage based on the official test suite. The evaluation experiment shows that K-Go is correct. Using formal semantics of Go language, building Go program synthesis, analysis and verification tools is easy for analyzing more characteristics of Go programs.

Go是一种相对较新的编程语言,已成为区块链中广泛使用的最重要的编程语言之一。形式语义在程序综合、分析和验证中起着重要作用。由于Go已有的形式语义是不可执行的,并且没有覆盖核心特征,因此,本文在K$mathbb{K}$框架中使用重写逻辑,提出了一种Go的可执行形式语义K-Go,以确保该语义是可执行的和可应用的。K-Go包括语法、配置和规则,涵盖了基本类型的声明和定义、基本表达式、并发性、基于通道的主语句数据读写。K-Go通过基于官方测试套件的100%语义覆盖的测试集进行验证。评价实验表明K-Go是正确的。利用Go语言的形式语义,构建Go程序的综合、分析和验证工具,可以方便地分析Go程序的更多特征。
{"title":"K-Go: An executable formal semantics of Go language in K framework","authors":"Can Zhao,&nbsp;Qin Liu,&nbsp;Zonghua Hu,&nbsp;Ze Yu,&nbsp;Dejun Wang,&nbsp;Bo Meng","doi":"10.1049/blc2.12024","DOIUrl":"https://doi.org/10.1049/blc2.12024","url":null,"abstract":"<p>Go is a relatively new programming language and has become one of the most important programming languages used widely in blockchain. A formal semantics plays an important role in program synthesis, analysis and verification. The existed formal semantics of Go are not executable and do not cover the core features, hence, this paper presents an executable formal semantics for Go, called K-Go, using rewriting logic in <math>\u0000 <semantics>\u0000 <mi>K</mi>\u0000 <annotation>$mathbb{K}$</annotation>\u0000 </semantics></math> framework to make sure the semantics is both executable and applicable. K-Go includes syntax, configuration and rules and covers the declaration and definition of basic types, basic expression, concurrency, main statement data reading and writing based on channel. K-Go is validated by test set with 100% semantic coverage based on the official test suite. The evaluation experiment shows that K-Go is correct. Using formal semantics of Go language, building Go program synthesis, analysis and verification tools is easy for analyzing more characteristics of Go programs.</p>","PeriodicalId":100650,"journal":{"name":"IET Blockchain","volume":"3 2","pages":"61-73"},"PeriodicalIF":0.0,"publicationDate":"2023-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/blc2.12024","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50140657","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Blockchain-based reliable image copyright protection 基于区块链的可靠图像版权保护
Pub Date : 2023-03-02 DOI: 10.1049/blc2.12027
Xiangli Xiao, Xiaotong He, Yushu Zhang, Xuewen Dong, Lu-Xing Yang, Yong Xiang

The indiscriminate distribution of a large number of unlicensed images through the Internet seriously harms the benefits of image owners, which prompts the study of image copyright protection solutions. Existing blockchain-free solutions are limited to using centralized servers to store copyright information, leaving data vulnerable to being lost or tampered with by external attacks. Although the blockchain-based image copyright protection solutions are capable of addressing the above problem, improvements are needed in choosing a suitable blockchain platform and supporting integrated copyright life cycle management. To this end, this paper designs a blockchain-based reliable image copyright protection system named BB-RICP using Hyperledger Fabric. For one thing, the adoption of Fabric mitigates the limitations of other blockchain platforms represented by Ethereum in terms of efficiency, economy, and availability. For another, BB-RICP successes in achieving integrated copyright lifecycle management. In addition, BB-RICP achieves enhanced applicability performance by firstly introducing GM algorithms recommended by Chinese national standard and adapting the more consortium blockchain-oriented practical byzantine fault tolerance algorithm. Moreover, the adoption of spread spectrum watermarking brings convenience to users. Finally, Kubernetes is used to assist in the simulation of BB-RICP to verify that users can operate reliably in the blockchain network.

大量未经许可的图像通过互联网肆意传播,严重损害了图像所有者的利益,这促使人们研究图像版权保护的解决方案。现有的无区块链解决方案仅限于使用集中式服务器存储版权信息,使数据容易丢失或被外部攻击篡改。虽然基于区块链的图像版权保护解决方案能够解决上述问题,但在选择合适的区块链平台和支持集成版权生命周期管理方面还需要改进。为此,本文利用Hyperledger Fabric设计了一个基于区块链的可靠图像版权保护系统BB-RICP。一方面,Fabric的采用减轻了以以太坊为代表的其他区块链平台在效率、经济性和可用性方面的局限性。另一方面,bb - icp成功地实现了集成版权生命周期管理。此外,BB-RICP首先引入了中国国家标准推荐的GM算法,并采用了更面向联盟区块链的实用拜占庭容错算法,提高了适用性。此外,扩频水印的采用给用户带来了方便。最后,使用Kubernetes协助模拟BB-RICP,以验证用户可以在区块链网络中可靠地运行。
{"title":"Blockchain-based reliable image copyright protection","authors":"Xiangli Xiao,&nbsp;Xiaotong He,&nbsp;Yushu Zhang,&nbsp;Xuewen Dong,&nbsp;Lu-Xing Yang,&nbsp;Yong Xiang","doi":"10.1049/blc2.12027","DOIUrl":"10.1049/blc2.12027","url":null,"abstract":"<p>The indiscriminate distribution of a large number of unlicensed images through the Internet seriously harms the benefits of image owners, which prompts the study of image copyright protection solutions. Existing blockchain-free solutions are limited to using centralized servers to store copyright information, leaving data vulnerable to being lost or tampered with by external attacks. Although the blockchain-based image copyright protection solutions are capable of addressing the above problem, improvements are needed in choosing a suitable blockchain platform and supporting integrated copyright life cycle management. To this end, this paper designs a blockchain-based reliable image copyright protection system named BB-RICP using Hyperledger Fabric. For one thing, the adoption of Fabric mitigates the limitations of other blockchain platforms represented by Ethereum in terms of efficiency, economy, and availability. For another, BB-RICP successes in achieving integrated copyright lifecycle management. In addition, BB-RICP achieves enhanced applicability performance by firstly introducing GM algorithms recommended by Chinese national standard and adapting the more consortium blockchain-oriented practical byzantine fault tolerance algorithm. Moreover, the adoption of spread spectrum watermarking brings convenience to users. Finally, Kubernetes is used to assist in the simulation of BB-RICP to verify that users can operate reliably in the blockchain network.</p>","PeriodicalId":100650,"journal":{"name":"IET Blockchain","volume":"3 4","pages":"222-237"},"PeriodicalIF":0.0,"publicationDate":"2023-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/blc2.12027","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82819508","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A decentralized crypto network with dynamic threshold change 具有动态阈值变化的去中心化加密网络
Pub Date : 2023-02-21 DOI: 10.1049/blc2.12026
Wenpeng Song, Xin Pei, Ming Li

The threshold proxy re-encryption (tPRE) algorithm not only ensures the separation of data ownership and use right, but also prevents a single data proxy from doing evil. In order to avoid collusion of multiple data proxies, this paper constructs a decentralized crypto network (DCN) based on blockchain technology and tPRE. DCN is more than a key management system, while expanding the data storage capacity of blockchain network. Combined with existing distributed storage schemes, it can store massive data. Due to Byzantine failure in distributed networks, the data proxy nodes can join or leave at will. In order to ensure that the number of data proxy nodes in the DCN network meets the requirements of the re-encryption threshold, and the data authorization operation can be carried out smoothly, this paper presents a dynamic refresh method of tPRE fragments. When there are fragments that meet the threshold number in the network, the allocation of encrypted fragments can be adjusted non-interactivity and self-adaptively. Non-interactivity means that each data proxy node independently refreshes its old fragments into new fragments without collecting old fragments from other nodes in the DCN, and then distributes the new fragments to other data proxy nodes in the DCN. Self-adaptability refers to monitoring the changes of data proxy node sets in the DCN, and automatically refreshing fragments. Finally, the performance of critical algorithms is calculated in the proposal.

阈值代理重新加密(tPRE)算法不仅保证了数据所有权和使用权的分离,而且防止了单个数据代理的邪恶行为。为了避免多个数据代理的合谋,本文构建了一个基于区块链技术和tPRE的去中心化加密网络。DCN不仅仅是一个密钥管理系统,同时扩展了区块链网络的数据存储能力。结合现有的分布式存储方案,它可以存储大量数据。由于分布式网络中拜占庭式的故障,数据代理节点可以随意加入或离开。为了确保DCN网络中数据代理节点的数量满足重新加密阈值的要求,并且数据授权操作能够顺利进行,本文提出了一种tPRE片段的动态刷新方法。当网络中存在满足阈值数量的片段时,加密片段的分配可以进行非交互性和自适应调整。非交互性是指每个数据代理节点在不收集DCN中其他节点的旧片段的情况下,将其旧片段独立刷新为新片段,然后将新片段分发给DCN中的其他数据代理节点。自适应是指监控DCN中数据代理节点集的变化,并自动刷新碎片。最后,对关键算法的性能进行了计算。
{"title":"A decentralized crypto network with dynamic threshold change","authors":"Wenpeng Song,&nbsp;Xin Pei,&nbsp;Ming Li","doi":"10.1049/blc2.12026","DOIUrl":"https://doi.org/10.1049/blc2.12026","url":null,"abstract":"<p>The threshold proxy re-encryption (tPRE) algorithm not only ensures the separation of data ownership and use right, but also prevents a single data proxy from doing evil. In order to avoid collusion of multiple data proxies, this paper constructs a decentralized crypto network (DCN) based on blockchain technology and tPRE. DCN is more than a key management system, while expanding the data storage capacity of blockchain network. Combined with existing distributed storage schemes, it can store massive data. Due to Byzantine failure in distributed networks, the data proxy nodes can join or leave at will. In order to ensure that the number of data proxy nodes in the DCN network meets the requirements of the re-encryption threshold, and the data authorization operation can be carried out smoothly, this paper presents a dynamic refresh method of tPRE fragments. When there are fragments that meet the threshold number in the network, the allocation of encrypted fragments can be adjusted non-interactivity and self-adaptively. Non-interactivity means that each data proxy node independently refreshes its old fragments into new fragments without collecting old fragments from other nodes in the DCN, and then distributes the new fragments to other data proxy nodes in the DCN. Self-adaptability refers to monitoring the changes of data proxy node sets in the DCN, and automatically refreshing fragments. Finally, the performance of critical algorithms is calculated in the proposal.</p>","PeriodicalId":100650,"journal":{"name":"IET Blockchain","volume":"3 2","pages":"116-122"},"PeriodicalIF":0.0,"publicationDate":"2023-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/blc2.12026","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50152998","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Blockchain-oriented location privacy preserving for cooperative spectrum sensing in 6G wireless networks 面向区块链的6G无线网络协同频谱感知位置隐私保护
Pub Date : 2023-02-15 DOI: 10.1049/blc2.12025
Roopa Vuppula, Himansu Shekhar Pradhan

In this article, the authors proposed a novel blockchain-oriented location privacy-preserving (BoLPP) for the Cooperative Spectrum Sensing (CSS) in 6G networks. In order to attain the sustainability of privacy and security for 6G wireless networks, it is a great challenge in this sensing as it faces various malicious attacks while the secondary user (SU) is active. To tackle these issues, the authors proposed a novel framework for blockchain-oriented Cognitive Radio Networks (CRNs) for CSS using an energy detection technique. Moreover, the authors implemented another novel paradigm BoLPP, to attain the privacy of SUs location for CSS in 6G networks. This approach preserves the SUs’ location and makes the BoLPP framework immune to all malicious attackers. The simulation results have been undergone based on the performance metrics such as response time, consistency, probability of false alarm, frame loss (%), average network throughput, energy efficiency, and security. The outcomes reveal that the proposed scheme achieves high security, privacy, energy efficiency, average network throughput, and low probability of false alarm and frame loss (%) when compared with the existing frameworks such as Friend or Foe (FoF) and Tidal Trust Algorithm (TTA) mechanisms. It is observed that the proposed BoLPP mechanism provides better security and privacy in 6G wireless networks.

在本文中,作者提出了一种新的面向区块链的位置隐私保护(BoLPP),用于6G网络中的协同频谱感知(CSS)。为了实现6G无线网络隐私和安全的可持续性,在二次用户(SU)活跃的情况下,它面临着各种恶意攻击,这是一个巨大的挑战。为了解决这些问题,作者使用能量检测技术为CSS提出了一个面向区块链的认知无线电网络(CRN)的新框架。此外,作者实现了另一种新的范式BoLPP,以获得6G网络中CSS的SU位置的隐私。这种方法保留了SU的位置,并使BoLPP框架免受所有恶意攻击者的攻击。仿真结果是基于响应时间、一致性、误报概率、帧丢失(%)、平均网络吞吐量、能效和安全性等性能指标得出的。结果表明,与现有的框架(如Friend or Foe(FoF)和Tidal Trust Algorithm(TTA)机制)相比,该方案具有较高的安全性、私密性、能效、平均网络吞吐量以及较低的虚警和帧丢失概率(%)。观察到,所提出的BoLPP机制在6G无线网络中提供了更好的安全性和私密性。
{"title":"Blockchain-oriented location privacy preserving for cooperative spectrum sensing in 6G wireless networks","authors":"Roopa Vuppula,&nbsp;Himansu Shekhar Pradhan","doi":"10.1049/blc2.12025","DOIUrl":"https://doi.org/10.1049/blc2.12025","url":null,"abstract":"<p>In this article, the authors proposed a novel blockchain-oriented location privacy-preserving (BoLPP) for the Cooperative Spectrum Sensing (CSS) in 6G networks. In order to attain the sustainability of privacy and security for 6G wireless networks, it is a great challenge in this sensing as it faces various malicious attacks while the secondary user (SU) is active. To tackle these issues, the authors proposed a novel framework for blockchain-oriented Cognitive Radio Networks (CRNs) for CSS using an energy detection technique. Moreover, the authors implemented another novel paradigm BoLPP, to attain the privacy of SUs location for CSS in 6G networks. This approach preserves the SUs’ location and makes the BoLPP framework immune to all malicious attackers. The simulation results have been undergone based on the performance metrics such as response time, consistency, probability of false alarm, frame loss (%), average network throughput, energy efficiency, and security. The outcomes reveal that the proposed scheme achieves high security, privacy, energy efficiency, average network throughput, and low probability of false alarm and frame loss (%) when compared with the existing frameworks such as Friend or Foe (FoF) and Tidal Trust Algorithm (TTA) mechanisms. It is observed that the proposed BoLPP mechanism provides better security and privacy in 6G wireless networks.</p>","PeriodicalId":100650,"journal":{"name":"IET Blockchain","volume":"3 2","pages":"74-97"},"PeriodicalIF":0.0,"publicationDate":"2023-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/blc2.12025","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50133219","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Waterfall: Gozalandia. Distributed protocol with fast finality and proven safety and liveness 瀑布:Gozalandia。分布式协议,快速终结,安全性和活跃性
Pub Date : 2023-01-28 DOI: 10.1049/blc2.12023
Sergii Grybniak, Yevhen Leonchyk, Igor Mazurok, Oleksandr Nashyvan, Ruslan Shanin

A consensus protocol is a crucial mechanism of distributed networks by which nodes can coordinate their actions and the current state of data. This article describes a BlockDAG consensus algorithm based on the Proof of Stake approach. The protocol provides network participants with cross-voting for the order of blocks, which, in the case of a fair vote, guarantees a quick consensus. Under conditions of dishonest behavior, cross-voting ensures that violations will be quickly detected. In addition, the protocol assumes the existence of a Coordinating network containing information about the approved ordering, which qualitatively increases security and also serves to improve network synchronization.

共识协议是分布式网络的一个关键机制,节点可以通过它来协调它们的行为和数据的当前状态。本文描述了一种基于权益证明方法的BlockDAG共识算法。该协议为网络参与者提供了对区块顺序的交叉投票,在公平投票的情况下,保证了快速达成共识。在不诚实行为的情况下,交叉投票确保违规行为将被迅速发现。此外,该协议假定存在一个协调网络,其中包含有关批准的排序的信息,这从质量上提高了安全性,也有助于改善网络同步。
{"title":"Waterfall: Gozalandia. Distributed protocol with fast finality and proven safety and liveness","authors":"Sergii Grybniak,&nbsp;Yevhen Leonchyk,&nbsp;Igor Mazurok,&nbsp;Oleksandr Nashyvan,&nbsp;Ruslan Shanin","doi":"10.1049/blc2.12023","DOIUrl":"10.1049/blc2.12023","url":null,"abstract":"<p>A consensus protocol is a crucial mechanism of distributed networks by which nodes can coordinate their actions and the current state of data. This article describes a BlockDAG consensus algorithm based on the Proof of Stake approach. The protocol provides network participants with cross-voting for the order of blocks, which, in the case of a fair vote, guarantees a quick consensus. Under conditions of dishonest behavior, cross-voting ensures that violations will be quickly detected. In addition, the protocol assumes the existence of a Coordinating network containing information about the approved ordering, which qualitatively increases security and also serves to improve network synchronization.</p>","PeriodicalId":100650,"journal":{"name":"IET Blockchain","volume":"3 4","pages":"182-193"},"PeriodicalIF":0.0,"publicationDate":"2023-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/blc2.12023","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89577277","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
An access control model for data security sharing cross-domain in consortium blockchain 联盟区块链中跨域数据安全共享的访问控制模型
Pub Date : 2023-01-06 DOI: 10.1049/blc2.12022
Yang Liu, Weidong Yang, Yanlin Wang, Yang Liu

With the rapid increment of the demand for data sharing among parties, data is considered a cornerstone component to provide value in the big data environment. Concerns regarding sharing data security have impeded the development of cross-domain data interaction. Therefore, an access control model for data security sharing cross-domain is proposed, Fabric-ABAC, that is based on Hyperledger Fabric and Attribute-based Access Control (ABAC). In order to solve the data security challenges caused by a trusted central organization implementation, a distributed environment is constructed that consists of stakeholders among parties. The unified attribute model is designed for multi-environment combined with smart contracts. Fabric-ABAC realizes multi-level, fine-grained, and auditable access control, enabling data security through automatic permission verification. Considering the ledger is visible to all participants in consortium blockchain, it is necessary to protect the confidentiality of sensitive data. Thus, Proxy Re-Encryption (PRE), which is implemented by smart contracts, is adopted in the scheme to realize the ciphertext interaction without the third party. The security of PRE and the access control model used in Fabric-ABAC is discussed to show that a secure environment for data sharing is provided. Moreover, the completeness of the implementation and effectiveness of the system performance in the multi-domain environment is demonstrated in the experimental results.

随着各方对数据共享需求的快速增长,数据被认为是在大数据环境中提供价值的基石组成部分。对共享数据安全的担忧阻碍了跨领域数据交互的发展。因此,在Hyperledger Fabric和基于属性的访问控制(ABAC)的基础上,提出了一种跨域数据安全共享的访问控制模型Fabric ABAC。为了解决由可信的中央组织实现引起的数据安全挑战,构建了一个由各方利益相关者组成的分布式环境。统一属性模型是为多环境和智能合约相结合而设计的。Fabric ABAC实现了多级、细粒度和可审核的访问控制,通过自动权限验证实现了数据安全。考虑到联盟区块链的所有参与者都可以看到账本,因此有必要保护敏感数据的机密性。因此,该方案采用了由智能合约实现的代理再加密(PRE),实现了无需第三方的密文交互。讨论了PRE的安全性和Fabric ABAC中使用的访问控制模型,表明为数据共享提供了一个安全的环境。此外,实验结果证明了系统在多域环境中实现的完整性和性能的有效性。
{"title":"An access control model for data security sharing cross-domain in consortium blockchain","authors":"Yang Liu,&nbsp;Weidong Yang,&nbsp;Yanlin Wang,&nbsp;Yang Liu","doi":"10.1049/blc2.12022","DOIUrl":"https://doi.org/10.1049/blc2.12022","url":null,"abstract":"<p>With the rapid increment of the demand for data sharing among parties, data is considered a cornerstone component to provide value in the big data environment. Concerns regarding sharing data security have impeded the development of cross-domain data interaction. Therefore, an access control model for data security sharing cross-domain is proposed, Fabric-ABAC, that is based on Hyperledger Fabric and Attribute-based Access Control (ABAC). In order to solve the data security challenges caused by a trusted central organization implementation, a distributed environment is constructed that consists of stakeholders among parties. The unified attribute model is designed for multi-environment combined with smart contracts. Fabric-ABAC realizes multi-level, fine-grained, and auditable access control, enabling data security through automatic permission verification. Considering the ledger is visible to all participants in consortium blockchain, it is necessary to protect the confidentiality of sensitive data. Thus, Proxy Re-Encryption (PRE), which is implemented by smart contracts, is adopted in the scheme to realize the ciphertext interaction without the third party. The security of PRE and the access control model used in Fabric-ABAC is discussed to show that a secure environment for data sharing is provided. Moreover, the completeness of the implementation and effectiveness of the system performance in the multi-domain environment is demonstrated in the experimental results.</p>","PeriodicalId":100650,"journal":{"name":"IET Blockchain","volume":"3 1","pages":"18-34"},"PeriodicalIF":0.0,"publicationDate":"2023-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/blc2.12022","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50133409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
A remote and cost-optimized voting system using blockchain and smart contract 使用区块链和智能合约的远程成本优化投票系统
Pub Date : 2023-01-05 DOI: 10.1049/blc2.12021
Mohammad Nabiluzzaman Neloy, Md. Abdul Wahab, Sheikh Wasif, Abdulla All Noman, Mustafizur Rahaman, Tahmid Hasan Pranto, A. K. M. Bahalul Haque, Rashedur M. Rahman

Traditional voting procedures are non-remote, time-consuming, and less secure. While the voter believes their vote was submitted successfully, the authority does not provide evidence that the vote was counted and tallied. In most cases, the anonymity of a voter is also not sure, as the voter's details are included in the ballot papers. Many voters consider this voting system untrustworthy and manipulative, discouraging them from voting, and consequently, an election loses a significant number of participants. Although the inclusion of electronic voting systems (EVS) has increased efficiency; however, it has raised concerns over security, legitimacy, and transparency. To mitigate these problems, blockchain technology has been leveraged and smart contract facilities with a combination of artificial intelligence (AI) to propose a remote voting system that makes the overall voting procedure transparent, semi-decentralized, and secure. In addition, a system that aids in boosting the number of turnouts in an election through an incentivization policy for the voters have also developed. Through the proposed virtual campaigning feature, the authority can generate a decent amount of revenue, which downsizes the overall cost of an election. To reduce the associated cost of transactions using smart contracts, this system implements a hybrid storage system where only a few cardinal data are stored in the blockchain network.

传统的投票程序是非远程、耗时且不太安全的。虽然选民相信他们的选票被成功提交,但当局没有提供证据证明选票被清点和计票。在大多数情况下,选民的匿名性也不确定,因为选票中包含了选民的详细信息。许多选民认为这种投票系统不可信,操纵性强,阻碍了他们投票,因此,选举失去了大量参与者。尽管电子投票系统(EVS)的加入提高了效率;然而,它引发了人们对安全性、合法性和透明度的担忧。为了缓解这些问题,区块链技术和智能合约设施与人工智能(AI)相结合,提出了一种远程投票系统,使整个投票过程透明、半去中心化和安全。此外,还制定了一个系统,通过对选民的激励政策来帮助提高选举的投票率。通过拟议的虚拟竞选功能,当局可以产生可观的收入,从而降低选举的总体成本。为了降低使用智能合约进行交易的相关成本,该系统实现了一个混合存储系统,其中只有少数基本数据存储在区块链网络中。
{"title":"A remote and cost-optimized voting system using blockchain and smart contract","authors":"Mohammad Nabiluzzaman Neloy,&nbsp;Md. Abdul Wahab,&nbsp;Sheikh Wasif,&nbsp;Abdulla All Noman,&nbsp;Mustafizur Rahaman,&nbsp;Tahmid Hasan Pranto,&nbsp;A. K. M. Bahalul Haque,&nbsp;Rashedur M. Rahman","doi":"10.1049/blc2.12021","DOIUrl":"https://doi.org/10.1049/blc2.12021","url":null,"abstract":"<p>Traditional voting procedures are non-remote, time-consuming, and less secure. While the voter believes their vote was submitted successfully, the authority does not provide evidence that the vote was counted and tallied. In most cases, the anonymity of a voter is also not sure, as the voter's details are included in the ballot papers. Many voters consider this voting system untrustworthy and manipulative, discouraging them from voting, and consequently, an election loses a significant number of participants. Although the inclusion of electronic voting systems (EVS) has increased efficiency; however, it has raised concerns over security, legitimacy, and transparency. To mitigate these problems, blockchain technology has been leveraged and smart contract facilities with a combination of artificial intelligence (AI) to propose a remote voting system that makes the overall voting procedure transparent, semi-decentralized, and secure. In addition, a system that aids in boosting the number of turnouts in an election through an incentivization policy for the voters have also developed. Through the proposed virtual campaigning feature, the authority can generate a decent amount of revenue, which downsizes the overall cost of an election. To reduce the associated cost of transactions using smart contracts, this system implements a hybrid storage system where only a few cardinal data are stored in the blockchain network.</p>","PeriodicalId":100650,"journal":{"name":"IET Blockchain","volume":"3 1","pages":"1-17"},"PeriodicalIF":0.0,"publicationDate":"2023-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/blc2.12021","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50130380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
期刊
IET Blockchain
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1