Vertical Federated Learning Based on Consortium Blockchain for Data Sharing in Mobile Edge Computing

The data in Mobile Edge Computing(MEC)contains tremendousmarket value,and data sharing canmaximize the usefulness of the data.However,certain data is quite sensitive,and sharing it directly may violate privacy.Vertical Federated Learning(VFL)is a secure distributed machine learning framework that completes joint model training by passing encryptedmodel parameters rather than raw data,so there is no data privacy leakage during the training process.Therefore,the VFL can build a bridge between data demander and owner to realize data sharing while protecting data privacy.Typically,the VFL requires a third party for key distribution and decryption of training results.In this article,we employ the consortium blockchain instead of the traditional third party and design a VFL architecture based on the consortium blockchain for data sharing in MEC.More specifically,we propose a V-Raft consensus algorithm based on Verifiable Random Functions(VRFs),which is a variant of the Raft.The VRaft is able to elect leader quickly and stably to assist data demander and owner to complete data sharing by VFL.Moreover,we apply secret sharing todistribute the private key to avoid the situationwhere the training result cannot be decrypted if the leader crashes.Finally,we analyzed the performance of the V-Raft and carried out simulation experiments,and the results show that compared with Raft,the V-Raft has higher efficiency and better scalability.

Asymmetric Consortium Blockchain and Homomorphically Polynomial-Based PIR for Secured Smart Parking Systems

In crowded cities,searching for the availability of parking lots is a herculean task as it results in the wastage of drivers’time,increases air pollution,and traffic congestion.Smart parking systems facilitate the drivers to determine the information about the parking lot in real time and book them depending on the requirement.But the existing smart parking systems necessitate the drivers to reveal their sensitive information that includes their mobile number,personal identity,and desired destination.This disclosure of sensitive information makes the existing centralized smart parking systems more vulnerable to service providers’security breaches,single points of failure,and bottlenecks.In this paper,an Improved Asymmetric Consortium Blockchain and Homomorphically Computing Univariate Polynomial-based private information retrieval(IACB-HCUPPIR)scheme is proposed to ensure parking lots’availability with transparency security in a privacy-preserving smart parking system.In specific,an improved Asymmetric Consortium Blockchain is used for achieving secure transactions between different parties interacting in the smart parking environment.It further adopted the method of Homomorphically Computing Univariate Polynomial-based private information retrieval(HCUPPIR)scheme for preserving the location privacy of drivers.The results of IACB-HCUPPIR confirmed better results in terms of minimized computation and communication overload with throughput,latency,and response time with maximized drivers’privacy preservation.Moreover,the proposed fully homomorphic algorithm(FHE)was compared against partial-homomorphic encryption(PHE)and technique without encryption and found that the proposed model has quick communication in allocating the parking slots starting with 24.3 s,whereas PHE starts allocating from 24.7 s and the technique without encryption starts at 27.4 s.Thus,we ensure the proposed model performs well in allocating parking slots with less time and high security with privacy preservation.

A Consortium Blockchain Paradigm on Hyperledger-Based Peer-to-Peer Lending System

This paper focuses on how to use consortium blockchain to improve the regulation of peer-to-peer(P2 P) lending market. The partial decentralized consortium blockchain with limited pre-set nodes can well improve transparency and security, which is suitable for financial regulation. Considering irregularities of the P2P lending market, the Hyperledger-based Peer-to-Peer Lending System(HyperP2PLS) is proposed. First elaborate the application scenario and business logic of the system, where a national P2P Lending Trading Center will be established to integrate all transactions and information of P2P lending market. Then construct the system architecture consisting of the blockchain network, HTTP server, and applications. The algorithm of implementation process and the web application for users have been well illustrated. The performance analysis shows that HyperP2PLS can guarantee the reliability, safety, transparency and efficiency.

A Trust-Based Hierarchical Consensus Mechanism for Consortium Blockchain in Smart Grid

