Concurrent Non-malleable Commitments from Any One-Way Function
From MaRDI portal
Publication:5445526
DOI10.1007/978-3-540-78524-8_31zbMath1162.94383OpenAlexW2004433870MaRDI QIDQ5445526
Huijia Lin, Muthuramakrishnan Venkitasubramaniam, Rafael Pass
Publication date: 5 March 2008
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78524-8_31
Related Items (28)
Non-malleable codes for bounded parallel-time tampering ⋮ One-message zero knowledge and non-malleable commitments ⋮ Game theoretic notions of fairness in multi-party coin toss ⋮ Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions ⋮ Unbounded ABE via bilinear entropy expansion, revisited ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ Round-optimal multi-party computation with identifiable abort ⋮ Non-malleable commitments against quantum attacks ⋮ Statistical concurrent non-malleable zero-knowledge from one-way functions ⋮ \(\log^\ast\)-round game-theoretically-fair leader election ⋮ Four-round black-box non-malleable schemes from one-way permutations ⋮ Concurrently composable non-interactive secure computation ⋮ 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 ⋮ Round-efficient black-box construction of composable multi-party computation ⋮ An Algebraic Approach to Nonmalleability ⋮ 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 ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds ⋮ Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge ⋮ Constant-Round Nonmalleable Commitments from Any One-Way Function
This page was built for publication: Concurrent Non-malleable Commitments from Any One-Way Function
