Continuously non-malleable codes against bounded-depth tampering
From MaRDI portal
Publication:6175984
DOI10.1007/978-3-031-22972-5_14zbMath1529.94021OpenAlexW4317928273MaRDI QIDQ6175984
Elena Micheli, Daniele Venturi, Sebastian Faust, Gianluca Brian
Publication date: 21 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22972-5_14
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Continuously non-malleable codes in the split-state model from minimal assumptions
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
- 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 codes for space-bounded tampering
- Inception makes non-malleable codes stronger
- 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
- Explicit rate-1 non-malleable codes for local tampering
- Continuous space-bounded non-malleable codes from stronger proofs-of-space
- Upper and lower bounds for continuous non-malleable codes
- Rate-optimizing compilers for continuously non-malleable codes
- Non-malleable codes against bounded polynomial time tampering
- Continuous non-malleable codes in the 8-split-state model
- Continuously non-malleable secret sharing: joint tampering, plain model and capacity
- Non-Malleable Encryption: Simpler, Shorter, Stronger
- Non-Malleable Functions and Their Applications
- Information-Theoretic Local Non-malleable Codes and Their Applications
- Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier
- Public Key Encryption against Related Key Attacks
- Tamper and Leakage Resilience in the Split-State Model
- Continuous Non-malleable Key Derivation and Its Application to Related-Key Security
- Cryptography Secure against Related-Key Attacks and Tampering
- Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations
- How to Protect Yourself without Perfect Shredding
- Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks
- Non-Malleable Codes
- RKA Security beyond the Linear Barrier: IBE, Encryption and Signatures
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- Non-malleable codes from additive combinatorics
- 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
- Non-malleable extractors and codes, with their many tampered extensions
- Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes
- Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
- Continuous Non-malleable Codes
- Theory of Cryptography
- Four-state non-malleable codes with explicit constant rate
- (Nondeterministic) hardness vs. non-malleability
- Continuously non-malleable codes against bounded-depth tampering
