Non-malleable codes
From MaRDI portal
Publication:4561508
DOI10.1145/3178432zbMATH Open1409.94869DBLPjournals/jacm/DziembowskiPW18OpenAlexW2164908759WikidataQ99673000 ScholiaQ99673000MaRDI QIDQ4561508FDOQ4561508
Authors: Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wichs 
Publication date: 6 December 2018
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3178432
Recommendations
- Efficient non-malleable codes and key-derivation for poly-size tampering circuits
- Tamper detection and continuous non-malleable codes
- Non-malleable reductions and applications
- Non-malleable codes for partial functions with manipulation detection
- Non-malleable codes for bounded parallel-time tampering
Cited In (69)
- Extractors: low entropy requirements colliding with non-malleability
- Non-malleable codes from leakage resilient cryptographic primitives
- Efficiently testable circuits without conductivity
- Algebraic restriction codes and their applications
- Non-malleable codes with optimal rate for poly-size circuits
- Interactive non-malleable codes against desynchronizing attacks in the multi-party setting
- (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates
- Nonmalleable extractors and codes, with their many tampered extensions
- Continuously non-malleable codes in the split-state model
- Non-malleable encryption: simpler, shorter, stronger
- Locally decodable and updatable non-malleable codes and their applications
- Continuously non-malleable codes against bounded-depth tampering
- A new class of security oriented error correcting robust codes
- Secret sharing with statistical privacy and computational relaxed non-malleability
- Subversion-resilient signatures: definitions, constructions and applications
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Leakage resilience of the Blom's key distribution scheme
- Non-malleable codes for space-bounded tampering
- Capacity of non-malleable codes
- Rate one-third non-malleable codes
- Efficient non-malleable codes and key-derivation for poly-size tampering circuits
- Non-malleable reductions and applications
- Explicit non-malleable codes against bit-wise tampering and permutations
- Leakage-resilient non-malleable codes
- Tamper detection and continuous non-malleable codes
- Disjoint difference families and their applications
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
- Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering
- Security of hedged Fiat-Shamir signatures under fault attacks
- Non-malleable codes for bounded parallel-time tampering
- Non-malleable codes for decision trees
- Explicit non-malleable codes from bipartite graphs
- Block-wise non-malleable codes
- Codes for detection of limited view algebraic tampering
- Non-malleable secret sharing against bounded joint-tampering attacks in the plain model
- Non-malleable codes for bounded depth, bounded fan-in circuits
- Continuously non-malleable secret sharing for general access structures
- On the round complexity of black-box secure MPC
- Practical continuously non-malleable randomness encoders in the random oracle model
- Capacity of non-malleable codes
- (Nondeterministic) hardness vs. non-malleability
- Title not available (Why is that?)
- Title not available (Why is that?)
- Non-malleable extractors and non-malleable codes: partially optimal constructions
- Non-Malleable Codes from Additive Combinatorics
- Affine-evasive sets modulo a prime
- Multi-source non-malleable extractors and applications
- Detection of algebraic manipulation in the presence of leakage
- Interactive non-malleable codes
- One-time programs with limited memory
- On secret sharing, randomness, and random-less reductions for secret sharing
- Impossibility on tamper-resilient cryptography with uniqueness properties
- Continuously non-malleable codes with split-state refresh
- Four-state non-malleable codes with explicit constant rate
- Non-malleable codes for partial functions with manipulation detection
- Non-malleability against polynomial tampering
- Privacy amplification from non-malleable codes
- Explicit rate-1 non-malleable codes for local tampering
- The Chaining Lemma and its application
- A new approach to efficient non-malleable zero-knowledge
- Linear-time non-malleable codes in the bit-wise independent tampering model
- Non-Overlapping Codes
- Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions
- Non-malleable codes from two-source extractors
- Non-malleable codes from additive combinatorics (extended abstract)
- An introduction to robust codes over finite fields
- Bounded tamper resilience: how to go beyond the algebraic barrier
- Non-malleable Codes with Split-State Refresh
- Non-malleable functions and their applications
This page was built for publication: Non-malleable codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4561508)
