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

• Efficient and non-interactive non-malleable commitment
• Efficient non-malleable commitment schemes
• Equivocable and extractable commitment schemes
• Efficient non-malleable commitment schemes
• Efficient non-malleable commitment schemes

Cites work

• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• Efficient and non-interactive non-malleable commitment
• Efficient non-malleable commitment schemes
• 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 1775398 (Why is no real title available?)
• Non-interactive and information-theoretic secure verifiable secret sharing
• Nonmalleable Cryptography
• Robust non-interactive zero knowledge
• Strict polynomial-time in simulation and extraction
• Universally composable commitments (extended abstract)

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)