Homomorphic Encryption-based Vaults for Anonymous Balances on VM-enabled Blockchains

• URL: http://arxiv.org/abs/2511.17842v1
• Date: Fri, 21 Nov 2025 23:34:30 GMT
• Title: Homomorphic Encryption-based Vaults for Anonymous Balances on VM-enabled Blockchains
• Authors: Xavier Salleras,
• Abstract summary: We present homomorphic encryption-based vaults (Haults) for VM-enabled blockchains.<n>Haults keeps users' balances confidential, as well as the amounts transacted to other parties.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work, we present homomorphic encryption-based vaults (Haults), a permissioned privacy-preserving smart wallet protocol for VM-enabled blockchains that keeps users' balances confidential, as well as the amounts transacted to other parties. To comply with regulations, we include optional compliance features that allow specific entities (the auditors) to retrieve transaction amounts or execute force transfers when necessary. Our solution uses ElGamal over elliptic curves to encrypt balances, combined with zero-knowledge proofs to verify the correctness of transaction amounts and the integrity of the sender's updated balance, among other security checks. We provide a detailed explanation of the protocol, including a security discussion and benchmarks from our proof-of-concept implementation, which yield great results. Beyond in-contract issued tokens, we also provide a thorough explanation on how our solution can be compatible with external ones (e.g., Ether or any ERC20).

Related papers

• Sedna: Sharding transactions in multiple concurrent proposer blockchains [42.71280924071485]
  We present Sedna, a user-facing protocol that replaces naive transaction replication with verifiable, rateless coding.<n>We prove Sedna guarantees liveness and emphuntil-decode privacy, significantly reducing MEV exposure.
  arXiv  Detail & Related papers  (2025-12-18T20:12:55Z)
• Proof of Trusted Execution: A Consensus Paradigm for Deterministic Blockchain Finality [0.391985484065646]
  We propose Proof of Trusted Execution (PoTE), a consensus paradigm where agreement emerges from verifiable execution rather than replicated re-execution.<n>Because the execution is deterministic and the proposer is uniquely derived from public randomness, PoTE avoids forks, eliminates slot.time bottlenecks, and commits blocks in a single round of verification.
  arXiv  Detail & Related papers  (2025-12-10T08:04:38Z)
• Cross-Chain Sealed-Bid Auctions Using Confidential Compute Blockchains [12.944520640892316]
  Sealed-bid auctions ensure fair competition and efficient allocation but are often deployed on centralized infrastructure.<n>Public blockchains eliminate central control, yet their inherent transparency conflicts with the confidentiality required for sealed bidding.<n>We present a sealed-bid auction protocol that executes sensitive bidding logic on a confidential compute blockchain.
  arXiv  Detail & Related papers  (2025-10-22T11:35:51Z)
• VeilAudit: Breaking the Deadlock Between Privacy and Accountability Across Blockchains [2.676349883103404]
  Cross chain interoperability in blockchain systems exposes a fundamental tension between user privacy and regulatory accountability.<n>We present VeilAudit, a cross chain auditing framework that introduces Auditor Only Linkability.<n>VeilAudit achieves this with a user generated Linkable Audit Tag that embeds a zero knowledge proof to attest to its validity without exposing the user master wallet address.
  arXiv  Detail & Related papers  (2025-10-14T05:16:23Z)
• 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)
• Balancing Confidentiality and Transparency for Blockchain-based Process-Aware Information Systems [43.253676241213626]
  We propose an architecture for blockchain-based PAISs to preserve confidentiality and transparency.<n>Smart contracts enact, enforce and store public interactions, while attribute-based encryption techniques are adopted to specify access grants to confidential information.<n>We assess the security of our solution through a systematic threat model analysis and evaluate its practical feasibility.
  arXiv  Detail & Related papers  (2024-12-07T20:18:36Z)
• Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
  We propose a novel quantum digital signature protocol without a trusted third-party.<n>We prove that the protocol has information-theoretical unforgeability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• 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.<n>Our measurements from the Aptos mainnet show that the optimistic approach reduces latency overhead by 71%.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• SeDe: Balancing Blockchain Privacy and Regulatory Compliance by Selective De-Anonymization [0.46040036610482665]
  We propose a framework that balances privacy-preserving features by establishing a regulatory and compliant framework called Selective De-Anonymization (SeDe)<n>Our technique achieves this without leaving de-anonymization decisions or control in the hands of a single entity but distributing it among multiple entities while holding them accountable for their respective actions.
  arXiv  Detail & Related papers  (2023-11-14T13:49:13Z)
• Trustless Privacy-Preserving Data Aggregation on Ethereum with Hypercube Network Topology [0.0]
  We have proposed a scalable privacy-preserving data aggregation protocol for summation on the blockchain. The protocol consists of four stages as contract deployment, user registration, private submission and proof verification.
  arXiv  Detail & Related papers  (2023-08-29T12:51:26Z)
• 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.