Four-round concurrent non-malleable commitments from one-way functions

DOI10.1007/978-3-319-63715-0_5zbMath1409.94867OpenAlexW2739720789MaRDI QIDQ1678367

Michele Ciampi, Ivan Visconti, Luisa Siniscalchi, Rafail Ostrovsky

Publication date: 15 November 2017

Full work available at URL: https://link.springer.com/chapter/10.1007%2F978-3-319-63715-0_5

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (17)

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 ⋮ Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ Four-round black-box non-malleable schemes from one-way permutations ⋮ 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 ⋮ An Algebraic Approach to Nonmalleability ⋮ Non-malleable vector commitments via local equivocability ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Post-quantum multi-party computation ⋮ Black-box non-interactive non-malleable commitments ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments

This page was built for publication: Four-round concurrent non-malleable commitments from one-way functions