Unsatisfiability of comparison-based non-malleability for commitments

DOI10.1007/978-3-031-17715-6_13MaRDI QIDQ6109474zbMATH OpenOpenAlexFDO

Authors Denis Firsov, Sven Laur, Ekaterina Zhuchko

Publication date 28 July 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-17715-6_13

zbMATH Keywords

commitmentscomparison-basedcryptographyeasycryptformal methodsnon-malleability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Critical perspectives on provable security: fifteen years of ``another look papers
• Efficient Mutual Data Authentication Using Manually Authenticated Strings
• scientific article; zbMATH DE number 1722670 (Why is no real title available?)
• Unsatisfiability of comparison-based non-malleability for commitments

Cited in

(4)

• An implementation-theoretic approach to non-cooperative foundations
• Non-malleable vector commitments via local equivocability
• Textbook non-malleable commitments
• Unsatisfiability of comparison-based non-malleability for commitments

This page was built for publication: Unsatisfiability of comparison-based non-malleability for commitments

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