Information-Theoretic Local Non-malleable Codes and Their Applications
From MaRDI portal
Publication:2799102
DOI10.1007/978-3-662-49099-0_14zbMath1382.94081OpenAlexW2293343283MaRDI QIDQ2799102
Nishanth Chandran, Bhavana Kanukurthi, Srinivasan Raghuraman
Publication date: 8 April 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49099-0_14
Related Items (10)
Interactive non-malleable codes ⋮ Continuously non-malleable codes against bounded-depth tampering ⋮ 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 ⋮ Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes ⋮ Continuously non-malleable codes with split-state refresh ⋮ Four-state non-malleable codes with explicit constant rate ⋮ Information-Theoretic Local Non-malleable Codes and Their Applications ⋮ Locally decodable and updatable non-malleable codes and their applications
Cites Work
- Non-malleable coding against bit-wise and split-state tampering
- Information-Theoretic Local Non-malleable Codes and Their Applications
- Non-malleable Codes from Two-Source Extractors
- Oblivious RAMs without cryptogrpahic assumptions
- Tamper and Leakage Resilience in the Split-State Model
- Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead
- A Tamper and Leakage Resilient von Neumann Architecture
- Non-malleable Reductions and Applications
- Capacity of non-malleable codes
- Perfectly Secure Oblivious RAM without Random Oracles
- How to share a secret
- On the efficiency of local decoding procedures for error-correcting codes
- Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations
- Software protection and simulation on oblivious RAMs
- Bit Encryption Is Complete
- 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
- From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes
- Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits
- Continuous Non-malleable Codes
- Locally Updatable and Locally Decodable Codes
- Locally Decodable Codes
This page was built for publication: Information-Theoretic Local Non-malleable Codes and Their Applications
