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

DOI10.1007/978-3-319-63715-0_5MaRDI QIDQ1678367zbMATH OpenOpenAlexFDO

Authors Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti

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)

Recommendations

• Constant-round non-malleable commitments from any one-way function
• Constant-Round Nonmalleable Commitments from Any One-Way Function
• Concurrent Non-malleable Commitments from Any One-Way Function
• Concurrent non-malleable commitments (and more) in 3 rounds
• Constant-round non-malleable commitments from sub-exponential one-way functions

Cited in

(25)

• Constant-Round Nonmalleable Commitments from Any One-Way Function
• On non-uniform security for black-box non-interactive CCA commitments
• Post-quantum multi-party computation
• An Algebraic Approach to Nonmalleability
• One-message zero knowledge and non-malleable commitments
• Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
• Round optimal concurrent non-malleability from polynomial hardness
• Non-malleable codes for bounded parallel-time tampering
• Concurrent non-malleable commitments (and more) in 3 rounds
• Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
• On the round complexity of black-box secure MPC
• Almost-total puzzles and their applications
• Four-round statistical non-malleable zero-knowledge
• Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
• Black-box non-interactive non-malleable commitments
• Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
• Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
• Concurrent Non-Malleable Witness Indistinguishable Argument from Any One-Way Function
• Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds
• Black-box (and fast) non-malleable zero knowledge
• A new approach to efficient non-malleable zero-knowledge
• Non-malleable vector commitments via local equivocability
• Non-malleable time-lock puzzles and applications
• Four-round black-box non-malleable schemes from one-way permutations
• Non-malleable vector commitments via local equivocability

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1678367)