PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
February 26, 20260 citationsOpen Access

ESC Commitment: Encrypted Sequential Context Commitment for Decrypt-Free Verification

View Full Paper
ELEunice LeeSSSophia ShimCLCaleb Lee

Key Points

  • The research introduces a new commitment scheme called ESC that enables equality verification of encrypted data without decryption.
  • Introduced ESC commitment for decrypt-free verification of encrypted data in blockchain systems.
  • Utilized elliptic curve group operations allowing verification without secret key access.
  • Incorporated nonce evolution and pairwise contexts to enhance replay resistance.
  • Verified minimal on-chain leakage with efficient commitment generation requiring one scalar multiplication.
  • Demonstrated application in regulatory compliance systems and privacy-preserving protocols.

Abstract

We introduce ESC (Encrypted Sequential Context) Commitment, a novel commitment scheme designed for decrypt-free equality verification of encrypted data in asymmetric on-chain/off-chain execution models. Unlike classical commitment schemes that require explicit opening for verification, ESC enables blockchain-based verifiers to check equality between stored encrypted ledger values and user-provided inputs using only elliptic curve group operations, without access to secret keys or decryption oracles. ESC is inspired by Pedersen-style commitments but incorporates sequential nonce evolution and pairwise commitment contexts to ensure replay resistance and prevent correlation attacks across multiple verification sessions. The scheme separates commitment generation into two phases: the blockchain derives a pre-commitment from stored encrypted data, while the off-chain system constructs a matching commitment from user input under the same sequential context. Verification reduces to a simple group equality check. We formalize ESC’s security through rigorous game-based proofs, demonstrating computational hiding, binding, and our novel equality soundness property under standard elliptic curve assumptions (DDH, collision-resistant hashing). ESC achieves minimal on-chain leakage, single-use commitment semantics, and algebraic compatibility with EC-ElGamal partial homomorphic encryption, making it particularly suitable for vault-based ledger verification systems and privacy-preserving blockchain applications. Our concrete instantiation using elliptic curve groups achieves practical performance: commitment generation requires one scalar multiplication, verification requires one group operation (subtraction), and the on-chain footprint is a single elliptic curve point. We demonstrate ESC’s applicability to encrypted ledger verification, regulatory compliance systems, and privacy-preserving payment protocols.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Lee et al. (2026) studied this question.

synapsesocial.com/papers/699f95951bc9fecf3dab36fdhttps://doi.org/10.5281/zenodo.18751571
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Signature-based Commitment Using EHDSA: Efficient Binding with Elliptic Curve Signatures2026
  2. 2VSEL: Verifiable Semantic Execution Layer2026
  3. 3Blind ECDSA from the ECDSA Assumption2025
  4. 4Verifiable Encryption from MPC-in-the-Head2024 · 3 citations
  5. 5A Generalized Cryptographic Token Framework for Homomorphic Computation2026