Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
From MaRDI portal
Publication:2272981
DOI10.1016/j.ic.2019.05.001zbMath1455.94147OpenAlexW2585297502WikidataQ127889398 ScholiaQ127889398MaRDI QIDQ2272981
Mukul Kulkarni, Dana Dachman-Soled, Aria Shahverdi
Publication date: 17 September 2019
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2019.05.001
Related Items (1)
Cites Work
- Non-malleable coding against bit-wise and split-state tampering
- Non-malleable codes for partial functions with manipulation detection
- Continuously non-malleable codes in the split-state model from minimal assumptions
- Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering
- Non-malleable codes for space-bounded tampering
- Query-efficient locally decodable codes of subexponential length
- Non-Malleable Encryption: Simpler, Shorter, Stronger
- Information-Theoretic Local Non-malleable Codes and Their Applications
- Optimal Computational Split-state Non-malleable Codes
- Non-malleable Codes from Two-Source Extractors
- Tamper and Leakage Resilience in the Split-State Model
- A Tamper and Leakage Resilient von Neumann Architecture
- Non-malleable Reductions and Applications
- New affine-invariant codes from lifting
- Capacity of non-malleable codes
- Locally Decodable Codes: A Brief Survey
- On the efficiency of local decoding procedures for error-correcting codes
- Intersection Theorems for Systems of Sets
- New Limits to Classical and Quantum Instance Compression
- Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations
- Towards 3-query locally decodable codes of subexponential length
- Private Circuits II: Keeping Secrets in Tamperable Circuits
- Nonmalleable Cryptography
- Non-malleable codes and extractors for small-depth circuits, and affine functions
- 3-query locally decodable codes of subexponential length
- Cryptography with Tamperable and Leaky Memory
- Non-malleable codes from additive combinatorics
- A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
- Leakage-Resilient Non-malleable Codes
- Locally Decodable and Updatable Non-malleable Codes and Their Applications
- Tamper Detection and Continuous Non-malleable Codes
- From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes
- Local Correctability of Expander Codes
- Explicit two-source extractors and resilient functions
- Textbook non-malleable commitments
- Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits
- High-rate codes with sublinear-time decoding
- Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes
- Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
- Continuous Non-malleable Codes
- Locally Updatable and Locally Decodable Codes
- Theory of Cryptography
This page was built for publication: Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
