(Nondeterministic) hardness vs. non-malleability
From MaRDI portal
Publication:6097260
DOI10.1007/978-3-031-15802-5_6OpenAlexW4312790435MaRDI QIDQ6097260
Marshall Ball, Julian Loss, Dana Dachman-Soled
Publication date: 12 June 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-15802-5_6
Related Items (2)
(Nondeterministic) hardness vs. non-malleability ⋮ Continuously non-malleable codes against bounded-depth tampering
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma
- Derandomizing Arthur-Merlin games using hitting sets
- Random generation of combinatorial structures from a uniform distribution
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- On the hardness of computing the permanent of random matrices
- 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
- Non-malleable secret sharing for general access structures
- Non-malleable codes for space-bounded tampering
- Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
- Uniform generation of NP-witnesses using an NP-oracle
- Non-malleability against polynomial tampering
- Non-malleable secret sharing against bounded joint-tampering attacks in the plain model
- Non-malleable codes for bounded parallel-time tampering
- Non-malleable codes for decision trees
- Continuous space-bounded non-malleable codes from stronger proofs-of-space
- Non-malleable codes against bounded polynomial time tampering
- Pseudorandomness for approximate counting and sampling
- Non-malleable Codes from Two-Source Extractors
- Tamper and Leakage Resilience in the Split-State Model
- Non-malleable Reductions and Applications
- Capacity of non-malleable codes
- Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
- Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations
- Simple extractors for all min-entropies and a new pseudorandom generator
- Low-End Uniform Hardness versus Randomness Tradeoffs for AM
- Average Case Complete Problems
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Non-Malleable Codes
- Non-Malleable Codes from Additive Combinatorics
- Overcoming Weak Expectations
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- Non-malleable codes and extractors for small-depth circuits, and affine functions
- Leftover Hash Lemma, Revisited
- Multi-collision resistance: a paradigm for keyless hash functions
- Non-malleable secret sharing
- A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
- Locally Decodable and Updatable Non-malleable Codes and Their Applications
- Non-malleable extractors and codes, with their many tampered extensions
- Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits
- Advances in Cryptology - CRYPTO 2003
- Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
- Continuous Non-malleable Codes
- Improved Extractors for Recognizable and Algebraic Sources
- Four-state non-malleable codes with explicit constant rate
- (Nondeterministic) hardness vs. non-malleability
This page was built for publication: (Nondeterministic) hardness vs. non-malleability