As the smart grid develops rapidly,abundant connected devices offer various trading data.This raises higher requirements for secure and effective data storage.Traditional centralized data management does not meet the above requirements.Currently,smart grid with conventional consortium blockchain can solve the above issues.However,in the face of a large number of nodes,existing consensus algorithms often perform poorly in terms of efficiency and throughput.In this paper,we propose a trust-based hierarchical consensus mechanism(THCM)to solve this problem.Firstly,we design a hierarchical mechanism to improve the efficiency and throughput.Then,intra-layer nodes use an improved Raft consensus algorithm and inter-layer nodes use the Byzantine Fault Tolerance algorithm.Thirdly,we propose a trust evaluation method to improve the election process of Raft.Finally,we implement a prototype system to evaluate the performance of THCM.The results demonstrate that the consensus efficiency is improved by 19.8%,the throughput is improved by 12.34%,and the storage is reduced by 37.9%.

A Consensus and Incentive Program for Charging Piles Based on Consortium Blockchain

Charging piles are used for charging electric vehicles and are directly accessible to users in an energy internet entrance,while playing an important role in energy consumption.Currently,each enterprise constructs the center of operation and maintenance of their systems independently,along with their respective APP payment programs.This results in high operating costs,poor user experience,and low utilization rate of the pile,which limits the promotion and popularization of electric vehicles.To overcome this limitation,there is a need for a multi-center,fair,and transparent consortium blockchain,which can conform to the application requirements of a unified payment system and accommodate a range of diverse enterprise charging piles.In this paper,the design for a consensus and incentive program for consortium blockchain is presented.First,the application status of blockchain in an energy internet is described.Then,the logical structure and hierarchical model of the consortium blockchain are analyzed.Next,multicycle accounting and limiting the amount of accounting nodes in each round is presented to ensure the overhead of consensus remain constant.Finally,the accounting incentive mechanism and the bidding encouragement strategy based on“electric beans”are designed.

Raft Consensus Algorithm Based on Credit Model in Consortium Blockchain

As one of the underlying technologies of the blockchain,the consensus algorithm plays a vital role in ensuring security and efficiency.As a consensus algorithm for the private blockchain,Raft has better performance than the rest of the consensus algorithms,and it does not cause problems such as the concentrated hashing power,resource waste and fork.However,Raft can only be used in a non-byzantine environment with a small network size.In order to enable Raft to be used in a large-scale network with a certain number of byzantine nodes,this paper combines Raft and credit model to propose a Raft blockchain consensus algorithm based on credit model CRaft.In the node credit evaluation phase,RBF-based support vector machine is used as the anomaly detection method,and the node credit evaluation model is constructed.Then the Trust Nodes List(TNL)mechanism is introduced to make the consensus phase in a creditable network environment.Finally,the common node is synchronized to the consensus node to update the blockchain of the entire network.Experiments show that CRaft has better throughput and lower latency than the commonly used consortium blockchain consensus algorithm PBFT(Practical Byzantine Fault Tolerance).

UCBIS:An improved consortium blockchain information system based on UBCCSP

Blockchain technologies have been applied in many areas,from economics,the internet of things to the industrial internet.In order to solve the issue that the Hyperledger Fabric does not currently support Chinese Commercial Cryptographic(CCC)algorithms,we extended the Blockchain Cryptographic Service Provider(BCCSP)module in the Hyperledger Fabric by upgrading the original BCCSP module to support the CCC algorithms SM2 and SM3.Furthermore,we designed a transaction process by using UBCCSP(Upgraded BCCSP),and a new smart contract also has been presented.After that,an improved consortium blockchain information system based on UBCCSP named UCBIS(Consortium Blockchain Information System based on UBCCSP)is proposed.In the Hyperledger Fabric transaction process,the identity information and transaction data are protected by the SM2 and SM3 algorithms,moreover,SM3 is also used in the construction process of smart contracts.Our smart contracts reduce the total data amount and improve query efficiency.Finally,the information query system based on UBCCSP is implemented.After being tested and analyzed,the average time for every query is only 31.162 ms in the blockchain system,which has better performance and higher query efficiency.

Directed Acyclic Graph Blockchain for Secure Spectrum Sharing and Energy Trading in Power IoT

