Round optimal concurrent non-malleability from polynomial hardness

DOI10.1007/978-3-319-70503-3_5zbMath1412.94186OpenAlexW2605182384MaRDI QIDQ1690265

Dakshita Khurana

Publication date: 19 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70503-3_5

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (20)

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 ⋮ Two-message statistically sender-private OT from LWE ⋮ Round-optimal multi-party computation with identifiable abort ⋮ Non-malleable commitments against quantum attacks ⋮ Four-round black-box non-malleable schemes from one-way permutations ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ Statistically sender-private OT from LPN and derandomization ⋮ 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 ⋮ Round-optimal secure multi-party computation ⋮ 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: Round optimal concurrent non-malleability from polynomial hardness