Blockchain using Proof-of-Interaction
英文摘要:
This paper we define a new Puzzle called Proof-of-Interaction and we show how it can replace, in the Bitcoin protocol, the Proof-of-Work algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
Jean-Philippe Abegg, Quentin Bramas, Thomas Noel
This paper we define a new Puzzle called Proof-of-Interaction and we show how it can replace, in the Bitcoin protocol, the Proof-of-Work algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
继续探索
Consensus mechanism is the heart of any blockchain network. Many projects have proposed alternative protocols to improve restricted scalability of Proof of Work originated since Bitcoin. As an improvement of Delegated Proof of Stake, in this paper, we introduce a novel consensus, namely, Delegated Proof of Reputation, which is scalable, secure with an acceptable decentralization. Our innovative idea is replacing pure coinstaking by a reputation ranking system essentially based on ranking theories (PageRank, NCDawareRank and HodgeRank).
Due to the increasing interest in blockchain technology for fostering secure, auditable, decentralized applications, a set of challenges associated with this technology need to be addressed. In this letter, we focus on the delay associated with Proof-of-Work (PoW)-based blockchain networks, whereby participants validate the new information to be appended to a distributed ledger via consensus to confirm transactions. We propose a novel end-to-end latency model based on batch-service queuing theory that characterizes timers and forks for the first time. Furthermore, we derive an estimation of op…
In the white book of Bitcion, Satoshi Nakamoto described a bitcoin system that can realize point-to-point online payment without a third-party organization. After supporting this magical application scenario and subverting the traditional centralized system, the blockchain technology has attracted worldwide attention, triggered a research upsurge of blockchain consensus algorithm, and produced a large number of innovative applications. Although various consensus algorithms continue to evolve with the iteration of blockchain products and applications, Proof of Work (POW) and Proof of Skake (POS…
Securing Blockchain-based IoT Systems with Physical Unclonable Functions and Zero-Knowledge Proofs
该研究提出在Hyperledger Fabric环境中集成PUFs与ZKPs的安全框架,用于区块链物联网系统的设备识别、隐私认证与交易处理,验证了其可行性、性能与抗攻击能力,提供了综合安全解决方案。
We propose a proof-of-work algorithm that rewards blockchain miners for using computational resources to solve NP-complete puzzles. The resulting blockchain will publicly store and improve solutions to problems with real world applications while maintaining a secure and fully functional transaction ledger.
Blockchain technology has been gaining great interest from a variety of sectors, including healthcare, supply chain and cryptocurrencies. However, Blockchain suffers from its limited ability to scale (i.e. low throughput and high latency). Several solutions have been appeared to tackle this issue. In particular, sharding proved that it is one of the most promising solutions to Blockchain scalability. Sharding can be divided into two major categories: (1) Sharding-based Proof-of-Work (PoW) Blockchain protocols, and (2) Sharding-based Proof-of-Stake (PoS) Blockchain protocols. The two categories…
A new variation of blockchain proof of work algorithm is proposed to incentivize the timely execution of image processing algorithms. A sample image processing algorithm is proposed to determine interesting images using analysis of the entropy of pixel subsets within images. The efficacy of the image processing algorithm is examined using two small sets of training and test data. The interesting image algorithm is then integrated into a simplified blockchain mining proof of work algorithm based on Bitcoin. The incentive of cryptocurrency mining is theorized to incentivize the execution of the …
Towards a low carbon proof-of-work blockchain
本文针对PoW区块链高能耗问题,提出以抽奖与PoVM虚拟机仿真替代hashcash等机制,并分析其共识管理缺口及相关系统。
Intuitively there is a drastic distinction between the pure decentralized block-chain systems like Defis and those that only utilize block-chain as an enhancing technology but remain centralized with real-world business model and conventional technologies like database, application server, etc. Our study explores extensively this distinction from a methodological point of view, classifies them into blockchain-complete and blockchain-partial, analyzes key features of the two types, and reveals the root cause of this distinction. We analyze the function or, in more strong words, the "ultimate pu…
Blockchain offers traceability and transparency to supply chain event data and hence can help overcome many challenges in supply chain management such as: data integrity, provenance and traceability. However, data privacy concerns such as the protection of trade secrets have hindered adoption of blockchain technology. Although consortium blockchains only allow authorised supply chain entities to read/write to the ledger, privacy preservation of trade secrets cannot be ascertained. In this work, we propose a privacy-preservation framework, PrivChain, to protect sensitive data on blockchain usin…
A blockchain is a decentralized ledger where all transactions are recorded. For having a reliable blockchain and double-spending prevention, we need a decentralized consensus and agreement on a blockchain. Bitcoin uses proof-of-work (PoW). It is a cryptographic puzzle that is difficult to solve but easy to verify. However, because of significant latency of proof-of-work for transactions confirmation, this consensus mechanism is vulnerable against double-spending. On the other hand, PoW consumes a significant amount of energy that by growing the network, it becomes a major problematic of this c…
Permissionless blockchains such as Bitcoin have long been criticized for their high computational and storage overhead. Unfortunately, while a number of proposals address the energy consumption of existing Proof-of-Work deployments, little attention has been given so far to remedy the storage overhead incurred by those blockchains. In fact, it seems widely acceptable that full nodes supporting the blockchains have to volunteer hundreds of GBs of their storage, to store and verify all transactions exchanged in the system. In this paper, we explore the solution space to effectively reduce the st…
In the paper, we present designs for multiple blockchain consensus primitives and a novel blockchain system, all based on the use of trusted execution environments (TEEs), such as Intel SGX-enabled CPUs. First, we show how using TEEs for existing proof of work schemes can make mining equitably distributed by preventing the use of ASICs. Next, we extend the design with proof of time and proof of ownership consensus primitives to make mining energy- and time-efficient. Further improving on these designs, we present a blockchain using a proof of luck consensus protocol. Our proof of luck blockcha…
Recently we could see several institutions coming together to create consortium based blockchain networks such as Hyperledger. Although for applications of blockchain such as Bitcoin, Litcoin, etc. the majority-attack might not be a great threat but for consortium based blockchain networks where we could see several institutions such as public, private, government, etc. are collaborating, the majority-attack might just prove to be a prevalent threat if collusion among these institutions takes place. This paper proposes a methodology where we can use intelligent software agents to monitor the a…
Efficient Zero-Knowledge Proofs for Set Membership in Blockchain-Based Sensor Networks: A Novel OR-Aggregation Approach
本文提出了一种针对区块链传感器网络的或聚合方法,优化了资源受限环境下的证明效率,提升了大规模部署中的证明大小、生成时间和验证效率。
Several types of networks that comprise unmanned aerial vehicles (UAV or drone) are being utilized in important applications such as emergency response, environment and infrastructure monitoring, defense and security, and commerce. In such networks, swarms of UAVs cooperate in executing one or more missions to achieve the application's objectives. The UAVs communicate with terrestrial networks by connecting to fixed or mobile ground control stations (GCS). The ability of drones to connect to online applications and offer services to Internet users has led to the proliferation of the Internet o…
The current humanitarian health crisis popularized the debate on data privacy. At the same time, several cities, states, and even countries put the mandatory presentation of health pass to access services into practice. In this article, we explore the concepts of self-sovereign identity, blockchain, and zero-knowledge proofs to propose a solution to the problem of presenting proof of vaccination. This solution allows users to prove that they are vaccinated for different pathogens without revealing their identity. The architecture is loosely coupled, allowing components to be exchanged, which w…
Privacy-preserving Blockchain-enabled Parametric Insurance via Remote Sensing and IoT
本文提出基于简洁零知识证明的隐私保护参数保险框架,通过零知识证明验证保险索赔的有效性和数据源真实性,提升透明度和效率,同时降低Gas成本80%。
Patients living in a digitized world can now interact with medical professionals through online services such as chat applications, video conferencing or indirectly through consulting services. These applications need to tackle several fundamental trust issues: 1. Checking and confirming that the person they are interacting with is a real person; 2. Validating that the healthcare professional has competence within the field in question; and 3. Confirming that the healthcare professional has a valid license to practice. In this paper, we present VerifyMed -- the first proof-of-concept platform,…
We propose a proof of mining system. Roughly speaking, in this system the mining stake ${\rm mstak}(A)$ with discrimination index $a\in[0,1]$ of an account $A$ is defined by the formula: $${\rm mstak}(A)=(1-a)\cdot\frac{1}{\rm NOM}+a\cdot\frac{{\rm NOBM}(A)}{L},$$ where $L$ is the length of the block-chain, ${\rm NOM}$ is the number of miners in the block-chain, and ${\rm NOBM}(A)$ is the number of blocks mined by $A$.
Proof-of-stake blockchain protocols are becoming one of the most promising alternatives to the energy-consuming proof-of-work protocols. However, one particularly critical threat in the PoS setting is the well-known long-range attacks caused by secret key leakage (LRSL attack). Specifically, an adversary can attempt to control/compromise accounts possessing substantial stake at some past moment such that double-spend or erase past transactions, violating the fundamental persistence property of blockchain. Puncturable signatures provide a satisfying solution to construct practical proof-of-stak…
A Double-Linked Blockchain Approach Based on Proof-of-Refundable-Tax Consensus Algorithm
本文提出双链区块链结构与可退税证明(PoRT)共识算法,通过可验证随机函数按可退税额选择维护者,以提升性能、防止Sybil攻击并维持财富分配稳定。
Aggregated Zero-knowledge Proof and Blockchain-Empowered Authentication for Autonomous Truck Platooning
本文提出聚合零知识证明与区块链赋能的身份认证方案,用于自动驾驶卡车编队的隐私保护身份验证,在毫秒级完成认证并提升安全性与系统韧性。
The proof-of-work consensus protocol suffers from two main limitations: waste of energy and offering only probabilistic guarantees about the status of the blockchain. This paper introduces SklCoin, a new Byzantine consensus protocol and its corresponding software architecture. This protocol leverages two ideas: 1) the proof-of-stake concept to dynamically form stake proportionate consensus groups that represent block miners (stakeholders), and 2) scalable collective signing to efficiently commit transactions irreversibly. SklCoin has immediate finality characteristic where all miners instantly…
Light clients, also known as Simple Payment Verification (SPV) clients, are nodes which only download a small portion of the data in a blockchain, and use indirect means to verify that a given chain is valid. Typically, instead of validating block data, they assume that the chain favoured by the blockchain's consensus algorithm only contains valid blocks, and that the majority of block producers are honest. By allowing such clients to receive fraud proofs generated by fully validating nodes that show that a block violates the protocol rules, and combining this with probabilistic sampling techn…
Gophy: Novel Proof-of-Useful-Work blockchain architecture for High Energy Physics
本研究提出名为Gophy的新型有用工作量证明区块链架构,用蒙特卡洛模拟替代哈希运算,将算力用于高能物理实验,同时保障许可链安全,配套代币激励矿工参与,预计2024年底开源。
Raziel combines secure multi-party computation and proof-carrying code to provide privacy, correctness and verifiability guarantees for smart contracts on blockchains. Effectively solving DAO and Gyges attacks, this paper describes an implementation and presents examples to demonstrate its practical viability (e.g., private and verifiable crowdfundings and investment funds). Additionally, we show how to use Zero-Knowledge Proofs of Proofs (i.e., Proof-Carrying Code certificates) to prove the validity of smart contracts to third parties before their execution without revealing anything else. Fi…
This paper presents a stochastic model for block arrival times based on the difficulty retargeting rule used in Bitcoin, as well as other proof-of-work blockchains. Unlike some previous work, this paper explicitly models the difficulty target as a random variable which is a function of the previous block arrival times and affecting the block times in the next retargeting period. An explicit marginal distribution is derived for the time between successive blocks (the blocktime), while allowing for randomly changing difficulty. This paper also aims to serve as an introduction to Bitcoin and proo…
This work proposes a novel proof-of-work blockchain incentive scheme such that, barring exogenous motivations, following the protocol is guaranteed to be the optimal strategy for miners. Our blockchain takes the form of a directed acyclic graph, resulting in improvements with respect to throughput and speed. More importantly, for our blockchain to function, it is not expected that the miners conform to some presupposed protocol in the interest of the system's operability. Instead, our system works if miners act selfishly, trying to get the maximum possible rewards, with no consideration for th…
In this paper, we identify a new form of attack, called the Balance attack, against proof-of-work blockchain systems. The novelty of this attack consists of delaying network communications between multiple subgroups of nodes with balanced mining power. Our theoretical analysis captures the precise tradeoff between the network delay and the mining power of the attacker needed to double spend in Ethereum with high probability. We quantify our probabilistic analysis with statistics taken from the R3 consortium, and show that a single machine needs 20 minutes to attack the consortium. Finally, we …
An enormous amount of energy is wasted in Proofof-Work (PoW) mechanisms adopted by popular blockchain applications (e.g., PoW-based cryptocurrencies), because miners must conduct a large amount of computation. Owing to this, one serious rising concern is that the energy waste not only dilutes the value of the blockchain but also hinders its further application. In this paper, we propose a novel blockchain design that fully recycles the energy required for facilitating and maintaining it, which is re-invested to the computation of deep learning. We realize this by proposing Proof-of-Deep-Learni…
SNARKChain: Proof-of-Useful-Work Blockchain Consensus with General-Purpose SNARK Marketplace
研究针对工作量证明能耗大问题,提出有用工作量证明共识协议,计算客户端外包的SNARK证明保障协议安全,还设计去中心化市场外包SNARK证明生成,成为首个满足工作量证明必要属性且在共识层运行的此类市场。
Scalable Zero-Knowledge Proofs for Verifying Cryptographic Hashing in Blockchain Applications
本文提出了一种生成和验证零知识证明的方法,用于确保加密哈希的计算完整性,重点在SHA-256算法上,利用Plonky2框架实现高效可扩展性。
Location-aware Verification for Autonomous Truck Platooning Based on Blockchain and Zero-knowledge Proof
本文针对动态卡车编队中的身份验证与隐私保护问题,提出一种基于零知识证明和许可区块链的位置感知验证协议,在局部区域内实现低延迟验证,并在Hyperledger平台上验证了其实用性。
Proof-of-randomness protocol for blockchain consensus: a case of Macau algorithms
针对区块链共识的公平性与能耗问题,提出基于TRNG和哈希的PoR协议,将其归为Macau类随机算法,并探讨QRNG硬件钱包集成及与QKD协作。
Enhanced Security and Efficiency in Blockchain with Aggregated Zero-Knowledge Proof Mechanisms
本文提出在 Merkle Trees 中聚合 Zero-Knowledge Proofs 的区块链验证方案,并基于真实 Ethereum 区块数据证明其可显著降低证明规模与计算开销。
Location-Based Services (LBSs) build upon geographic information to provide users with location-dependent functionalities. In such a context, it is particularly important that geographic locations claimed by users are trustworthy. Centralized verification approaches proposed in the last few years are not satisfactory, as they entail a high risk to the privacy of users. In this paper, we present and evaluate a novel decentralized, infrastructure-independent proof-of-location scheme based on blockchain technology. Our scheme guarantees both location trustworthiness and user privacy preservation.
Designing an efficient difficulty control algorithm is an essential problem in Proof-of-Work (PoW) based blockchains because the network hash rate is randomly changing. This paper proposes a general difficulty control algorithm and provides insights for difficulty adjustment rules for PoW based blockchains. The proposed algorithm consists a two-layer neural network. It has low memory cost, meanwhile satisfying the fast-updating and low volatility requirements for difficulty adjustment. Real data from Ethereum are used in the simulations to prove that the proposed algorithm has better performan…
The system proposed in this study uses zero-knowledge proof (ZKP) to verify the traceability of wood recorded in a public blockchain. Wood is a byproduct of several states, ranging from standing trees to logs, lumber, and wood products (hereinafter ``wood objects''). The advantage of using the blockchain for record keeping is that participants can freely record the information at their discretion, without any restrictions. However, the openness of the blockchain may allow a malicious third party to introduce disinformation. In this study, we employ ZKP and near-field communication (NFC) chips …
Generative Blockchain: Transforming Blockchain from Transaction Recording to Transaction Generation through Proof-of-Merit
本文提出生成式区块链新范式及 Proof-of-Merit (PoM) 共识机制,将交易生成与记录整合,并引入 DCP 平衡效率与公平,通过拼车场景仿真验证了其有效性。
In blockchain systems, especially cryptographic currencies such as Bitcoin, the double-spending and Byzantine-general-like problem are solved by reaching consensus protocols among all nodes. The state-of-the-art protocols include Proof-of-Work, Proof-of-Stake and Delegated-Proof-of-Stake. Proof-of-Work urges nodes to prove their computing power measured in hash rate in a crypto-puzzle solving competition. The other two take into account the amount of stake of each nodes and even design a vote in Delegated-Proof-of-Stake. However, these frameworks have several drawbacks, such as consuming a lar…
Truxen is a Trusted Computing enhanced blockchain that uses Proof of Integrity protocol as the consensus. Proof of Integrity protocol is derived from Trusted Computing and associated Remote Attestations, that can be used to vouch a node's identity and integrity to all of the other nodes in the blockchain network. In this paper we describe how Trusted Computing and Proof of Integrity can be used to enhance blockchain in the areas of mining block, executing transaction and smart contract, protecting sensitive data. Truxen presents a Single Execution Model, that can verify and execute transaction…
Blockchains rely on a consensus among participants to achieve decentralization and security. However, reaching consensus in an online, digital world where identities are not tied to physical users is a challenging problem. Proof-of-work provides a solution by linking representation to a valuable, physical resource. While this has worked well, it uses a tremendous amount of specialized hardware and energy, with no utility beyond blockchain security. Here, we propose an alternative consensus scheme that directs the computational resources to the optimization of machine learning (ML) models, a ta…
Securing Proof of Stake Blockchains: Leveraging Multi-Agent Reinforcement Learning for Detecting and Mitigating Malicious Nodes
本文提出MRL-PoS+共识算法,利用多智能体强化学习检测并消除PoS区块链中的恶意节点,通过惩罚-奖励机制有效抵御六种主要攻击,且不增加计算开销。
Blockchain-based consensus protocols present the opportunity to develop new protocols, due to their novel requirements of open participation and explicit incentivization of participants. To address the first requirement, it is necessary to consider the leader election inherent in consensus protocols, which can be difficult to scale to a large and untrusted set of participants. To address the second, it is important to consider ways to provide incentivization without relying on the resource-intensive proofs-of-work used in Bitcoin. In this paper, we propose a secure leader election protocol, Ca…
Blockchain protocols are based on a distributed database where stored data is guaranteed to be immutable. The requirement that all nodes have to maintain their own local copy of the database ensures security while consensus mechanisms help deciding which data gets added to the database and keep powerful adversaries from derailing the system. However, since the database that forms the foundation of a blockchain is a continuously growing list of blocks, scalability is an inherent problem of this technology. Some public blockchains need a few 100 GB to Terabytes of storage. In this work, we prese…
Blockchain relay schemes enable cross-chain state proofs without requiring trusted intermediaries. This is achieved by applying the source blockchain's consensus validation protocol on the target blockchain. Existing chain relays allow for the validation of blocks created using the Proof of Work (PoW) protocol. Since PoW entails high energy consumption, limited throughput, and no guaranteed finality, Proof of Stake (PoS) blockchain protocols are increasingly popular for addressing these shortcomings. We propose Verilay, the first chain relay scheme that enables validating PoS protocols that pr…
Although proof of work (PoW) consensus dominates the current blockchain-based systems mostly, it has always been criticized for the uneconomic brute-force calculation. As alternatives, energy-conservation and energy-recycling mechanisms heaved in sight. In this paper, we propose proof of user similarity (PoUS), a distinct energy-recycling consensus mechanism, harnessing the valuable computing power to calculate the similarities of users, and enact the calculation results into the packing rule. However, the expensive calculation required in PoUS challenges miners in participating, and may induc…
Proof-of-Useful-Work Blockchain for Trustworthy Biomedical Hyperdimensional Computing
本文提出HDCoin,首个用于超维计算的有用工作量证明区块链框架,将挖矿转为模型开发竞争,在四个生物医学数据集上探索关键超参数,确保模型可信、可验证。
FedChain: An Efficient and Secure Consensus Protocol based on Proof of Useful Federated Learning for Blockchain
针对区块链PoW共识能源浪费问题,提出基于有用联邦学习证明的FedChain共识协议,通过池聚合、秘密共享、模型优化及零知识验证实现高效安全的共识,经实验验证了性能。
Blockchain, the technology behind the popular Bitcoin, is considered a "security by design" system as it is meant to create security among a group of distrustful parties yet without a central trusted authority. The security of blockchain relies on the premise of honest-majority, namely, the blockchain system is assumed to be secure as long as the majority of consensus voting power is honest. And in the case of proof-of-work (PoW) blockchain, adversaries cannot control more than 50% of the network's gross computing power. However, this 50% threshold is based on the analysis of computing power o…
The progress of deep learning (DL), especially the recent development of automatic design of networks, has brought unprecedented performance gains at heavy computational cost. On the other hand, blockchain systems routinely perform a huge amount of computation that does not achieve practical purposes in order to build Proof-of-Work (PoW) consensus from decentralized participants. In this paper, we propose a new consensus mechanism, Proof of Learning (PoLe), which directs the computation spent for consensus toward optimization of neural networks (NN). In our mechanism, the training/testing data…
Federated learning may be subject to both global aggregation attacks and distributed poisoning attacks. Blockchain technology along with incentive and penalty mechanisms have been suggested to counter these. In this paper, we explore verifiable off-chain computations using zero-knowledge proofs as an alternative to incentive and penalty mechanisms in blockchain-based federated learning. In our solution, learning nodes, in addition to their computational duties, act as off-chain provers submitting proofs to attest computational correctness of parameters that can be verified on the blockchain. W…
This paper extends the blockchain sustainability framework of Budish (2018) to consider proof of stake (in addition to proof of work) consensus mechanisms and permissioned (where the number of nodes are fixed) networks. It is demonstrated that an economically sustainable network will involve the same cost regardless of whether it is proof of work or proof of stake although in the later the cost will take the form of illiquid financial resources. In addition, it is shown that regulating the number of nodes (as in a permissioned network) does not lead to additional cost savings that cannot other…
Medical Record Management System is an important information management system in healthcare centers and hospitals. Information kept in such systems need to be clean, correct and tamper-proof. In this paper, we take advantage of blockchains' tamper-proof and decentralization properties to develop a robust and secure electronic medical record management system. In particular we choose HyperLedger Fabric as our underlying technical architecture. HyperLedger Fabric yields higher throughput and lower latency compared with other blockchains, which is a perfect candidate for enterprise software deve…
Merged Bitcoin: Proof of Work Blockchains with Multiple Hash Types
合并比特币是一种使用多种哈希类型的区块链协议,通过难度调整方法优化攻击成本并缓解哈希优势不对称问题。
A blockchain faces two fundamental challenges. It must motivate users to maintain the system while preventing a minority of these users from colluding and gaining disproportionate control. Many popular public blockchains use monetary incentives to encourage users to behave appropriately. But these same incentive schemes create more problems than they solve. Mining rewards cause centralization in "proof of work" chains such as Bitcoin. Validator rewards and punishments invite attacks in "proof of stake" chains. This paper argues why these incentive schemes are detrimental to blockchain. It cons…
Blockchain protocols come with a variety of security guarantees. For example, BFT-inspired protocols such as Algorand tend to be secure in the partially synchronous setting, while longest chain protocols like Bitcoin will normally require stronger synchronicity to be secure. Another fundamental distinction, directly relevant to scalability solutions such as sharding, is whether or not a single untrusted user is able to point to *certificates*, which provide incontrovertible proof of block confirmation. Algorand produces such certificates, while Bitcoin does not. Are these properties accidental…
Blockchain systems based on a reusable resource, such as proof-of-stake (PoS), provide weaker security guarantees than those based on proof-of-work. Specifically, they are vulnerable to long-range attacks, where an adversary can corrupt prior participants in order to rewrite the full history of the chain. To prevent this attack on a PoS chain, we propose a protocol that checkpoints the state of the PoS chain to a proof-of-work blockchain such as Bitcoin. Our checkpointing protocol hence does not rely on any central authority. Our work uses Schnorr signatures and leverages Bitcoin recent Taproo…
Blockchain with proof of quantum work
本研究提出基于量子工作证明的区块链架构,利用量子计算机提高安全性并降低能耗,展示量子计算在区块链中的应用潜力。
扫码添加微信好友,提出您的宝贵建议 👇
💡 备注请填写:网站反馈
发表机构由 AI 从论文文本抽取,如发现错误,欢迎反馈修正建议。