最新区块链论文速读--CCF C会议 ICPADS 2023 共28篇附pdf下载（3/4）

标签：区块速读 chain -- blockchain 分片 based CCF data

Conference：International Conference on Parallel and Distributed Systems (ICPADS)

CCF level：CCF C

Categories：Computer Architecture/Parallel and Distributed Computing/Storage Systems

Year：2023

Num：28

第1~7篇区块链文章请点击此处查看

第8~14篇区块链文章请点击此处查看

Title:

Blockchain-based Pricing Mechanism Research on IoT Data Transactions

基于区块链的物联网数据交易定价机制研究

Authors:

Key words:

Data trading, Stackelberg game, Blockchain, Reinforcement learning

数据交易、Stackelberg 博弈、区块链、强化学习

Abstract:

At the current stage, data trading is still in the initial stage, there is no mature pricing mechanism, and it is difficult to realize the effective use of data resources.In order to incentivize the better circulation of data and give full play to the value of data, it is necessary to build a pricing mechanism for data transactions between data owners and data requesters. To address the above issues, this paper proposes a blockchain-based data transaction pricing mechanism. First, for the privacy and security of data, we adopt a blockchain-based architecture to guarantee the security of the transaction data and at the same time satisfy the arbitration of data transactions. Second, we formulate a pricing scheme based on data quality to provide a basis for further game dynamic pricing; then, in this paper, in order to incentivize both parties of the transaction to actively participate in the transaction and maximize the utility of both parties as much as possible, we construct a pricing model based on the Stackelberg game; lastly, we design an improved Double Deep Q Network (DDQN) reinforcement learning algorithm to optimize the strategy of pricing in data transactions. Experiments show that the pricing mechanism proposed in this paper improves the utility of both parties in the data pricing process, and improves the total benefit by 10% compared to the DQN algorithm.

现阶段，数据交易尚处于起步阶段，尚无成熟的定价机制，难以实现数据资源的有效利用。为了激励数据的更好地流通，充分发挥数据的价值，需要在数据拥有者和数据需求者之间构建数据交易的定价机制。针对以上问题，本文提出了一种基于区块链的数据交易定价机制。首先，为了数据的隐私性和安全性，采用基于区块链的架构，保障交易数据的安全，同时满足数据交易的仲裁；其次，制定基于数据质量的定价方案，为进一步的博弈动态定价提供依据；然后，为了激励交易双方积极参与交易，尽可能实现双方效用的最大化，本文构建了基于Stackelberg博弈的定价模型；最后，设计一种改进的双深度Q网络（DDQN）强化学习算法来优化数据交易的定价策略。实验表明，本文提出的定价机制提高了数据定价过程中双方的效用，与DQN算法相比总收益提高了10%。

Pdf link:

https://ieeexplore.ieee.org/document/10476285

Title:

S-chain: A Shard-based Blockchain Scheme for Cross-chain Supervision

S-chain：基于分片的跨链监管区块链方案

Authors:

Key words:

Blockchain, Cross-chain supervision, Sharding, Smart contract

区块链、跨链监管、分片、智能合约

Abstract:

With the popularization of consortium blockchain, how to supervise numerous business chains has become a problem. Recently, some researchers have proposed the concept of ‘governing chain by chain’, which means that multiple organizations deploy a consortium blockchain to supervise many business chains in the industry. However, as the number of business chains increases, a performance bottleneck occurs on the supervision chain. Sharding is a promising direction to improve scalability, but existing studies focus on public chains. If transplanted to the supervision chain, these solutions will bring two challenges. Firstly, data from multiple business chains will cause storage conflicts and unbalanced sharding. Secondly, sharding makes it difficult for inter-shard transaction validation. Aiming at the challenges, we propose S-chain, a shard-based supervision chain scheme. The contribution of our work lies in three points. Firstly, we design a unified label-based data sharding method that can evenly map data from different business chains to all shards without conflict. Secondly, we propose a mechanism to validate general smart-contract-based inter-shard transactions. At first, we design a smart contract splitting algorithm that splits one inter-shard smart contract into multiple sub-contracts and depicts their dependencies via a Directed Acyclic Graph(DAG). Then, we design an inter-shard transaction validation method by analyzing the dependencies of all sub-contracts. Finally, we implement a prototype system of S-chain and test its performance. The results show that our S-chain outperforms the scheme without sharding on throughput and storage overhead.

