Non-malleable codes with optimal rate for poly-size circuits

DOI10.1007/978-3-031-58737-5_2MaRDI QIDQ6637518

Jad Silbak, Marshall Ball, Ronen Shaltiel

Publication date: 13 November 2024

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-malleable coding against bit-wise and split-state tampering
• Derandomizing Arthur-Merlin games using hitting sets
• Hardness vs randomness
• Non-malleable randomness encoders and their applications
• Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering
• Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
• Explicit list-decodable codes with optimal rate for computationally bounded channels
• Non-malleability against polynomial tampering
• Non-malleable codes, extractors and secret sharing for interleaved tampering and composition of tampering
• Non-malleable codes for bounded parallel-time tampering
• Non-malleable codes for decision trees
• Explicit rate-1 non-malleable codes for local tampering
• Non-malleable codes against bounded polynomial time tampering
• Pseudorandomness for approximate counting and sampling
• Optimal Computational Split-state Non-malleable Codes
• Non-malleable Codes from Two-Source Extractors
• The Complexity of Distributions
• Tamper and Leakage Resilience in the Split-State Model
• Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits
• Capacity of Non-Malleable Codes
• Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
• Optimal Rate Code Constructions for Computationally Simple Channels
• Simple extractors for all min-entropies and a new pseudorandom generator
• Low-End Uniform Hardness versus Randomness Tradeoffs for AM
• Non-Malleable Codes
• The Journey from NP to TFNP Hardness
• Explicit, almost optimal, epsilon-balanced codes
• Improved non-malleable extractors, non-malleable codes and independent source extractors
• Non-malleable codes and extractors for small-depth circuits, and affine functions
• Non-malleable codes from additive combinatorics
• A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
• A Note on Perfect Correctness by Derandomization
• Non-malleable extractors and codes, with their many tampered extensions
• Pseudorandomness when the odds are against you
• Derandomization in Cryptography
• Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
• Simulating independence
• Four-state non-malleable codes with explicit constant rate
• Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity
• Near-linear time decoding of Ta-Shma’s codes via splittable regularity
• Rate one-third non-malleable codes
• (Nondeterministic) hardness vs. non-malleability
• Nearly optimal pseudorandomness from hardness
• New near-linear time decodable codes closer to the GV bound

This page was built for publication: Non-malleable codes with optimal rate for poly-size circuits