Unsatisfiability of comparison-based non-malleability for commitments

DOI10.1007/978-3-031-17715-6_13OpenAlexW4313024323MaRDI QIDQ6109474

Denis Firsov, Ekaterina Zhuchko, Sven Laur

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

cryptographyformal methodscommitmentsnon-malleabilitycomparison-basedeasycrypt

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Unsatisfiability of comparison-based non-malleability for commitments

Cites Work

• Unnamed Item
• Critical perspectives on provable security: fifteen years of ``another look papers
• Efficient Mutual Data Authentication Using Manually Authenticated Strings
• Unsatisfiability of comparison-based non-malleability for commitments

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