Contemporary digital currency systems face fundamental challenges in achieving optimal balance between transaction privacy, computational efficiency, and cryptographic security. While zero-knowledge proof systems have dominated privacy-preserving cryptocurrency research, their practical implementations often involve prohibitive computational overhead that limits real-world deployment. This paper presents a comprehensive analysis of the Elliptic Homomorphic Token (EHT) protocol, which leverages elliptic curve-based partially homomorphic encryption combined with parallel processing architecture to enable privacy-preserving peer-to-peer transactions without the computational complexity of zero-knowledge constructions. Our theoretical analysis demonstrates strong privacy guarantees under standard cryptographic assumptions, while experimental evaluation shows that EHT achieves 500,000 transactions per second with parallel processing and 50-100ms latency. The protocol eliminates the need for complex zero-knowledge proofs by directly utilizing elliptic curve cryptographic primitives, resulting in performance improvements exceeding 1000× over existing privacy-focused systems while maintaining equivalent security properties through formally proven cryptographic guarantees.
Lee et al. (Tue,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: