The following pages link to Non-Malleable Codes (Q4561508):
Displaying 50 items.
- How to build an ideal cipher: the indifferentiability of the Feistel construction (Q271585) (← links)
- Affine-evasive sets modulo a prime (Q477696) (← links)
- Bounded tamper resilience: how to go beyond the algebraic barrier (Q514469) (← links)
- Non-malleable coding against bit-wise and split-state tampering (Q514470) (← links)
- Non-malleable codes for partial functions with manipulation detection (Q776000) (← links)
- Secret sharing with statistical privacy and computational relaxed non-malleability (Q831625) (← links)
- Disjoint difference families and their applications (Q908044) (← links)
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments (Q1631329) (← 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)
- Subversion-resilient signatures: definitions, constructions and applications (Q1989360) (← links)
- Security of hedged Fiat-Shamir signatures under fault attacks (Q2055633) (← links)
- Multi-source non-malleable extractors and applications (Q2056748) (← links)
- Impossibility on tamper-resilient cryptography with uniqueness properties (Q2061927) (← links)
- Non-malleability against polynomial tampering (Q2102059) (← links)
- Non-malleable secret sharing against bounded joint-tampering attacks in the plain model (Q2102060) (← links)
- Non-malleable functions and their applications (Q2121503) (← 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)
- Non-malleable codes for decision trees (Q2181859) (← links)
- Non-malleable encryption: simpler, shorter, stronger (Q2210445) (← links)
- Continuously non-malleable codes in the split-state model (Q2210446) (← links)
- Locally decodable and updatable non-malleable codes and their applications (Q2303459) (← links)
- A new class of security oriented error correcting robust codes (Q2325296) (← links)
- An introduction to robust codes over finite fields (Q2870611) (← links)
- Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions (Q2946437) (← links)
- The Chaining Lemma and Its Application (Q2947530) (← links)
- Leakage Resilience of the Blom’s Key Distribution Scheme (Q2948266) (← links)
- Detection of Algebraic Manipulation in the Presence of Leakage (Q2948267) (← links)
- Non-Overlapping Codes (Q2977285) (← links)
- Capacity of non-malleable codes (Q2988875) (← links)
- One-Time Programs with Limited Memory (Q3454868) (← links)
- Non-Malleable Codes from Additive Combinatorics (Q4637777) (← links)
- (Q5077146) (← links)
- (Q5091780) (← links)
- Nonmalleable Extractors and Codes, with Their Many Tampered Extensions (Q5129235) (← links)
- Non-malleable Codes with Split-State Refresh (Q5738791) (← links)
- (Q5875501) (← links)
- Continuously non-malleable codes with split-state refresh (Q5915916) (← links)
- Four-state non-malleable codes with explicit constant rate (Q5918866) (← links)
- Algebraic restriction codes and their applications (Q6066762) (← links)
- Rate one-third non-malleable codes (Q6083592) (← links)
- (Nondeterministic) hardness vs. non-malleability (Q6097260) (← links)
- On secret sharing, randomness, and random-less reductions for secret sharing (Q6114236) (← links)
- A new approach to efficient non-malleable zero-knowledge (Q6166959) (← links)
