Constructing non-malleable commitments: a black-box approach
From MaRDI portal
Cited in
(9)- 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
- Improved rate for non-malleable codes and time-lock puzzles
- Round-optimal GUC-secure blind signatures from minimal computational and setup assumptions. From minimal computational and setup assumptions
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)