Pages that link to "Item:Q1678367"

The following pages link to Four-round concurrent non-malleable commitments from one-way functions (Q1678367):

Displaying 21 items.

• One-message zero knowledge and non-malleable commitments (Q1629409) (← links)
• Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments (Q1631329) (← links)
• Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds (Q1690213) (← links)
• Round optimal concurrent non-malleability from polynomial hardness (Q1690265) (← links)
• Post-quantum multi-party computation (Q2056694) (← links)
• Black-box non-interactive non-malleable commitments (Q2056786) (← links)
• Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (Q2056787) (← links)
• On the round complexity of black-box secure MPC (Q2128561) (← links)
• Non-malleable codes for bounded parallel-time tampering (Q2129009) (← links)
• Non-malleable vector commitments via local equivocability (Q2697900) (← links)
• Non-malleable time-lock puzzles and applications (Q2697901) (← links)
• Concurrent Non-Malleable Witness Indistinguishable Argument from Any One-Way Function (Q4899219) (← links)
• Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles (Q5117380) (← links)
• An Algebraic Approach to Nonmalleability (Q5157398) (← links)
• Constant-Round Nonmalleable Commitments from Any One-Way Function (Q5501951) (← links)
• Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices (Q5918439) (← links)
• Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices (Q5918662) (← links)
• Non-malleable vector commitments via local equivocability (Q6054731) (← links)
• Four-round black-box non-malleable schemes from one-way permutations (Q6114274) (← links)
• A new approach to efficient non-malleable zero-knowledge (Q6166959) (← links)
• Black-box (and fast) non-malleable zero knowledge (Q6653055) (← links)