Non-malleable codes with optimal rate for poly-size circuits
type: Item
instance of: scholarly article
title: Non-malleable codes with optimal rate for poly-size circuits
DOI: 10.1007/978-3-031-58737-5_2
author: Marshall Ball
author: Ronen Shaltiel
author: Jad Silbak
publication date: 2024-11-13T00:00:00Z
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7943439
MaRDI profile type: Publication
cites work: Optimal Computational Split-state Non-malleable Codes
cites work: Non-malleable codes from additive combinatorics
cites work: Rate one-third non-malleable codes
cites work: A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
cites work: Q4601848
cites work: Pseudorandomness when the odds are against you
cites work: (Nondeterministic) hardness vs. non-malleability
cites work: Non-malleability against polynomial tampering
cites work: Non-malleable codes against bounded polynomial time tampering
cites work: Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
cites work: Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering
cites work: Non-malleable codes for decision trees
cites work: Simulating independence
cites work: Derandomization in Cryptography
cites work: A Note on Perfect Correctness by Derandomization
cites work: New near-linear time decodable codes closer to the GV bound
cites work: Non-malleable extractors and codes, with their many tampered extensions
cites work: Non-malleable codes and extractors for small-depth circuits, and affine functions
cites work: Non-malleable codes, extractors and secret sharing for interleaved tampering and composition of tampering
cites work: Capacity of Non-Malleable Codes
cites work: Non-malleable coding against bit-wise and split-state tampering
cites work: Non-malleable codes for bounded parallel-time tampering
cites work: Nearly optimal pseudorandomness from hardness
cites work: Non-Malleable Codes
cites work: Non-malleable Codes from Two-Source Extractors
cites work: Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits
cites work: Q4440439
cites work: Explicit rate-1 non-malleable codes for local tampering
cites work: Optimal Rate Code Constructions for Computationally Simple Channels
cites work: Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
cites work: The Journey from NP to TFNP Hardness
cites work: Q4526985
cites work: Near-linear time decoding of Ta-Shma’s codes via splittable regularity
cites work: Four-state non-malleable codes with explicit constant rate
cites work: Non-malleable randomness encoders and their applications
cites work: Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
cites work: Improved non-malleable extractors, non-malleable codes and independent source extractors
cites work: Q5091780
cites work: Q4942658
cites work: Tamper and Leakage Resilience in the Split-State Model
cites work: Derandomizing Arthur-Merlin games using hitting sets
cites work: Hardness vs randomness
cites work: Explicit list-decodable codes with optimal rate for computationally bounded channels
cites work: Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity
cites work: Simple extractors for all min-entropies and a new pseudorandom generator
cites work: Pseudorandomness for approximate counting and sampling
cites work: Low-End Uniform Hardness versus Randomness Tradeoffs for AM
cites work: Explicit, almost optimal, epsilon-balanced codes
cites work: The complexity of distributions
cites work: Q3002782
description: scientific article; zbMATH DE number 7943439