eprint.iacr.orgpaperPenalty Deposits For Discrete Logarithms
Penalty Deposits For Discrete Logarithms (IACR ePrint 2026/2687, Francisco Vial-Prado and Louis Goubin) lets a trusted party attach a deposit to its own discrete-log secret and prove this with zero-knowledge proofs. Anyone who learns the secret can claim the deposit. The paper defines the security notions, gives two constructions in generic discrete logarithm groups, and analyzes ECDLP-based protocols.
TL;DR Proposes zero-knowledge-proven deposits on a trusted party's discrete-log secrets that any attacker who learns the secret can claim.
Organisations named here
- Francisco Vial-Prado
- Louis Goubin
Techniques named here
- Zero-knowledge proof
Concepts named here
- elliptic curve discrete logarithm problem
- Penalty deposits for discrete logarithms
- Trusted party
Related in other
eprint.iacr.orgpaperRerandomizable Garbling for Arithmetic Circuits
aseemshrey.inarticle