Peer-to-peer(P2P)spectrum sharing and energy trading are promising solutions to locally satisfy spectrum and energy demands in power Internet of Things(IoT).However,implementation of largescale P2P spectrum sharing and energy trading confronts security and privacy challenges.In this paper,we exploit consortium blockchain and Directed Acyclic Graph(DAG)to propose a new secure and distributed spectrum sharing and energy trading framework in power IoT,named spectrum-energy chain,where a set of local aggregators(LAGs)cooperatively confirm the identity of the power devices by utilizing consortium blockchain,so as to form a main chain.Then,the local power devices verify spectrum and energy micro-transactions simultaneously but asynchronously to form local spectrum tangle and local energy tangle,respectively.Moreover,an iterative double auction based micro transactions scheme is designed to solve the spectrum and energy pricing and the amount of shared spectrum and energy among power devices.Security analysis and numerical results illustrate that the developed spectrum-energy chain and the designed iterative double auction based microtransactions scheme are secure and efficient for spectrum sharing and energy trading in power IoT.

Cross-Domain Authentication Scheme Based on Blockchain and Consistent Hash Algorithm for System-Wide Information Management

System-wide information management(SWIM)is a complex distributed information transfer and sharing system for the next generation of Air Transportation System(ATS).In response to the growing volume of civil aviation air operations,users accessing different authentication domains in the SWIM system have problems with the validity,security,and privacy of SWIM-shared data.In order to solve these problems,this paper proposes a SWIM crossdomain authentication scheme based on a consistent hashing algorithm on consortium blockchain and designs a blockchain certificate format for SWIM cross-domain authentication.The scheme uses a consistent hash algorithm with virtual nodes in combination with a cluster of authentication centers in the SWIM consortium blockchain architecture to synchronize the user’s authentication mapping relationships between authentication domains.The virtual authentication nodes are mapped separately using different services provided by SWIM to guarantee the partitioning of the consistent hash ring on the consortium blockchain.According to the dynamic change of user’s authentication requests,the nodes of virtual service authentication can be added and deleted to realize the dynamic load balancing of cross-domain authentication of different services.Security analysis shows that this protocol can resist network attacks such as man-in-the-middle attacks,replay attacks,and Sybil attacks.Experiments show that this scheme can reduce the redundant authentication operations of identity information and solve the problems of traditional cross-domain authentication with single-point collapse,difficulty in expansion,and uneven load.At the same time,it has better security of information storage and can realize the cross-domain authentication requirements of SWIM users with low communication costs and system overhead.KEYWORDS System-wide information management(SWIM);consortium blockchain;consistent hash;cross-domain authentication;load balancing.

Consortium blockchains-based deep deterministic policy gradient algorithm for optimal electricity trading among households

To achieve higher energy utilization and lower generation cost for renewable sources(e.g., wind and solar energy), much work has been focused on demand response in smart grid(SG). Nonetheless, most existing studies consider energy trading with utility company which results in high energy loss from high voltage to low voltage and privacy leakage. Besides, there are relatively few researches devoted to electricity scheduling and price optimum among households without a third party. To cope with these issues, a novel deep deterministic policy gradient(DDPG)-based energy trading method with consortium blockchain(DETCB) is introduced. Firstly, in order to enhance system security, executing energy transaction among households is on the basis of consortium blockchain, which leads to not only anonymous trade but also public account. Moreover, the primary target from the aspect of the system is apparently the maximal social welfare, thus exploiting an iterative decision-making method combined with DDPG algorithm by non-profit controllers to obtain optimal trading prices and carry out optimal electricity allocation. To this end, security analysis demonstrates that DETCB contributes to creating a secure, stable and trustful environment. Furthermore, the excellent performance concerning social welfare, algorithm efficiency, and transaction energy sum is shown by numerical results.

基于区块链的医联体护理协同管理系统的设计与实现

目的:设计一种基于区块链的医联体护理协同管理系统,为实现医联体护理协同管理提供技术支持。方法:该系统基于联盟链的5层技术架构进行设计,通过Linux系统搭建Fabric开发环境及网络配置,采用智能合约和Java语言软件开发工具包实现用户界面操作,使用Bootstrap和Jquery等技术搭建前端Web界面、Spring Boot搭建系统后端,并通过加密算法、哈希运算、智能合约、共识机制等技术实现联盟链成员管理、业务管理、数据存储与共享、患者病历管理及平台监管5个功能模块。结果:该系统完善了优质护理资源下沉与连续性护理机制,重构了积分激励机制,促进了护理共生网络协同进化,并使多节点交互,形成了协同合力。结论:该系统顺应全新模式下医联体整合型护理服务的发展趋势,对提升护理核心竞争力等方面起到重要推动作用,同时为构建适用于医联体场景的区块链方案提供了借鉴。

