Constructing non-malleable commitments: a black-box approach

DOI10.1109/FOCS.2012.47MaRDI QIDQ6988244zbMATH OpenFDO

Authors Rafail Ostrovsky, Chen-Kuei Lee, Ivan Visconti, Vipul Goyal

Publication date 5 May 2025

Full work available at URL https://doi.org/10.1109/FOCS.2012.47

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(7)

• Improved black-box constructions of composable secure computation
• The round complexity of black-box post-quantum secure computation
• Black-box timed commitments from time-lock puzzles
• Non-malleable subvector commitments
• Almost-total puzzles and their applications
• Verifiable encryption from MPC-in-the-head
• Round-optimal compiler for semi-honest to malicious oblivious transfer via CIH

This page was built for publication: Constructing non-malleable commitments: a black-box approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988244)