Pages that link to "Item:Q2181859"
From MaRDI portal
The following pages link to Non-malleable codes for decision trees (Q2181859):
Displaying 11 items.
- Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering (Q1653115) (← links)
- Non-malleable codes for bounded parallel-time tampering (Q2129009) (← links)
- Continuously non-malleable secret sharing for general access structures (Q2175937) (← links)
- Interactive non-malleable codes (Q2175939) (← links)
- Non-malleable encryption: simpler, shorter, stronger (Q2210445) (← links)
- Continuously non-malleable codes in the split-state model (Q2210446) (← links)
- Continuously non-malleable secret sharing: joint tampering, plain model and capacity (Q2697864) (← links)
- (Nondeterministic) hardness vs. non-malleability (Q6097260) (← links)
- Continuously non-malleable codes against bounded-depth tampering (Q6175984) (← links)
- Non-malleable fuzzy extractors (Q6547975) (← links)
- Non-malleable codes with optimal rate for poly-size circuits (Q6637518) (← links)