Concurrent Non-malleable Commitments from Any One-Way Function

DOI10.1007/978-3-540-78524-8_31MaRDI QIDQ5445526zbMATH OpenOpenAlexFDO

Authors Huijia Lin, Rafael Pass, Muthuramakrishnan Venkitasubramaniam

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

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
• Constant-round non-malleable commitments from sub-exponential one-way functions
• Non-malleable statistically hiding commitment from any one-way function
• Concurrent Nonmalleable Commitments

Cited in

(40)

• Constant-Round Nonmalleable Commitments from Any One-Way Function
• The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives
• On non-uniform security for black-box non-interactive CCA commitments
• Non-malleable subvector commitments
• Post-quantum multi-party computation
• Constant-round non-malleable commitments from any one-way function
• An Algebraic Approach to Nonmalleability
• Game theoretic notions of fairness in multi-party coin toss
• One-message zero knowledge and non-malleable commitments
• Four-round concurrent non-malleable commitments from one-way functions
• Non-malleable codes for bounded parallel-time tampering
• Concurrent non-malleable statistically hiding commitment
• Concurrent non-malleable commitments (and more) in 3 rounds
• Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
• Unbounded ABE via bilinear entropy expansion, revisited
• Four-round statistical non-malleable zero-knowledge
• Improved black-box constructions of composable secure computation
• Concurrently composable non-interactive secure computation
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• Adaptive hardness and composable security in the plain model from standard assumptions
• Non-malleable statistically hiding commitment from any one-way function
• Non-malleable commitments against quantum attacks
• Round-optimal multi-party computation with identifiable abort
• Black-box non-interactive non-malleable commitments
• Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
• Efficiency preserving transformations for concurrent non-malleable zero knowledge
• Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
• Concurrent Non-Malleable Witness Indistinguishable Argument from Any One-Way Function
• Non-Observable Quantum Random Oracle Model
• Statistical concurrent non-malleable zero-knowledge from one-way functions
• Expedient Non-malleability Notions for Hash Functions
• A new approach to efficient non-malleable zero-knowledge
• Concurrent Nonmalleable Commitments
• \(\log^\ast\)-round game-theoretically-fair leader election
• Constant-round non-malleable commitments from sub-exponential one-way functions
• 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
• Round-efficient black-box construction of composable multi-party computation

This page was built for publication: Concurrent Non-malleable Commitments from Any One-Way Function

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