A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor

DOI10.1007/978-3-540-79499-8_13MaRDI QIDQ3600328zbMATH OpenOpenAlexFDO

Authors Ning Ding, Dawu Gu

Publication date 10 February 2009

Published in Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-79499-8_13

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1722670
• scientific article; zbMATH DE number 1759793
• scientific article; zbMATH DE number 1952890
• Efficient non-malleable commitment schemes
• Efficient non-malleable commitment schemes

Cites work

• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• scientific article; zbMATH DE number 1722670 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1256680 (Why is no real title available?)
• scientific article; zbMATH DE number 708798 (Why is no real title available?)
• scientific article; zbMATH DE number 1759793 (Why is no real title available?)
• scientific article; zbMATH DE number 1775398 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• scientific article; zbMATH DE number 1842511 (Why is no real title available?)
• Nonmalleable Cryptography
• Strict polynomial-time in simulation and extraction

Cited in

(2)

• Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors

This page was built for publication: A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor

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