Non-malleable codes with optimal rate for poly-size circuits
From MaRDI portal
(Redirected from Publication:6637518)
Cites work
- (Nondeterministic) hardness vs. non-malleability
- A note on perfect correctness by derandomization
- A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations
- Capacity of non-malleable codes
- Derandomization in Cryptography
- Derandomizing Arthur-Merlin games using hitting sets
- Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits
- Explicit list-decodable codes with optimal rate for computationally bounded channels
- Explicit rate-1 non-malleable codes for local tampering
- Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity
- Explicit, almost optimal, epsilon-balanced codes
- Four-state non-malleable codes with explicit constant rate
- Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
- Hardness vs randomness
- scientific article; zbMATH DE number 2019636 (Why is no real title available?)
- scientific article; zbMATH DE number 1559537 (Why is no real title available?)
- scientific article; zbMATH DE number 1414321 (Why is no real title available?)
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (extended abstract)
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Low-End Uniform Hardness versus Randomness Tradeoffs for AM
- Near-linear time decoding of Ta-Shma’s codes via splittable regularity
- Nearly optimal pseudorandomness from hardness
- New near-linear time decodable codes closer to the GV bound
- Non-malleability against polynomial tampering
- Non-malleable codes
- Non-malleable codes against bounded polynomial time tampering
- Non-malleable codes and extractors for small-depth circuits, and affine functions
- Non-malleable codes for bounded depth, bounded fan-in circuits
- Non-malleable codes for bounded parallel-time tampering
- Non-malleable codes for decision trees
- Non-malleable codes from additive combinatorics (extended abstract)
- Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering
- Non-malleable codes from two-source extractors
- Non-malleable codes, extractors and secret sharing for interleaved tampering and composition of tampering
- Non-malleable extractors and codes, with their many tampered extensions
- Non-malleable extractors and non-malleable codes: partially optimal constructions
- Non-malleable randomness encoders and their applications
- Optimal computational split-state non-malleable codes
- Optimal rate code constructions for computationally simple channels
- Pseudorandomness for approximate counting and sampling
- Pseudorandomness when the odds are against you
- Rate one-third non-malleable codes
- Simple extractors for all min-entropies and a new pseudorandom generator
- Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors
- Tamper and Leakage Resilience in the Split-State Model
- The complexity of distributions
- The journey from NP to TFNP hardness
- Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
This page was built for publication: Non-malleable codes with optimal rate for poly-size circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637518)
