Non-malleability vs. CCA-security: the case of commitments

DOI10.1007/978-3-319-76581-5_11MaRDI QIDQ1753855zbMATH OpenOpenAlexFDO

Authors Brandon Broadnax, Valerie Fetzer, Joern Mueller-Quade, Andy Rupp

Publication date 29 May 2018

Full work available at URL https://doi.org/10.1007/978-3-319-76581-5_11

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient non-malleable commitment schemes
• Efficient non-malleable commitment schemes
• Concurrent Nonmalleable Commitments
• scientific article; zbMATH DE number 1759793
• Nonmalleable Cryptography

Cited in

(5)

• Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
• Black-box non-interactive non-malleable commitments
• Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
• Textbook non-malleable commitments
• On non-uniform security for black-box non-interactive CCA commitments

This page was built for publication: Non-malleability vs. CCA-security: the case of commitments

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