Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes

DOI10.1007/978-3-662-54365-8_13zbMath1404.94057OpenAlexW3007821667MaRDI QIDQ5738792

Mukul Kulkarni, Dana Dachman-Soled, Aria Shahverdi

Publication date: 13 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-54365-8_13

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

Interactive non-malleable codes ⋮ Continuously non-malleable codes against bounded-depth tampering ⋮ Continuously non-malleable codes in the split-state model ⋮ Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes ⋮ (In)security of ring-LWE under partial key exposure ⋮ Towards a ring analogue of the leftover hash lemma ⋮ Four-state non-malleable codes with explicit constant rate

Cites Work

• Non-malleable coding against bit-wise and split-state 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
• Private Circuits II: Keeping Secrets in Tamperable Circuits
• Nonmalleable Cryptography
• 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
• Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
• Continuous Non-malleable Codes
• Locally Updatable and Locally Decodable Codes
• Theory of Cryptography
• Unnamed Item
• Unnamed Item

This page was built for publication: Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes