Non-interactive and reusable non-malleable commitment schemes

DOI10.1145/780542.780605MaRDI QIDQ3581303zbMATH OpenOpenAlexFDO

Authors Jens Groth, Ivan B. Damgård

Publication date 16 August 2010

Published in Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/780542.780605

Mathematics Subject Classification ID

Decision theory (91B06) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1722670
• Efficient non-malleable commitment schemes
• Efficient non-malleable commitment schemes
• scientific article; zbMATH DE number 1759793
• Non-interactive and re-usable universally composable string commitments with adaptive security

Cited in

(42)

• Hybrid commitments and their applications to zero-knowledge proof systems
• New approaches for deniable authentication
• Constructions and bounds for unconditionally secure non-interactive commitment schemes
• All-but-many encryption
• TARDIS: a foundation of time-lock puzzles in UC
• Cryptographic reverse firewalls for interactive proof systems
• Reusable non-interactive secure computation
• On black-box complexity of universally composable security in the CRS model
• Efficient fully structure-preserving signatures and shrinking commitments
• Efficient and round-optimal oblivious transfer and commitment with adaptive security
• Non-malleable vector commitments via local equivocability
• scientific article; zbMATH DE number 1722670 (Why is no real title available?)
• On the complexity of additively homomorphic UC commitments
• A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
• Improved OR-composition of sigma-protocols
• Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
• Improving practical UC-secure commitments based on the DDH assumption
• SPHF-friendly non-interactive commitments
• New constructions of efficient simulation-sound commitments using encryption and their applications
• Expedient Non-malleability Notions for Hash Functions
• Non-interactive and re-usable universally composable string commitments with adaptive security
• A multi-trapdoor commitment scheme from the RSA assumption
• On the necessary and sufficient assumptions for UC computation
• Perfect Non-interactive Zero Knowledge for NP
• Efficient non-interactive universally composable string-commitment schemes
• 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?)
• Generic construction of GUC secure commitment in the KRK model
• SAS-Based Group Authentication and Key Agreement Protocols
• Constant-Round Nonmalleable Commitments from Any One-Way Function
• On the Subject of Non-Equivocation: Defining Non-Equivocation in Synchronous Agreement Systems
• Efficient non-malleable commitment schemes
• Efficient non-malleable commitment schemes
• Non-malleable vector commitments via local equivocability
• Non-interactive Mimblewimble transactions, revisited
• On non-uniform security for black-box non-interactive CCA commitments
• Cryptographic reverse firewalls for interactive proof systems
• Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler
• Non-malleable subvector commitments
• Linearly homomorphic structure-preserving signatures and their applications
• Non-interactive and non-malleable commitment scheme based on q-one way group homomorphisms

This page was built for publication: Non-interactive and reusable non-malleable commitment schemes

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