Continuously non-malleable codes in the split-state model
From MaRDI portal
Publication:2210446
DOI10.1007/s00145-020-09362-zzbMath1453.94077OpenAlexW3044547442MaRDI QIDQ2210446
Daniele Venturi, Pratyay Mukherjee, Sebastian Faust, Jesper Buus Nielsen
Publication date: 6 November 2020
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-020-09362-z
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Affine-evasive sets modulo a prime
- Non-malleable coding against bit-wise and split-state tampering
- Non-malleable codes for partial functions with manipulation detection
- Continuously non-malleable codes in the split-state model from minimal assumptions
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
- 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
- Linear-time non-malleable codes in the bit-wise independent tampering model
- Local non-malleable codes in the bounded retrieval model
- Continuously non-malleable secret sharing for general access structures
- Non-malleable codes for decision trees
- Continuous space-bounded non-malleable codes from stronger proofs-of-space
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
- 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
- Locally decodable and updatable non-malleable codes and their applications
- Non-malleable secret sharing in the computational setting: adaptive tampering, noisy-leakage resilience, and improved rate
- Non-Malleable Encryption: Simpler, Shorter, Stronger
- Information-Theoretic Local Non-malleable Codes and Their Applications
- Optimal Computational Split-state Non-malleable Codes
- Non-malleable Codes from Two-Source Extractors
- Bounded Tamper Resilience: How to Go beyond the Algebraic Barrier
- Tamper Resilient Circuits: The Adversary at the Gates
- On the Impossibility of Cryptography with Tamperable Randomness
- Tamper and Leakage Resilience in the Split-State Model
- Securing Circuits against Constant-Rate Tampering
- A Tamper and Leakage Resilient von Neumann Architecture
- Non-malleable Reductions and Applications
- The Chaining Lemma and Its Application
- Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits
- Capacity of Non-Malleable Codes
- Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- Cryptography Secure against Related-Key Attacks and Tampering
- Leakage-Resilient Cryptography from the Inner-Product Extractor
- BiTR: Built-in Tamper Resilience
- Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations
- Leakage-Resilient Storage
- Private Circuits II: Keeping Secrets in Tamperable Circuits
- Resettably Secure Computation
- Non-Malleable Codes
- Non-Malleable Codes from Additive Combinatorics
- Efficient Noninteractive Proof Systems for Bilinear Groups
- RKA Security beyond the Linear Barrier: IBE, Encryption and Signatures
- Non-malleable codes and extractors for small-depth circuits, and affine functions
- Resettable Public-Key Encryption: How to Encrypt on a Virtual Machine
- Cryptography with Tamperable and Leaky Memory
- Non-malleable secret sharing
- Circuits resilient to additive attacks with applications to secure computation
- Non-malleable codes from additive combinatorics
- A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
- Leakage-Resilient Non-malleable Codes
- 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
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Non-malleable Codes with Split-State Refresh
- 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
- Securing Circuits and Protocols against 1/poly(k) Tampering Rate
- Theory of Cryptography
- Continuously non-malleable codes with split-state refresh
- Four-state non-malleable codes with explicit constant rate
- Continuously non-malleable codes with split-state refresh
- Four-state non-malleable codes with explicit constant rate
- On the importance of eliminating errors in cryptographic computations
This page was built for publication: Continuously non-malleable codes in the split-state model
