Pages that link to "Item:Q3581449"

The following pages link to New and improved constructions of non-malleable cryptographic protocols (Q3581449):

Displaying 32 items.

• Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
• Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP (Q893613) (← links)
• 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)
• Bandwidth-efficient threshold EC-DSA (Q2055695) (← links)
• Black-box non-interactive non-malleable commitments (Q2056786) (← links)
• Non-malleable codes for bounded parallel-time tampering (Q2129009) (← links)
• Non-malleable commitments against quantum attacks (Q2170101) (← links)
• Statistical concurrent non-malleable zero-knowledge from one-way functions (Q2188970) (← links)
• Non-malleable encryption: simpler, shorter, stronger (Q2210445) (← links)
• Non-black-box simulation in the fully concurrent setting, revisited (Q2423842) (← links)
• Novel \(\Omega\)-protocols for NP (Q2480118) (← links)
• Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions (Q2695656) (← links)
• Non-malleable time-lock puzzles and applications (Q2697901) (← links)
• Non-black-box simulation from one-way functions and applications to resettable security (Q2802147) (← links)
• Concurrent Non-Malleable Commitments (and More) in 3 Rounds (Q2829950) (← links)
• Expedient Non-malleability Notions for Hash Functions (Q3073712) (← links)
• (Q3154857) (← links)
• Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model (Q3392944) (← links)
• Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge (Q3408214) (← links)
• Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model (Q3519532) (← links)
• Nonmalleable Cryptography (Q4442845) (← links)
• Cryptography Using Captcha Puzzles (Q4916003) (← links)
• Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles (Q5117380) (← links)
• An Algebraic Approach to Nonmalleability (Q5157398) (← links)
• Completely Non-malleable Encryption Revisited (Q5445447) (← links)
• The Complexity of Zero Knowledge (Q5458822) (← links)
• Constant-Round Nonmalleable Commitments from Any One-Way Function (Q5501951) (← 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)
• How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach (Q6582228) (← links)
• Black-box (and fast) non-malleable zero knowledge (Q6653055) (← links)