An Efficient Permissioned Blockchain with Provable Reputation Mechanism

• URL: http://arxiv.org/abs/2002.06852v3
• Date: Mon, 25 Jan 2021 12:28:02 GMT
• Title: An Efficient Permissioned Blockchain with Provable Reputation Mechanism
• Authors: Hongyin Chen, Zhaohua Chen, Yukun Cheng, Xiaotie Deng, Wenhan Huang, Jichen Li, Hongyi Ling, Mengqian Zhang
• Abstract summary: We study a hierarchical scenario to include three types of participants: providers, collectors, and governors. We introduce a reputation protocol as a measure of the reliability of collectors in the permissioned blockchain environment.
• Score: 2.579878570919875
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The design of permissioned blockchains places an access control requirement for members to read, access, and write information over the blockchains. In this paper, we study a hierarchical scenario to include three types of participants: providers, collectors, and governors. To be specific, providers forward transactions, collected from terminals, to collectors; collectors upload received transactions to governors after verifying and labeling them; and governors validate a part of received labeled transactions, pack valid ones into a block, and append a new block on the ledger. Collectors in the hierarchical model play a crucial role in the design: they have connections with both providers and governors, and are responsible for collecting, verifying, and uploading transactions. However, collectors are rational and some of them may behave maliciously (not necessarily for their own benefits). In this paper, we introduce a reputation protocol as a measure of the reliability of collectors in the permissioned blockchain environment. Its objective is to encourage collectors to behave truthfully and, in addition, to reduce the verification cost. The verification cost on provider $p$ is defined as the total number of invalid transactions provided by $p$ and checked by governors. Through theoretical analysis, our protocol with the reputation mechanism has a significant improvement in efficiency. Specifically, the verification loss that governors suffer is proved to be asymptotically $O(\sqrt{T_{total}})$ ($T_{total}$, representing the number of transactions verified by governors and provided by $p$), as long as there exists at least one collector who behaves well. At last, two typical cases where our model can be well applied are also demonstrated.

Related papers

• BlockFound: Customized blockchain foundation model for anomaly detection [47.04595143348698]
  BlockFound is a customized foundation model for anomaly blockchain transaction detection. We introduce a series of customized designs to model the unique data structure of blockchain transactions. BlockFound is the only method that successfully detects anomalous transactions on Solana with high accuracy.
  arXiv  Detail & Related papers  (2024-10-05T05:11:34Z)
• Jäger: Automated Telephone Call Traceback [45.67265362470739]
  We introduce J"ager, a distributed secure call traceback system. J"ager can trace a call in a few seconds, even with partial deployment.
  arXiv  Detail & Related papers  (2024-09-04T16:09:28Z)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols. Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol. We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Transaction Fee Estimation in the Bitcoin System [11.065598886291735]
  In the Bitcoin system, transaction fees serve as an incentive for blockchain confirmations. In this work, we focus on estimating the transaction fee for a new transaction to help with its confirmation within a given expected time. We propose a framework FENN, which aims to integrate the knowledge from a wide range of sources, including the transaction itself, into a neural network model in order to estimate a proper transaction fee.
  arXiv  Detail & Related papers  (2024-05-24T07:27:00Z)
• Sequencer Level Security [2.756899615600916]
  We introduce the Sequencer Level Security (SLS) protocol, an enhancement to sequencing protocols of rollups. We describe the mechanics of the protocol for both the transactions submitted to the rollup mempool, as well as transactions originating from Layer one. We implement a prototype of the SLS protocol, Zircuit, which is built on top of Geth and the OP stack.
  arXiv  Detail & Related papers  (2024-05-03T02:47:40Z)
• On the Detection of Reviewer-Author Collusion Rings From Paper Bidding [71.43634536456844]
  Collusion rings pose a major threat to the peer-review systems of computer science conferences. One approach to solve this problem would be to detect the colluding reviewers from their manipulated bids. No research has yet established that detecting collusion rings is even possible.
  arXiv  Detail & Related papers  (2024-02-12T18:12:09Z)
• Proof of Diligence: Cryptoeconomic Security for Rollups [19.10751432868712]
  We introduce an incentivized watchtower network designed to serve as the first line of defense for rollups. Our main contribution is a Proof of Diligence'' protocol that requires watchtowers to continuously provide a proof that they have verified L2 assertions.
  arXiv  Detail & Related papers  (2024-02-11T16:40:33Z)
• Masquerade: Simple and Lightweight Transaction Reordering Mitigation in Blockchains [5.690884793952696]
  We propose an MEV aware protocol design called Masquerade to increase user satisfaction and confidence in the system. We introduce the notion of a "token" to mitigate the actions taken by an adversary in an attack scenario.
  arXiv  Detail & Related papers  (2023-08-29T14:42:43Z)
• Blockchain Large Language Models [65.7726590159576]
  This paper presents a dynamic, real-time approach to detecting anomalous blockchain transactions. The proposed tool, BlockGPT, generates tracing representations of blockchain activity and trains from scratch a large language model to act as a real-time Intrusion Detection System.
  arXiv  Detail & Related papers  (2023-04-25T11:56:18Z)
• Light Clients for Lazy Blockchains [12.330989180881701]
  We devise a protocol that enables the creation of efficient light clients for lazy blockchains. Our construction is based on a bisection game that traverses the Merkle tree containing the ledger of all - valid or invalid - transactions.
  arXiv  Detail & Related papers  (2022-03-30T00:58:40Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.