Pages that link to "Item:Q1690265"
From MaRDI portal
The following pages link to Round optimal concurrent non-malleability from polynomial hardness (Q1690265):
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)
- Two-message statistically sender-private OT from LWE (Q1631337) (← 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)
- Round-optimal multi-party computation with identifiable abort (Q2170005) (← links)
- Non-malleable commitments against quantum attacks (Q2170101) (← links)
- Non-malleable vector commitments via local equivocability (Q2697900) (← links)
- Non-malleable time-lock puzzles and applications (Q2697901) (← links)
- Computing weak consistency in polynomial time (extended abstract) (Q2796276) (← links)
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles (Q5117380) (← links)
- An Algebraic Approach to Nonmalleability (Q5157398) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
- Non-malleable vector commitments via local equivocability (Q6054731) (← links)
- Four-round black-box non-malleable schemes from one-way permutations (Q6114274) (← links)
- Statistically sender-private OT from LPN and derandomization (Q6163969) (← links)
- A new approach to efficient non-malleable zero-knowledge (Q6166959) (← links)
- Weak zero-knowledge via the Goldreich-Levin theorem (Q6562563) (← links)
