Continuous non-malleable codes
From MaRDI portal
Recommendations
- Continuously non-malleable codes in the split-state model
- Continuously non-malleable codes in the split-state model from minimal assumptions
- Tamper detection and continuous non-malleable codes
- Continuous non-malleable codes in the 8-split-state model
- Continuously non-malleable codes with split-state refresh
Cited in
(50)- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
- Inception makes non-malleable codes stronger
- Frames as continuous redundant codes
- Subversion-resilient signatures: definitions, constructions and applications
- Impossibility on tamper-resilient cryptography with uniqueness properties
- Non-malleable secret sharing against bounded joint-tampering attacks in the plain model
- Non-malleable functions and their applications
- Practical continuously non-malleable randomness encoders in the random oracle model
- Continuously non-malleable secret sharing for general access structures
- Interactive non-malleable codes
- Continuous space-bounded non-malleable codes from stronger proofs-of-space
- Strong continuous non-malleable encoding schemes with tamper-detection
- Non-malleable encryption: simpler, shorter, stronger
- Continuously non-malleable codes in the split-state model
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
- Upper and lower bounds for continuous non-malleable codes
- Rate-optimizing compilers for continuously non-malleable codes
- Continuous non-malleable codes in the 8-split-state model
- Locally decodable and updatable non-malleable codes and their applications
- Public key encryption resilient to leakage and tampering attacks
- Continuously non-malleable secret sharing: joint tampering, plain model and capacity
- Non-malleable encryption: simpler, shorter, stronger
- Information-Theoretic Local Non-malleable Codes and Their Applications
- Optimal computational split-state non-malleable codes
- Concurrent non-malleable commitments (and more) in 3 rounds
- The Chaining Lemma and its application
- Efficient public-key cryptography with bounded leakage and tamper resilience
- Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions
- Capacity of non-malleable codes
- Non-Malleable Codes from Additive Combinatorics
- Affine-evasive sets modulo a prime
- Nonmalleable extractors and codes, with their many tampered extensions
- Bounded tamper resilience: how to go beyond the algebraic barrier
- Tamper detection and continuous non-malleable codes
- Non-malleable Codes with Split-State Refresh
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
- Fully Leakage-Resilient Codes
- Continuously non-malleable codes with split-state refresh
- Continuously non-malleable codes with split-state refresh
- Four-state non-malleable codes with explicit constant rate
- Rate one-third non-malleable codes
- (Nondeterministic) hardness vs. non-malleability
- Leakage-resilient \textsf{IBE}/\textsf{ABE} with optimal leakage rates from lattices
- Continuously non-malleable codes against bounded-depth tampering
- (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates
- Non-malleable fuzzy extractors
- More efficient public-key cryptography with leakage and tamper resilience
- Uniform black-box separations via non-malleable extractors
- Split-state non-malleable codes and secret sharing schemes for quantum messages
- Continuously non-malleable codes in the split-state model from minimal assumptions
This page was built for publication: Continuous non-malleable codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746349)