随着联盟链的普及，如何监管众多的业务链成为一个难题。近来，有研究者提出了“链治理”的概念，即多个组织部署联盟链来监管行业中的众多业务链。然而，随着业务链数量的增加，监管链上出现了性能瓶颈。分片是提高可扩展性的一个很有前途的方向，但现有的研究主要集中在公链上。如果将这些解决方案移植到监管链上，将带来两个挑战。首先，来自多条业务链的数据会导致存储冲突和分片不均衡。其次，分片使得分片间交易验证变得困难。针对这些挑战，我们提出了一种基于分片的监管链方案S-chain。我们的工作贡献在于三点。首先，我们设计了一种统一的基于标签的数据分片方法，可以将不同业务链的数据均匀地映射到所有分片上，而不会发生冲突。其次，我们提出了一种验证基于智能合约的通用分片间交易的机制。首先设计了智能合约拆分算法，将一个分片间智能合约拆分为多个子合约，并通过有向无环图（DAG）描述它们的依赖关系。然后，通过分析所有子合约的依赖关系，设计了分片间交易验证方法。最后，实现了 S-chain 的原型系统并测试了其性能。结果表明，我们的 S-chain 在吞吐量和存储开销方面优于无分片方案。

Pdf link:

https://ieeexplore.ieee.org/document/10476206

Title:

DarkTrans: A Blockchain-based Covert Communication Scheme with High Channel Capacity and Strong Concealment

DarkTrans：基于区块链的高通道容量、强隐蔽性隐秘通信方案

Authors:

Key words:

blockchain, covert communication, dynamic label, capacity, concealment

区块链、隐蔽通信、动态标签、容量、隐蔽性

Abstract:

Covert communication technology serves as a crucial tool for safeguarding not only the content of communication but also the identities of the parties involved. In this regard, blockchain emerges as a promising solution due to its decentralized nature, flood propagation of data, and inherent anonymity features. This makes blockchain an ideal candidate for covert communication channels, effectively addressing the weaknesses associated with traditional covert communication methods susceptible to detection, tracing, and interruption. However, the current efforts encounter obstacles like limited practicality, constrained channel capacity, and insufficient concealment capabilities, impeding their broad adoption in real-world scenarios. To address these issues, we propose DarkTrans, a blockchain-based covert communication scheme consisting of an address binary tree and a novel embedding mechanism. The address binary tree as a dynamic label method enables rapid recognition of specific transactions by the recipient, rendering detection by third parties challenging. The embedding mechanism encodes secret messages into transaction values for transmission to augment channel capacity, which can be practically realized within an Ethereum private blockchain. Our experiments with three aspects demonstrate that, compared with the existing scheme, DarkTrans achieves a low embedding time and a high channel capacity. Additionally, Kolmogorov-Smirnov test and sample entropy analysis are conducted to validate the robust concealment of this scheme.

隐蔽通信技术是保护通信内容和通信参与方身份的重要工具。在这方面，区块链因其去中心化特性、数据洪泛传播和固有匿名特性而成为一种有前途的解决方案。这使得区块链成为隐蔽通信渠道的理想候选者，有效地解决了传统隐蔽通信方法易被检测、追踪和中断的弱点。然而，目前的努力遇到了实用性有限、渠道容量受限和隐藏能力不足等障碍，阻碍了它们在现实场景中的广泛应用。为了解决这些问题，我们提出了 DarkTrans，这是一种基于区块链的隐蔽通信方案，由地址二叉树和一种新颖的嵌入机制组成。地址二叉树作为一种动态标签方法，使接收者能够快速识别特定交易，使第三方难以检测。嵌入机制将秘密消息编码为交易值以进行传输，以增强渠道容量，这可以在以太坊私有区块链中实际实现。通过三方面的实验表明，与现有方案相比，DarkTrans实现了较低的嵌入时间和较高的信道容量。此外，通过Kolmogorov-Smirnov检验和样本熵分析验证了该方案的鲁棒隐藏性。

Pdf link:

https://ieeexplore.ieee.org/document/10476008

Title:

SvaVoting: A Novel Secret Sharing-Based Verifiable and Anonymous E-Voting Scheme in Blockchain Systems

SvaVoting：区块链系统中一种基于秘密共享的新型可验证匿名电子投票方案

