可验证、高效的充电桩信誉跨链计算模型

IF 3.2 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Cui Zhang , Yunhua He , Bin Wu , Hui Yang , Ke Xiao , Hong Li
{"title":"可验证、高效的充电桩信誉跨链计算模型","authors":"Cui Zhang ,&nbsp;Yunhua He ,&nbsp;Bin Wu ,&nbsp;Hui Yang ,&nbsp;Ke Xiao ,&nbsp;Hong Li","doi":"10.1016/j.hcc.2023.100180","DOIUrl":null,"url":null,"abstract":"<div><p>To solve the current situation of low vehicle-to-pile ratio, charging pile (CP) operators incorporate private CPs into the shared charging system. However, the introduction of private CP has brought about the problem of poor service quality. Reputation is a common service evaluation scheme, in which the third-party reputation scheme has the issue of single point of failure; although the blockchain-based reputation scheme solves the single point of failure issue, it also brings the challenges of storage and query efficiency. It is a feasible solution to classify and store information on multiple chains, and at this time, reputation needs to be calculated in a cross-chain mode. Crosschain reputation calculation faces the problems of correctness verification, integrity verification and efficiency. Therefore, this paper proposes a verifiable and efficient cross-chain calculation model for CP reputation. Specially, in this model, we propose a verifiable cross-chain contract calculation scheme that adopts polynomial commitment to solve the problems of polynomial damage and tampering that may be encountered in the crosschain process of outsourced polynomials, so as to ensure the integrity and correctness of polynomial calculations. In addition, the miner selection and incentive mechanism algorithm in this scheme ensures the correctness of extracted information when the outsourced polynomial is calculated on the blockchain. The security analysis and experimental results demonstrate that this scheme is feasible in practice.</p></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"4 2","pages":"Article 100180"},"PeriodicalIF":3.2000,"publicationDate":"2023-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2667295223000788/pdfft?md5=46bf08c2626df49825af43279b2072d6&pid=1-s2.0-S2667295223000788-main.pdf","citationCount":"0","resultStr":"{\"title\":\"A verifiable and efficient cross-chain calculation model for charging pile reputation\",\"authors\":\"Cui Zhang ,&nbsp;Yunhua He ,&nbsp;Bin Wu ,&nbsp;Hui Yang ,&nbsp;Ke Xiao ,&nbsp;Hong Li\",\"doi\":\"10.1016/j.hcc.2023.100180\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>To solve the current situation of low vehicle-to-pile ratio, charging pile (CP) operators incorporate private CPs into the shared charging system. However, the introduction of private CP has brought about the problem of poor service quality. Reputation is a common service evaluation scheme, in which the third-party reputation scheme has the issue of single point of failure; although the blockchain-based reputation scheme solves the single point of failure issue, it also brings the challenges of storage and query efficiency. It is a feasible solution to classify and store information on multiple chains, and at this time, reputation needs to be calculated in a cross-chain mode. Crosschain reputation calculation faces the problems of correctness verification, integrity verification and efficiency. Therefore, this paper proposes a verifiable and efficient cross-chain calculation model for CP reputation. Specially, in this model, we propose a verifiable cross-chain contract calculation scheme that adopts polynomial commitment to solve the problems of polynomial damage and tampering that may be encountered in the crosschain process of outsourced polynomials, so as to ensure the integrity and correctness of polynomial calculations. In addition, the miner selection and incentive mechanism algorithm in this scheme ensures the correctness of extracted information when the outsourced polynomial is calculated on the blockchain. The security analysis and experimental results demonstrate that this scheme is feasible in practice.</p></div>\",\"PeriodicalId\":100605,\"journal\":{\"name\":\"High-Confidence Computing\",\"volume\":\"4 2\",\"pages\":\"Article 100180\"},\"PeriodicalIF\":3.2000,\"publicationDate\":\"2023-11-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2667295223000788/pdfft?md5=46bf08c2626df49825af43279b2072d6&pid=1-s2.0-S2667295223000788-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"High-Confidence Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2667295223000788\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"High-Confidence Computing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2667295223000788","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

为解决车桩比低的现状,充电桩运营商将私人充电桩纳入共享充电系统。然而,私人充电桩的引入带来了服务质量不高的问题。信誉是一种常见的服务评价方案,其中第三方信誉方案存在单点故障问题;基于区块链的信誉方案虽然解决了单点故障问题,但也带来了存储和查询效率的挑战。在多条链上对信息进行分类存储是一种可行的方案,此时需要以跨链模式计算声誉。跨链信誉计算面临着正确性验证、完整性验证和效率等问题。因此,本文提出了一种可验证且高效的 CP 信誉跨链计算模型。具体而言,在该模型中,我们提出了一种可验证的跨链合约计算方案,该方案采用多项式承诺的方式,解决了外包多项式在跨链过程中可能遇到的多项式损坏和篡改问题,从而保证了多项式计算的完整性和正确性。此外,该方案中的矿工选择和激励机制算法保证了外包多项式在区块链上计算时提取信息的正确性。安全分析和实验结果表明,该方案在实践中是可行的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A verifiable and efficient cross-chain calculation model for charging pile reputation

To solve the current situation of low vehicle-to-pile ratio, charging pile (CP) operators incorporate private CPs into the shared charging system. However, the introduction of private CP has brought about the problem of poor service quality. Reputation is a common service evaluation scheme, in which the third-party reputation scheme has the issue of single point of failure; although the blockchain-based reputation scheme solves the single point of failure issue, it also brings the challenges of storage and query efficiency. It is a feasible solution to classify and store information on multiple chains, and at this time, reputation needs to be calculated in a cross-chain mode. Crosschain reputation calculation faces the problems of correctness verification, integrity verification and efficiency. Therefore, this paper proposes a verifiable and efficient cross-chain calculation model for CP reputation. Specially, in this model, we propose a verifiable cross-chain contract calculation scheme that adopts polynomial commitment to solve the problems of polynomial damage and tampering that may be encountered in the crosschain process of outsourced polynomials, so as to ensure the integrity and correctness of polynomial calculations. In addition, the miner selection and incentive mechanism algorithm in this scheme ensures the correctness of extracted information when the outsourced polynomial is calculated on the blockchain. The security analysis and experimental results demonstrate that this scheme is feasible in practice.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
4.70
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信