{"title":"nPPoS:区块链非交互式实用存储证明","authors":"Jun Wook Heo, Gowri Ramachandran, 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, Gowri Ramachandran, 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}
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.
期刊介绍:
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.