Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles

DOI10.1109/FOCS.2017.59MaRDI QIDQ6946327zbMATH OpenFDO

Authors Huijia Lin, Rafael Pass, Pratik Soni

Publication date 6 August 2025

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx) Theory of computing (68Qxx)

This page was built for publication: Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles

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