COMET-MPC: Commitment-Oriented Multi-Party Computation with Equality Testing — A Dealerless, One-Round Framework for Privacy-Preserving Verification
Fuente:
Zenodo
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Recurso digital |
| Lenguaje: | inglés |
| Publicado: |
Zenodo
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866901073823793152 |
|---|---|
| author | Shim, Sophia Lee, Eunice Lee, Caleb |
| author_facet | Shim, Sophia Lee, Eunice Lee, Caleb |
| contents | <p>We present COMET-MPC (Commitment-Oriented Multi-Party Computation with Equality Testing), a novel MPC framework that fundamentally reimagines multi-party computation as a commitment verification problem rather than a traditional secret-sharing problem. COMET-MPC achieves dealerless, one-round setup by reducing all MPC coordination tasks—input binding, consistency verification, and replay prevention—to homomorphic equality testing over elliptic-curve commitments. Unlike classical MPC protocols (Shamir’s secret sharing, FROST) that require multi-round polynomial verification or interactive zero-knowledge proofs, COMET-MPC performs verification through a single algebraic check: testing whether a group element equals the identity. This zero-detection paradigm exploits the structural identity between EC-Pedersen commitments and EC-ElGamal ciphertexts, enabling decrypt-free verification with perfect correctness and computational hiding under the Decisional Diffie-Hellman (DDH) assumption. We provide complete algorithmic specifications, formal security proofs including binding, hiding, replay resistance, and a rigorous security level analysis demonstrating ≈ 128-bit security for standard 256-bit elliptic curves. COMET-MPC is particularly suited for real-world ledger systems, authentication protocols, confidential databases, and privacy-preserving regulatory compliance where minimal interaction, minimal trust, and minimal leakage are paramount.</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_19044862 |
| institution | Zenodo |
| language | eng |
| publishDate | 2026 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | COMET-MPC: Commitment-Oriented Multi-Party Computation with Equality Testing — A Dealerless, One-Round Framework for Privacy-Preserving Verification Shim, Sophia Lee, Eunice Lee, Caleb COMET-MPC Multi-Party Computation Commitment-Based MPC Elliptic Curve Cryptography Pedersen Commitments EC-ElGamal Homomorphic Equality Testing Dealerless Protocols Privacy-Preserving Computation Decisional Diffie-Hellman (DDH) (EuroSciVoc) Computer and Information Sciences (EuroSciVoc) Cryptography (EuroSciVoc) Information Security <p>We present COMET-MPC (Commitment-Oriented Multi-Party Computation with Equality Testing), a novel MPC framework that fundamentally reimagines multi-party computation as a commitment verification problem rather than a traditional secret-sharing problem. COMET-MPC achieves dealerless, one-round setup by reducing all MPC coordination tasks—input binding, consistency verification, and replay prevention—to homomorphic equality testing over elliptic-curve commitments. Unlike classical MPC protocols (Shamir’s secret sharing, FROST) that require multi-round polynomial verification or interactive zero-knowledge proofs, COMET-MPC performs verification through a single algebraic check: testing whether a group element equals the identity. This zero-detection paradigm exploits the structural identity between EC-Pedersen commitments and EC-ElGamal ciphertexts, enabling decrypt-free verification with perfect correctness and computational hiding under the Decisional Diffie-Hellman (DDH) assumption. We provide complete algorithmic specifications, formal security proofs including binding, hiding, replay resistance, and a rigorous security level analysis demonstrating ≈ 128-bit security for standard 256-bit elliptic curves. COMET-MPC is particularly suited for real-world ledger systems, authentication protocols, confidential databases, and privacy-preserving regulatory compliance where minimal interaction, minimal trust, and minimal leakage are paramount.</p> |
| title | COMET-MPC: Commitment-Oriented Multi-Party Computation with Equality Testing — A Dealerless, One-Round Framework for Privacy-Preserving Verification |
| topic | COMET-MPC Multi-Party Computation Commitment-Based MPC Elliptic Curve Cryptography Pedersen Commitments EC-ElGamal Homomorphic Equality Testing Dealerless Protocols Privacy-Preserving Computation Decisional Diffie-Hellman (DDH) (EuroSciVoc) Computer and Information Sciences (EuroSciVoc) Cryptography (EuroSciVoc) Information Security |
| url | https://doi.org/10.5281/zenodo.19044862 |