F-eqv — Equivocal, adaptively secure commitment

F-eqv (Equivocal, adaptively secure commitment) is part of Commitments and Proofs in the UC functionality encyclopedia. Status: a canonical, well-established UC functionality.

Equivocability (in Beaver’s sense) is a protocol-level technique — not a distinct ideal functionality — for UC-realizing F-COM/F-MCOM under adaptive corruption; see Canetti and Fischlin’s erasure-based construction.

References:

• Canetti and Fischlin. Universally composable commitments. In Advances in Cryptology – CRYPTO 2001, volume 2139 of LNCS, pages 19–40, 2001.
• Beaver. Adaptive zero-knowledge and computational equivocation. In 28th ACM Symposium on Theory of Computing (STOC), 1996.