Pages that link to "Item:Q2799103"
From MaRDI portal
The following pages link to Optimal Computational Split-state Non-malleable Codes (Q2799103):
Displaying 17 items.
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments (Q1631329) (← links)
- Non-malleable secret sharing against bounded joint-tampering attacks in the plain model (Q2102060) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- Non-malleable codes for bounded parallel-time tampering (Q2129009) (← links)
- Practical continuously non-malleable randomness encoders in the random oracle model (Q2149829) (← 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)
- Strong continuous non-malleable encoding schemes with tamper-detection (Q2195381) (← links)
- Continuously non-malleable codes in the split-state model (Q2210446) (← links)
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes (Q2272981) (← links)
- Locally decodable and updatable non-malleable codes and their applications (Q2303459) (← links)
- Non-Malleable Codes from Additive Combinatorics (Q4637777) (← links)
- Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes (Q5738792) (← links)
- Continuously non-malleable codes with split-state refresh (Q5915916) (← links)
- Four-state non-malleable codes with explicit constant rate (Q5918866) (← links)
- (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates (Q6489333) (← links)
