Textbook non-malleable commitments
From MaRDI portal
Publication:5361907
DOI10.1145/2897518.2897657zbMath1377.94049OpenAlexW2416422559MaRDI QIDQ5361907
Omkant Pandey, Vipul Goyal, Silas Richelson
Publication date: 29 September 2017
Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2897518.2897657
Related Items (32)
On the round complexity of black-box secure MPC ⋮ Non-malleable codes for bounded parallel-time tampering ⋮ One-message zero knowledge and non-malleable commitments ⋮ Round optimal black-box ``commit-and-prove ⋮ Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ The security of lazy users in out-of-band authentication ⋮ Another step towards realizing random oracles: non-malleable point obfuscation ⋮ Round-optimal multi-party computation with identifiable abort ⋮ Non-malleable commitments against quantum attacks ⋮ Continuously non-malleable secret sharing for general access structures ⋮ Interactive non-malleable codes ⋮ Privacy amplification from non-malleable codes ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ Extractors: low entropy requirements colliding with non-malleability ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Round-optimal black-box MPC in the plain model ⋮ 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 ⋮ An Algebraic Approach to Nonmalleability ⋮ Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes ⋮ Four-state non-malleable codes with explicit constant rate ⋮ Non-malleable vector commitments via local equivocability ⋮ Minicrypt primitives with algebraic structure and applications ⋮ Post-quantum multi-party computation ⋮ Multi-source non-malleable extractors and applications ⋮ Black-box non-interactive non-malleable commitments ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds ⋮ Non-malleability against polynomial tampering
This page was built for publication: Textbook non-malleable commitments