Authors:

Key words:

e-voting, secret sharing, identity-based ring signatures, cloud service provider, post-quantum cryptography

电子投票、秘密共享、基于身份的环签名、云服务提供商、后量子密码学

Abstract:

E-Voting systems play a vital role in various communities, aiming to enhance the efficiency, transparency, and citizen engagement in elections. However, as technology advances, ensuring the security and reliability of e-voting systems becomes profound. While researchers have explored the integration of blockchain technology to improve e-voting systems, there still are technical challenges, particularly regarding voters’ privacy, ballots’ confidentiality, and system performance. To address these challenges, we propose SvaVoting, an innovative blockchain-based e-voting scheme. SvaVoting utilizes the Borda counting method and the identity-based ring signature based on symmetric primitives to anonymously verify the validity of the voter’s identity and ballot format. In addition, we introduce secret sharing and a Cloud Service Provider (CSP) to conduct the final counting while preserving the privacy of the ballots. All users in the system can verify the results of CSP calculations, thereby meeting security goals such as correctness, unforgeability, anonymity and verifiability. The identity-based ring signature in our scheme provides 128-bit security, and even it can work in a quantum computing environment. Experimental results demonstrate that our solution significantly enhances the security and performance of e-voting systems, offering a practical path forward for future e-voting systems.

电子投票系统在各个社区中发挥着至关重要的作用，旨在提高选举的效率、透明度和公民参与度。然而，随着技术的进步，确保电子投票系统的安全性和可靠性变得至关重要。虽然研究人员已经探索了区块链技术的集成以改进电子投票系统，但仍然存在技术挑战，特别是在选民隐私、选票保密性和系统性能方面。为了应对这些挑战，我们提出了一种基于区块链的创新电子投票方案 SvaVoting。SvaVoting 利用 Borda 计数方法和基于对称原语的身份环签名来匿名验证选民身份和选票格式的有效性。此外，我们引入了秘密共享和云服务提供商 (CSP) 来进行最终计数，同时保护选票的隐私。系统中的所有用户都可以验证 CSP 计算的结果，从而满足正确性、不可伪造性、匿名性和可验证性等安全目标。方案中基于身份的环签名提供128位安全性，甚至可以在量子计算环境中工作。实验结果表明，该方案显著提高了电子投票系统的安全性和性能，为未来的电子投票系统提供了一条切实可行的发展道路。

Pdf link:

https://ieeexplore.ieee.org/document/10476179

Title:

Distributed Key Derivation for Multi-Party Management of Blockchain Digital Assets

区块链数字资产多方管理的分布式密钥派生

Authors:

Key words:

Blockchain, Distributed key derivation, Threshold signature, Digital assets

区块链，分布式密钥派生，门限签名，数字资产

Abstract:

The current Single-User Key Derivation (SKD) caters to individual management of blockchain’s tree-structured assets but falls short for threshold signatures aimed at multi-party control of blockchain assets. We introduce a Distributed Key Derivation (DKD) for collaborative management of these assets. Our DKD aligns with SKD and the prevalent Decentralized Key Generation (DKG) in threshold signatures, employing the GG18 DKG [1] protocol to safely refresh child keys without affecting the parent key or other nodes. It maintains the hierarchical structure while preventing privilege escalation attacks. Experimental tests show that our DKD’s key derivation time is about 240 μs, minor compared to GG18’s DKG time.

当前的单用户密钥派生 (SKD) 适用于区块链树状结构资产的个体管理，但对于旨在多方控制区块链资产的阈值签名而言，存在不足。我们引入了分布式密钥派生 (DKD) 来协作管理这些资产。我们的 DKD 与阈值签名中的 SKD 和流行的去中心化密钥生成 (DKG) 保持一致，采用 GG18 DKG [1] 协议来安全地刷新子密钥，而不会影响父密钥或其他节点。它在防止特权升级攻击的同时保持了层次结构。实验测试表明，我们的 DKD 的密钥派生时间约为 240 μs，与 GG18 的 DKG 时间相比要短得多。

Pdf link:

https://ieeexplore.ieee.org/document/10476163

Title:

A Federated Learning Scheme Based on Reputation Evaluation and Blockchain

基于声誉评估和区块链的联邦学习方案

Authors:

Key words:

Federated learning, Reputation evaluation, blockchain, differential privacy

联邦学习、声誉评估、区块链、差分隐私

Abstract:

Federated learning is an emerging distributed machine learning paradigm, where multiple data sources collaborate to train a model without sharing the original data, safeguarding user data privacy. Nevertheless, users, whether intentionally or unintentionally, may contribute low-quality data that can impact model quality or infer user information from the model parameters, potentially leading to privacy breaches. Selecting appropriate participants for training is still a challenge needing resolution. This paper introduces a federated learning scheme called FREB, which leverages a reputation evaluation mechanism and blockchain technology. The foundation of this scheme is blockchain, and it incorporates reputation as an indicator of participant reliability. Reputation is computed using a multi-weight subjective logic model. Before the training process begins, participants are chosen based on their reputation. Furthermore, the paper presents a novel model aggregation approach. By injecting noise into the uploaded model parameters, the scheme ensures that potential attackers cannot glean sensitive data information from the parameters. To validate the efficacy of FREB, the authors conducted simulation experiments using real datasets. The results of these experiments demonstrate that FREB is capable of thwarting malicious node attacks and promoting high-quality collaborative learning. It achieves this while preserving data privacy and maintaining model accuracy.

联邦学习是一种新兴的分布式机器学习范式，多个数据源协作训练模型而不共享原始数据，从而保护用户数据隐私。然而，用户可能会有意或无意地贡献低质量数据，从而影响模型质量或从模型参数推断用户信息，从而可能导致隐私泄露。选择合适的参与者进行训练仍然是一个需要解决的挑战。本文介绍了一种名为 FREB 的联邦学习方案，它利用了声誉评估机制和区块链技术。该方案的基础是区块链，它将声誉作为参与者可靠性的指标。声誉是使用多权重主观逻辑模型计算的。在训练过程开始之前，根据参与者的声誉进行选择。此外，本文还提出了一种新颖的模型聚合方法。通过向上传的模型参数中注入噪声，该方案可确保潜在攻击者无法从参数中获取敏感数据信息。为了验证 FREB 的有效性，作者使用真实数据集进行了模拟实验。这些实验的结果表明，FREB 能够阻止恶意节点攻击并促进高质量的协作学习。它在保护数据隐私和维持模型准确性的同时实现了这一点。

Pdf link:

https://ieeexplore.ieee.org/document/10475939

Title:

VI-Store: Towards Optimizing Blockchain-Oriented Verifiable Ledger Database

VI-Store：面向区块链的可验证账本数据库优化

Authors:

Key words:

Blockchain, Verifiable ledger database, State Data storage

区块链、可验证账本数据库、状态数据存储

Abstract:

This paper addresses the challenges associated with storing large amounts of state data on a blockchain by proposing a scalable verifiable ledger database. The rise of digital cryptocurrencies has drawn attention to blockchain technology and its potential benefits in terms of data security, system stability, and trust facilitation. However, existing blockchain-oriented systems face limitations in terms of performance and verifiability. Similarly, traditional ledger databases lack the ability to ensure verifiability of state data. To overcome these challenges, the proposed system introduces a scalable verifiable independent architecture named VI-Store, an improved Merkle tree structure called MMB-tree for state data at the billion level. The evaluation results demonstrate the effectiveness of the proposed system, MMB-tree outperforms traditional MBT and MPT index structures, and VI-Store is able to provide stable storage of billion-level state data over a 7*24 period. The findings suggest VI-Store can be used in real blockchain environments.

本文通过提出一种可扩展的可验证账本数据库来解决在区块链上存储大量状态数据所面临的挑战。数字xx货币的兴起引起了人们对区块链技术及其在数据安全、系统稳定性和信任促进方面的潜在优势的关注。然而，现有的面向区块链的系统在性能和可验证性方面面临限制。同样，传统的账本数据库缺乏确保状态数据可验证的能力。为了克服这些挑战，所提出的系统引入了一种可扩展的可验证独立架构 VI-Store，一种改进的 Merkle 树结构 MMB-tree，用于十亿级状态数据。评估结果证明了所提出的系统的有效性，MMB-tree 优于传统的 MBT 和 MPT 索引结构，VI-Store 能够在 7*24 期间提供十亿级状态数据的稳定存储。研究结果表明 VI-Store 可用于真实的区块链环境。