基于变色龙哈希和可验证秘密共享的联盟链修改方法

区块链具有去中心化、不可篡改、可追溯等特征。现有的联盟链系统在数据上链后会全程留痕,当出现敏感信息或恶意数据时无法处理,或处理后区块链分叉、中断。针对这些问题,提出一种基于变色龙哈希和可验证秘密共享的联盟链数据修改方法。首先,把变色龙哈希的陷门再分配给身份节点,从而将发起修改者与实际修改者进行隔离;其次,为保证再分配值的正确性,将不同时间周期变色龙哈希所对应的数据设为可验证数据,用验证节点上传承诺到可验证数据,并用提案节点通过承诺验证秘密共享值;最后,为防止节点作恶,提出基于奖励金机制的数据纠正方法提高节点纠正作恶的积极性,降低作恶的可能。在中山大学区块链与智能金融研究中心InPlusLab开发的DApps数据集上进行实验的结果表明:当恶意节点数30个时,所提方法相较于用传统变色龙哈希修改联盟链数据的方法在处理恶意节点的效率方面提高了44.1%;当恶意数据量达到30条时,在处理恶意数据的时间上缩短了53.7%。

基于联盟式区块链的域名系统根区管理体系

当前互联网域名系统的中心化根体系伴随着长期的担忧:一方面担忧国家代码顶级域可能由于根权威职能被破坏而失控;另一方面担忧去中心化的根替代方案会导致域名空间分裂.上述担忧的根源在于当前和替代的根区管理在自治化和透明化上不足,导致对当前的根权威或替代方案的不信任.为解决上述问题,提出一种新的域名系统根区管理体系——根共识链,通过增强互信缓解各方担忧.根共识链中多个自治的注册局共同参与根区管理,每个注册局下辖国家代码顶级域和根服务器运营者,共同构建一个基于联盟式区块链的根区管理体系.根共识链在维护统一域名空间和唯一全球根权威的同时,通过根共识链管理者们建立根共同体提高自治性,通过区块链记录和执行各方协议以及根区操作提高透明性.基于现网科研测试床的实验结果表明,根共识链能够有效应对上述担忧,具有良好的可行性与实用性.

基于联盟链的跨组织数据交换操作一致性模型

在跨组织的数据共享与交换中,维护较强的操作一致性是实现有效的数据同步的重要技术保障。以区块链技术为基础,提出了一种提高跨组织数据交换操作一致性性能的模型,将联盟链作为写前日志,供数据库回溯未完成同步的数据,在联盟链中增设了指针结构,以降低回溯时长。同时,设计了链上存储请求的数据结构及共识算法,通过设置准入机制验证用户身份,保护数据安全以及用户隐私。最后通过仿真实验验证所提模型的有效性,并探讨了不同参数对相关性能指标的影响。结果表明,在不同的参数设定下,所提模型均能保障跨组织数据交换过程中的强一致性;且与基准模型相比,具有更高的请求执行效率;当链上数据量较大时,指针结构能够进一步提升模型性能。

基于超图和MuSig2聚合签名的联盟链主从多链共识机制

针对多链式区块链采用主链最终共识机制,导致主链负载大,制约从链性能等问题,论文提出一种基于超图和MuSig2聚合签名的联盟链主从多链共识机制.首先根据超图理论,构建以横贯超图为主链,子超图为从链的联盟链主从多链架构;然后借鉴分治思想,结合“背书-排序-验证”的共识方式,构建分层分类共识机制,通过分类处理交易降低主链负载压力;最后构建基于MuSig2聚合签名的联盟链多方背书签名方法,提升背书签名的验证效率.性能分析表明:基于MuSig2聚合签名的联盟链多方背书签名安全可靠,基于超图和MuSig2聚合签名的分层分类共识机制具有强一致性和线性时间复杂度.实验结果表明:基于MuSig2聚合签名的多方背书方法的总效率是椭圆曲线数字签名算法(Elliptic Curve Digital Signature Algorithm,ECDSA)的1.55倍,分层分类共识机制能够提升12.5%的共识效率.该机制具有较高性能,可满足企业多样化业务需求.

基于联盟链的可靠边缘计算任务卸载方法

