Pages that link to "Item:Q2129009"
From MaRDI portal
The following pages link to Non-malleable codes for bounded parallel-time tampering (Q2129009):
Displaying 14 items.
- Non-malleable coding against bit-wise and split-state tampering (Q514470) (← links)
- Non-malleable codes for partial functions with manipulation detection (Q776000) (← links)
- 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 space-bounded tampering (Q1678365) (← links)
- Linear-time non-malleable codes in the bit-wise independent tampering model (Q1705709) (← links)
- Non-malleable codes against lookahead tampering (Q1738066) (← links)
- Non-malleability against polynomial tampering (Q2102059) (← links)
- Non-malleable time-lock puzzles and applications (Q2697901) (← links)
- Non-Malleable Codes (Q4561508) (← links)
- (Nondeterministic) hardness vs. non-malleability (Q6097260) (← links)
- Continuously non-malleable codes against bounded-depth tampering (Q6175984) (← links)
- (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates (Q6489333) (← links)
- Non-malleable fuzzy extractors (Q6547975) (← links)
- Non-malleable codes with optimal rate for poly-size circuits (Q6637518) (← links)