MSCPR: A maintainable vector commitment-based stateless cryptocurrency system with privacy preservation and regulatory compliance

IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS Future Generation Computer Systems-The International Journal of Escience Pub Date : 2025-01-14 DOI:10.1016/j.future.2025.107713
Xingyu Yang, Lei Xu, Liehuang Zhu
{"title":"MSCPR: A maintainable vector commitment-based stateless cryptocurrency system with privacy preservation and regulatory compliance","authors":"Xingyu Yang,&nbsp;Lei Xu,&nbsp;Liehuang Zhu","doi":"10.1016/j.future.2025.107713","DOIUrl":null,"url":null,"abstract":"<div><div>In traditional account-based cryptocurrency systems, maintaining the <em>state</em> of all accounts consumes significant storage space. To reduce storage costs, recently some studies propose to leverage vector commitment schemes to design <em>stateless</em> cryptocurrency systems. In such systems, validators only need to store a commitment to the state vector to validate transactions. However, to prove membership in the state vector, each user is required to locally maintain a <em>position proof</em>. This introduces a burden as users need to update their proofs every time the commitment value changes. Additionally, existing stateless systems often include users’ account balances and transferred values in transactions explicitly, which compromises privacy. To address above issues, we propose a stateless cryptocurrency system based on a maintainable vector commitment scheme. In the proposed system, a bucketing technique is employed to simplify the proof update operations. And we leverage the homomorphic property of vector commitments to preserve the confidentiality of transactions. Furthermore, by constructing an anonymity set, transaction anonymity is ensured. To prevent adversaries from taking advantage of the anonymity, we design a predicate encryption-based regulation scheme. Through a series of simulations, we demonstrate that the proposed system is storage-efficient, with acceptable time overhead for privacy preservation and regulatory compliance.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107713"},"PeriodicalIF":6.2000,"publicationDate":"2025-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Future Generation Computer Systems-The International Journal of Escience","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167739X25000081","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

In traditional account-based cryptocurrency systems, maintaining the state of all accounts consumes significant storage space. To reduce storage costs, recently some studies propose to leverage vector commitment schemes to design stateless cryptocurrency systems. In such systems, validators only need to store a commitment to the state vector to validate transactions. However, to prove membership in the state vector, each user is required to locally maintain a position proof. This introduces a burden as users need to update their proofs every time the commitment value changes. Additionally, existing stateless systems often include users’ account balances and transferred values in transactions explicitly, which compromises privacy. To address above issues, we propose a stateless cryptocurrency system based on a maintainable vector commitment scheme. In the proposed system, a bucketing technique is employed to simplify the proof update operations. And we leverage the homomorphic property of vector commitments to preserve the confidentiality of transactions. Furthermore, by constructing an anonymity set, transaction anonymity is ensured. To prevent adversaries from taking advantage of the anonymity, we design a predicate encryption-based regulation scheme. Through a series of simulations, we demonstrate that the proposed system is storage-efficient, with acceptable time overhead for privacy preservation and regulatory compliance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
MSCPR:一个可维护的基于矢量承诺的无状态加密货币系统,具有隐私保护和法规遵从性
在传统的基于账户的加密货币系统中,维护所有账户的状态需要消耗大量的存储空间。为了降低存储成本,最近一些研究提出利用矢量承诺方案来设计无状态加密货币系统。在这样的系统中,验证器只需要将承诺存储到状态向量以验证事务。然而,为了证明状态向量中的成员资格,每个用户都需要在本地维护一个位置证明。这带来了负担,因为用户需要在每次承诺值更改时更新他们的证明。此外,现有的无状态系统通常显式地包含用户的帐户余额和交易中的转移值,这损害了隐私。为了解决上述问题,我们提出了一种基于可维护的矢量承诺方案的无状态加密货币系统。在该系统中,采用了桶式技术来简化证明更新操作。我们利用向量承诺的同态特性来保护事务的机密性。通过构造匿名集,保证了事务的匿名性。为了防止攻击者利用匿名性,我们设计了一个基于谓词加密的监管方案。通过一系列模拟,我们证明了所提出的系统具有存储效率,并且在隐私保护和法规遵从性方面具有可接受的时间开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
19.90
自引率
2.70%
发文量
376
审稿时长
10.6 months
期刊介绍: Computing infrastructures and systems are constantly evolving, resulting in increasingly complex and collaborative scientific applications. To cope with these advancements, there is a growing need for collaborative tools that can effectively map, control, and execute these applications. Furthermore, with the explosion of Big Data, there is a requirement for innovative methods and infrastructures to collect, analyze, and derive meaningful insights from the vast amount of data generated. This necessitates the integration of computational and storage capabilities, databases, sensors, and human collaboration. Future Generation Computer Systems aims to pioneer advancements in distributed systems, collaborative environments, high-performance computing, and Big Data analytics. It strives to stay at the forefront of developments in grids, clouds, and the Internet of Things (IoT) to effectively address the challenges posed by these wide-area, fully distributed sensing and computing systems.
期刊最新文献
Self-sovereign identity framework with user-friendly private key generation and rule table Accelerating complex graph queries by summary-based hybrid partitioning for discovering vulnerabilities of distribution equipment DNA: Dual-radio Dual-constraint Node Activation scheduling for energy-efficient data dissemination in IoT Blending lossy and lossless data compression methods to support health data streaming in smart cities Energy–time modelling of distributed multi-population genetic algorithms with dynamic workload in HPC clusters
×
引用
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