随着移动终端尤其是工业互联网技术的快速发展,终端设备密集分布,无线带宽有限,经常导致业务过程中的集中式云资源调度,难以满足远程终端应用对低时延和低成本计算的需求.着眼于本地服务器联动云数据中心,边缘计算为这类移动应用提供了一种敏捷的计算服务模式.虽然边缘计算的敏捷服务模式能够有效缩短移动应用的时延并降低对应的通信成本,但在边缘计算环境下,异构资源之间的任务卸载经常会导致一些潜在的数据安全隐患和服务质量受损.针对上述应用挑战和技术发展趋势,本文提出了一种基于联盟链的可靠边缘计算任务卸载方法 .该方法利用联盟链进行身份校验和卸载结果反馈,以任务的完成时间、卸载成本与资源可靠度作为评价标准,设计了一种基于遗传算法的卸载策略,支持卸载决策时任务卸载的可靠性评估.实验结果表明,本文方法能在满足时延约束的前提下提高任务卸载的可靠性,为移动智能应用提供了一种有效的数据安全保障方法.

基于联盟链的公证信息可信存储系统研究与实现

传统公证业务中存在信息流通受限、数据易丢失和易被篡改等问题,为司法取证等工作带来不便。研究和设计的公证信息可信存储系统利用Hyperledger组件将公证处设为联盟节点,将公证过程中的关键数据计算为哈希摘要后上传,并可信存储到联盟链中以供查询,同时支持不同公证处对数据的细粒度访问权限控制。此外,实现公证数据全生命周期管理的功能,将用户对公证数据的全部操作记录在链上,为公证数据在业务流转过程中的操作监管提供支持。实验测试结果与分析表明,系统功能设计合理且性能良好。

基于可编辑医疗联盟链的数据安全管理方案

医疗数据的安全管理是确保患者隐私安全、有效开展医学诊疗与相关研究的关键。然而,现有的医疗数据管理方案大多存在透明度低、共享性差和无法保证患者隐私数据安全性的问题。通过设计一种“主-侧”链结构的可编辑区块链模型,提出了面向医疗联盟链的安全、可追责的医疗数据管理方案。该模型主链保存患者电子病历的最新信息,侧链记录历史修改证明,实现了数据管理的透明性和可追责性。引入变色龙哈希函数、秘密共享和可验证签名技术,只有通过验证的医疗机构的系统管理员才能够参与构建完整陷门,确保了医疗数据修改过程的正确性与安全性。经过安全性分析和相关实验模拟,该方案在计算开销、通信负载方面的性能较好,且在存储开销方面存在优势,表明了该方案的有效性和可行性。

营商环境评估的企业级复合区块链构建方法

针对现有营商环境评估系统中企业数据可信度低、易篡改的问题,提出营商环境评估的企业级复合区块链构建方法,采用链上和链下数据协同的方式,对企业原始数据进行存储.改进区块链哈希函数,提出基于SHA256算法的企业原始数据加密方法.引入Key-Value存储模式进行链下基于非易失性内存的Level DB存储,降低系统的通信和存储压力.提出数据链上存储方法,分别将Level DB中的Key值对应存储到基于DAG的Conflux公有链,企业状态数据对应存入到联盟链,为营商环境评估提供可信的存证数据.通过与改进前的Level DB数据库和现有的区块链存储模型进行实验对比,实验结果表明,提出的企业级复合区块链构建方法在读写性能、存储效率两方面均优于现有方法.

CS-Raft:适用于联盟链的拜占庭容错共识算法

针对目前联盟链共识算法的性能不足,提出了一种基于信用评分的可拜占庭容错联盟链共识算法CS-Raft。首先,为所有节点赋予信用评分属性,节点的信用评分根据节点的共识行为、活跃度、加入集群时间等指标进行更新,信用评分越高代表节点可信度越高;其次,根据节点信用评分选取监督节点,监督节点具有检验权,可以参与领导人选举,监督节点的设置可以有效抵抗拜占庭恶意节点的攻击;最后,改善了领导人选举中选票分裂问题,对领导人选举的速度进行提升。经实验分析,CS-Raft算法相较于PBFT算法在实现拜占庭容错的同时,有效地减少了共识时间延迟、提高了系统吞吐量,并加快了其领导人选举速度。