Depermissioning Web3: a Permissionless Accountable RPC Protocol for Blockchain Networks

• URL: http://arxiv.org/abs/2506.03940v2
• Date: Fri, 06 Jun 2025 22:27:31 GMT
• Title: Depermissioning Web3: a Permissionless Accountable RPC Protocol for Blockchain Networks
• Authors: Weihong Wang, Tom Van Cutsem,
• Abstract summary: In blockchain networks, so-called "full nodes" serve data to and relay transactions from clients through an RPC interface.<n>This serving layer enables integration of "Web3" data, stored on blockchains, with "Web2" mobile or web applications that cannot directly participate as peers in a blockchain network.<n>We propose a Permissionless Accountable RPC Protocol (PARP) to address privacy, integrity, and availability of data access concerns.
• Score: 0.05524804393257919
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In blockchain networks, so-called "full nodes" serve data to and relay transactions from clients through an RPC interface. This serving layer enables integration of "Web3" data, stored on blockchains, with "Web2" mobile or web applications that cannot directly participate as peers in a blockchain network. In practice, the serving layer is dominated by a small number of centralized services ("node providers") that offer permissioned access to RPC endpoints. Clients register with these providers because they offer reliable and convenient access to blockchain data: operating a full node themselves requires significant computational and storage resources, and public (permissionless) RPC nodes lack financial incentives to serve large numbers of clients with consistent performance. Permissioned access to an otherwise permissionless blockchain network raises concerns regarding the privacy, integrity, and availability of data access. To address this, we propose a Permissionless Accountable RPC Protocol (PARP). It enables clients and full nodes to interact pseudonymously while keeping both parties accountable. PARP leverages "light client" schemes for essential data integrity checks, combined with fraud proofs, to keep full nodes honest and accountable. It integrates payment channels to facilitate micro-payments, holding clients accountable for the resources they consume and providing an economic incentive for full nodes to serve. Our prototype implementation for Ethereum demonstrates the feasibility of PARP, and we quantify its overhead compared to the base RPC protocol.

Related papers

• Information-Theoretic Decentralized Secure Aggregation with Collusion Resilience [98.31540557973179]
  We study the problem of decentralized secure aggregation (DSA) from an information-theoretic perspective.<n>We characterize the optimal rate region, which specifies the minimum achievable communication and secret key rates for DSA.<n>Our results establish the fundamental performance limits of DSA, providing insights for the design of provably secure and communication-efficient protocols.
  arXiv  Detail & Related papers  (2025-08-01T12:51:37Z)
• Efficient Blockchain-based Steganography via Backcalculating Generative Adversarial Network [105.47203971578871]
  We propose a generic blockchain-based steganography framework (GBSF)<n>The sender generates the required fields such as amount and fees, where the additional covert data is embedded to enhance the channel capacity.<n>Based on GBSF, we design a reversible generative adversarial network (R-GAN)<n>We propose R-GAN with Counter-intuitive data preprocessing and Custom activation functions, namely CCR-GAN.
  arXiv  Detail & Related papers  (2025-06-19T04:43:41Z)
• Trusted Compute Units: A Framework for Chained Verifiable Computations [41.94295877935867]
  This paper introduces the Trusted Compute Unit (TCU), a unifying framework that enables composable and interoperable computations across heterogeneous technologies.<n>By enabling secure off-chain interactions without incurring on-chain confirmation delays or gas fees, TCUs significantly improve system performance and scalability.
  arXiv  Detail & Related papers  (2025-04-22T09:01:55Z)
• Efficient Query Verification for Blockchain Superlight Clients Using SNARKs [0.6149772262764599]
  We present an architecture allowing superlight clients to outsource the computation of a query to a server, receiving a trustworthy answer.<n>Our architecture relies on the power of SNARKs and makes them lighter to compute by using data obtained from full nodes and blockchain explorers.
  arXiv  Detail & Related papers  (2025-03-11T12:16:35Z)
• Data sharing in the metaverse with key abuse resistance based on decentralized CP-ABE [17.462884309974097]
  Ciphertext-policy-based encryption (CP-ABE) is a promising primitive to provide confidentiality and fine-grained access control.<n>Few studies have considered CP-ABE key confidentiality and authority accountability simultaneously.<n>We introduce an open incentive mechanism to encourage honest participation in data sharing.
  arXiv  Detail & Related papers  (2024-12-18T12:06:56Z)
• CAKE: Sharing Slices of Confidential Data on Blockchain [1.481195148653669]
  Control Access via Key Encryption (CAKE) designed to ensure data confidentiality in scenarios involving public blockchains. We showcase the application of CAKE in the context of a real-world cyber-security project within the logistics domain.
  arXiv  Detail & Related papers  (2024-05-07T09:44:04Z)
• Enhancing Trust and Privacy in Distributed Networks: A Comprehensive Survey on Blockchain-based Federated Learning [51.13534069758711]
  Decentralized approaches like blockchain offer a compelling solution by implementing a consensus mechanism among multiple entities. Federated Learning (FL) enables participants to collaboratively train models while safeguarding data privacy. This paper investigates the synergy between blockchain's security features and FL's privacy-preserving model training capabilities.
  arXiv  Detail & Related papers  (2024-03-28T07:08:26Z)
• Graph Attention Network-based Block Propagation with Optimal AoI and Reputation in Web 3.0 [59.94605620983965]
  We design a Graph Attention Network (GAT)-based reliable block propagation optimization framework for blockchain-enabled Web 3.0. To achieve the reliability of block propagation, we introduce a reputation mechanism based on the subjective logic model. Considering that the GAT possesses the excellent ability to process graph-structured data, we utilize the GAT with reinforcement learning to obtain the optimal block propagation trajectory.
  arXiv  Detail & Related papers  (2024-03-20T01:58:38Z)
• Blockchain-enabled Trustworthy Federated Unlearning [50.01101423318312]
  Federated unlearning is a promising paradigm for protecting the data ownership of distributed clients. Existing works require central servers to retain the historical model parameters from distributed clients. This paper proposes a new blockchain-enabled trustworthy federated unlearning framework.
  arXiv  Detail & Related papers  (2024-01-29T07:04:48Z)
• Robust and Actively Secure Serverless Collaborative Learning [48.01929996757643]
  Collaborative machine learning (ML) is widely used to enable institutions to learn better models from distributed data. While collaborative approaches to learning intuitively protect user data, they remain vulnerable to either the server, the clients, or both. We propose a peer-to-peer (P2P) learning scheme that is secure against malicious servers and robust to malicious clients.
  arXiv  Detail & Related papers  (2023-10-25T14:43:03Z)
• Enabling Data Confidentiality with Public Blockchains [5.749927436954179]
  Multi-Authority Approach to Transaction Systems for Interoperating Applications (MARTSIA) MARTSIA enables read-access control over shared data at the level of message parts. Based on Multi-Authority Attribute-Based Encryption (MA-ABE), MARTSIA enables read-access control over shared data at the level of message parts.
  arXiv  Detail & Related papers  (2023-08-04T13:21:48Z)
• Relay Mining: Incentivizing Full Non-Validating Nodes Servicing All RPC Types [0.0]
  Relay Mining estimates and proves the volume of Remote Procedure Calls (RPCs) made from a client to a server. We leverage digital signatures, commit-and-reveal schemes, and Sparse Merkle Sum Tries (SMSTs) to prove the amount of work done. A native cryptocurrency on a distributed ledger is used to rate limit applications and disincentivize over-usage.
  arXiv  Detail & Related papers  (2023-05-18T03:23:41Z)

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.