Efficient and non-interactive non-malleable commitment

DOI10.1007/3-540-44987-6_4MaRDI QIDQ2778839zbMATH OpenFDO

Authors Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith

Publication date 21 March 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2045/20450040

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1759793
• Non-malleability amplification
• Efficient non-malleable commitment schemes
• Efficient non-malleable commitment schemes
• Non-interactive and reusable non-malleable commitment schemes

Cited in

(38)

• Hybrid commitments and their applications to zero-knowledge proof systems
• New approaches for deniable authentication
• Efficient commitment schemes with bounded sender and unbounded receiver
• Another step towards realizing random oracles: non-malleable point obfuscation
• Non-malleable functions and their applications
• Non-interactive non-malleability from quantum supremacy
• Non-malleable vector commitments via local equivocability
• Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
• New constructions of efficient simulation-sound commitments using encryption and their applications
• Non-malleable instance-dependent commitment in the standard model
• A multi-trapdoor commitment scheme from the RSA assumption
• A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
• Non-interactive and reusable non-malleable commitment schemes
• Perfect Non-interactive Zero Knowledge for NP
• A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor
• Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1
• Concurrent non-malleable statistically hiding commitment
• scientific article; zbMATH DE number 1952890 (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?)
• Grid-obstacle representations with connections to staircase guarding
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• Cryptography using \texttt{CAPTCHA} puzzles
• Message-restriction-free commitment scheme based on lattice assumption
• Constant-Round Nonmalleable Commitments from Any One-Way Function
• Efficient non-malleable commitment schemes
• Efficient non-malleable commitment schemes
• Non-malleable vector commitments via local equivocability
• Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments
• Unsatisfiability of comparison-based non-malleability for commitments
• A bivariate polynomial-based cryptographic hard problem and its applications
• Non-interactive Mimblewimble transactions, revisited
• On non-uniform security for black-box non-interactive CCA commitments
• A new approach to efficient non-malleable zero-knowledge
• Revisiting RSA-polynomial problem and semiprime factorization
• Non-malleable subvector commitments
• Secret sharing with statistical privacy and computational relaxed non-malleability
• Non-interactive and non-malleable commitment scheme based on q-one way group homomorphisms

This page was built for publication: Efficient and non-interactive non-malleable commitment

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