Non-interactive and reusable non-malleable commitment schemes
From MaRDI portal
Publication:3581303
DOI10.1145/780542.780605zbMath1192.94116OpenAlexW2055668544MaRDI QIDQ3581303
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
Related Items
New Constructions of Efficient Simulation-Sound Commitments Using Encryption and Their Applications, Linearly homomorphic structure-preserving signatures and their applications, Efficient and round-optimal oblivious transfer and commitment with adaptive security, Non-malleable vector commitments via local equivocability, Cryptographic reverse firewalls for interactive proof systems, All-but-many encryption, Efficient non-malleable commitment schemes, Efficient non-malleable commitment schemes, Perfect Non-interactive Zero Knowledge for NP, SAS-Based Group Authentication and Key Agreement Protocols, On the Complexity of Additively Homomorphic UC Commitments, Non-malleable vector commitments via local equivocability, A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles, Improved OR-Composition of Sigma-Protocols, Non-interactive and non-malleable commitment scheme based on \(q\)-one way group homomorphisms, Expedient Non-malleability Notions for Hash Functions, TARDIS: a foundation of time-lock puzzles in UC, Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security, Hybrid commitments and their applications to zero-knowledge proof systems, Improving Practical UC-Secure Commitments Based on the DDH Assumption, On black-box complexity of universally composable security in the CRS model, Efficient fully structure-preserving signatures and shrinking commitments, New approaches for deniable authentication, On the Necessary and Sufficient Assumptions for UC Computation, Constant-Round Nonmalleable Commitments from Any One-Way Function
