Pages that link to "Item:Q5361907"
From MaRDI portal
The following pages link to Textbook non-malleable commitments (Q5361907):
Displaying 28 items.
- One-message zero knowledge and non-malleable commitments (Q1629409) (← links)
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments (Q1631329) (← links)
- The security of lazy users in out-of-band authentication (Q1631350) (← links)
- Another step towards realizing random oracles: non-malleable point obfuscation (Q1648795) (← links)
- Post-quantum multi-party computation (Q2056694) (← links)
- Multi-source non-malleable extractors and applications (Q2056748) (← links)
- Black-box non-interactive non-malleable commitments (Q2056786) (← links)
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (Q2056787) (← links)
- Non-malleability against polynomial tampering (Q2102059) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- Non-malleable codes for bounded parallel-time tampering (Q2129009) (← links)
- Round-optimal multi-party computation with identifiable abort (Q2170005) (← links)
- Non-malleable commitments against quantum attacks (Q2170101) (← links)
- Continuously non-malleable secret sharing for general access structures (Q2175937) (← links)
- Interactive non-malleable codes (Q2175939) (← links)
- Privacy amplification from non-malleable codes (Q2179398) (← links)
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes (Q2272981) (← links)
- Non-malleable vector commitments via local equivocability (Q2697900) (← links)
- Non-malleable time-lock puzzles and applications (Q2697901) (← links)
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds (Q2829950) (← links)
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles (Q5117380) (← links)
- An Algebraic Approach to Nonmalleability (Q5157398) (← links)
- Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes (Q5738792) (← links)
- On the Exact Round Complexity of Self-composable Two-Party Computation (Q5738974) (← links)
- Four-state non-malleable codes with explicit constant rate (Q5918866) (← links)
- Minicrypt primitives with algebraic structure and applications (Q5925579) (← links)
- Non-malleable vector commitments via local equivocability (Q6054731) (← links)
