Signature-based Commitment Using EHDSA: Efficient Binding with Elliptic Curve Signatures

We propose a novel commitment scheme that leverages the Elliptic Curve Homomorphic Digital Signature Algorithm (EHDSA) to create cryptographically binding commitments. Our construction uniquely combines EHDSA signatures with Pedersen commitments, where the commitment value is derived from signature components enhanced with additional randomness. Unlike traditional commitment schemes that operate independently of signature protocols, our approach integrates the security properties of digital signatures directly into the commitment mechanism. The scheme provides computational binding through the unforgeability of EHDSA, perfect hiding through Pedersen commitment randomization, and enables efficient verification without requiring additional cryptographic assumptions beyond those underlying EHDSA. We provide formal security proofs and demonstrate practical applications in anonymous credential systems and privacy-preserving protocols.