nPPoS:区块链非交互式实用存储证明

IF 6.9 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Blockchain-Research and Applications Pub Date : 2024-07-19 DOI:10.1016/j.bcra.2024.100221
Jun Wook Heo, Gowri Ramachandran, Raja Jurdak
{"title":"nPPoS:区块链非交互式实用存储证明","authors":"Jun Wook Heo,&nbsp;Gowri Ramachandran,&nbsp;Raja Jurdak","doi":"10.1016/j.bcra.2024.100221","DOIUrl":null,"url":null,"abstract":"<div><div>Blockchain full nodes are pivotal for transaction availability, as they store the entire ledger, but verifying their storage integrity faces challenges from malicious remote storage attacks such as Sybil, outsourcing, and generation attacks. However, there is no suitable proof-of-storage solution for blockchain full nodes to ensure a healthy number of replicas of the ledger. Existing proof-of-storage solutions are designed for general-purpose settings where a data owner uses secret information to verify storage, rendering them unsuitable for blockchain where proof-of-storage must be fast, publicly verifiable, and data owner-agnostic. This paper introduces a decentralised and quantum-resistant solution named <em>Non-interactive Practical Proof of Storage (nPPoS) with an asymmetric encoding and decoding scheme for fast and secure PoStorage and Zero-Knowledge Scalable Transparent Arguments of Knowledge (zk-STARKs)</em> for public variability in blockchain full nodes. The algorithm with asymmetric times for encoding and decoding creates unique block replicas and corresponding proofs for each storage node to mitigate malicious remote attacks and minimise performance degradation. The intentional resource-intensive encoding deters attacks, while faster decoding minimises performance overhead. Through zk-STARKs, nPPoS achieves public verifiability, enabling one-to-many verification for scalability, quantum resistance and decentralisation. It also introduces a two-phase randomisation technique and a time-weighted trustworthiness measurement for scalability and adaptability.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"5 4","pages":"Article 100221"},"PeriodicalIF":6.9000,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"nPPoS: Non-interactive practical proof-of-storage for blockchain\",\"authors\":\"Jun Wook Heo,&nbsp;Gowri Ramachandran,&nbsp;Raja Jurdak\",\"doi\":\"10.1016/j.bcra.2024.100221\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Blockchain full nodes are pivotal for transaction availability, as they store the entire ledger, but verifying their storage integrity faces challenges from malicious remote storage attacks such as Sybil, outsourcing, and generation attacks. However, there is no suitable proof-of-storage solution for blockchain full nodes to ensure a healthy number of replicas of the ledger. Existing proof-of-storage solutions are designed for general-purpose settings where a data owner uses secret information to verify storage, rendering them unsuitable for blockchain where proof-of-storage must be fast, publicly verifiable, and data owner-agnostic. This paper introduces a decentralised and quantum-resistant solution named <em>Non-interactive Practical Proof of Storage (nPPoS) with an asymmetric encoding and decoding scheme for fast and secure PoStorage and Zero-Knowledge Scalable Transparent Arguments of Knowledge (zk-STARKs)</em> for public variability in blockchain full nodes. The algorithm with asymmetric times for encoding and decoding creates unique block replicas and corresponding proofs for each storage node to mitigate malicious remote attacks and minimise performance degradation. The intentional resource-intensive encoding deters attacks, while faster decoding minimises performance overhead. Through zk-STARKs, nPPoS achieves public verifiability, enabling one-to-many verification for scalability, quantum resistance and decentralisation. It also introduces a two-phase randomisation technique and a time-weighted trustworthiness measurement for scalability and adaptability.</div></div>\",\"PeriodicalId\":53141,\"journal\":{\"name\":\"Blockchain-Research and Applications\",\"volume\":\"5 4\",\"pages\":\"Article 100221\"},\"PeriodicalIF\":6.9000,\"publicationDate\":\"2024-07-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Blockchain-Research and Applications\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2096720924000344\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Blockchain-Research and Applications","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2096720924000344","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

区块链全节点是交易可用性的关键,因为它们存储了整个账本,但验证其存储完整性面临着恶意远程存储攻击(如 Sybil、外包和生成攻击)的挑战。然而,目前还没有合适的区块链全节点存储证明解决方案来确保账本有健康的副本数量。现有的存储证明解决方案是为数据所有者使用秘密信息验证存储的通用设置而设计的,因此不适合区块链,因为区块链的存储证明必须快速、可公开验证,并且与数据所有者无关。本文介绍了一种名为 "非交互式实用存储证明(nPPoS)"的去中心化和抗量子解决方案,它采用非对称编码和解码方案,用于快速、安全的 PoStorage 和零知识可扩展透明知识论证(zk-STARKs),以实现区块链全节点的公共可变性。该算法的编码和解码时间不对称,为每个存储节点创建唯一的区块副本和相应的证明,以减轻恶意远程攻击并最大限度地减少性能下降。有意识的资源密集型编码可阻止攻击,而更快的解码可将性能开销降至最低。通过zk-STARKs,nPPoS实现了公共可验证性,实现了一对多的验证,从而实现了可扩展性、量子抗性和去中心化。它还引入了两阶段随机化技术和时间加权可信度测量,以实现可扩展性和适应性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
nPPoS: Non-interactive practical proof-of-storage for blockchain
Blockchain full nodes are pivotal for transaction availability, as they store the entire ledger, but verifying their storage integrity faces challenges from malicious remote storage attacks such as Sybil, outsourcing, and generation attacks. However, there is no suitable proof-of-storage solution for blockchain full nodes to ensure a healthy number of replicas of the ledger. Existing proof-of-storage solutions are designed for general-purpose settings where a data owner uses secret information to verify storage, rendering them unsuitable for blockchain where proof-of-storage must be fast, publicly verifiable, and data owner-agnostic. This paper introduces a decentralised and quantum-resistant solution named Non-interactive Practical Proof of Storage (nPPoS) with an asymmetric encoding and decoding scheme for fast and secure PoStorage and Zero-Knowledge Scalable Transparent Arguments of Knowledge (zk-STARKs) for public variability in blockchain full nodes. The algorithm with asymmetric times for encoding and decoding creates unique block replicas and corresponding proofs for each storage node to mitigate malicious remote attacks and minimise performance degradation. The intentional resource-intensive encoding deters attacks, while faster decoding minimises performance overhead. Through zk-STARKs, nPPoS achieves public verifiability, enabling one-to-many verification for scalability, quantum resistance and decentralisation. It also introduces a two-phase randomisation technique and a time-weighted trustworthiness measurement for scalability and adaptability.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
11.30
自引率
3.60%
发文量
0
期刊介绍: Blockchain: Research and Applications is an international, peer reviewed journal for researchers, engineers, and practitioners to present the latest advances and innovations in blockchain research. The journal publishes theoretical and applied papers in established and emerging areas of blockchain research to shape the future of blockchain technology.
期刊最新文献
Robust cooperative spectrum sensing in cognitive radio blockchain network using SHA-3 algorithm Partial pre-image attack on Proof-of-Work based blockchains Dual-blockchain based multi-layer grouping federated learning scheme for heterogeneous data in industrial IoT How can the holder trust the verifier? A CP-ABPRE-based solution to control the access to claims in a Self-Sovereign-Identity scenario Privacy-preserving pathological data sharing among multiple remote parties
×
引用
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