Non-malleability amplification
From MaRDI portal
Publication:5172712
DOI10.1145/1536414.1536442zbMath1304.94073OpenAlexW2031878381MaRDI QIDQ5172712
Publication date: 4 February 2015
Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1536414.1536442
Related Items
Non-malleable codes for bounded parallel-time tampering ⋮ One-message zero knowledge and non-malleable commitments ⋮ The security of lazy users in out-of-band authentication ⋮ Unbounded ABE via bilinear entropy expansion, revisited ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ Non-malleable commitments against quantum attacks ⋮ Statistical concurrent non-malleable zero-knowledge from one-way functions ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles ⋮ Non-malleable vector commitments via local equivocability ⋮ Non-malleable time-lock puzzles and applications ⋮ Computing boundary cycle of a pseudo-triangle polygon from its visibility graph ⋮ Concurrently Composable Security with Shielded Super-Polynomial Simulators ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ Non-malleable vector commitments via local equivocability ⋮ Expedient Non-malleability Notions for Hash Functions ⋮ Post-quantum multi-party computation ⋮ Black-box non-interactive non-malleable commitments ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions ⋮ Constant-Round Nonmalleable Commitments from Any One-Way Function
