Continuously non-malleable codes in the split-state model
From MaRDI portal
Publication:2210446
Recommendations
Cites work
- A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations
- A tamper and leakage resilient von Neumann architecture
- Affine-evasive sets modulo a prime
- BiTR: built-in tamper resilience
- Block-wise non-malleable codes
- Bounded tamper resilience: how to go beyond the algebraic barrier
- Capacity of non-malleable codes
- Circuits resilient to additive attacks with applications to secure computation
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
- Continuous non-malleable codes
- Continuous non-malleable codes in the 8-split-state model
- Continuous space-bounded non-malleable codes from stronger proofs-of-space
- Continuously non-malleable codes in the split-state model from minimal assumptions
- Continuously non-malleable codes with split-state refresh
- Continuously non-malleable codes with split-state refresh
- Continuously non-malleable secret sharing for general access structures
- Cryptography secure against related-key attacks and tampering
- Cryptography with tamperable and leaky memory
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits
- Efficient non-malleable codes and key-derivation for poly-size tampering circuits
- Efficient noninteractive proof systems for bilinear groups
- Efficient public-key cryptography in the presence of key leakage
- Explicit non-malleable codes against bit-wise tampering and permutations
- Four-state non-malleable codes with explicit constant rate
- Four-state non-malleable codes with explicit constant rate
- From single-bit to multi-bit public-key encryption via non-malleable codes
- scientific article; zbMATH DE number 1808214 (Why is no real title available?)
- scientific article; zbMATH DE number 1302835 (Why is no real title available?)
- scientific article; zbMATH DE number 2009976 (Why is no real title available?)
- scientific article; zbMATH DE number 1842511 (Why is no real title available?)
- Inception makes non-malleable codes stronger
- Information-Theoretic Local Non-malleable Codes and Their Applications
- Leakage-resilient cryptography from the inner-product extractor
- Leakage-resilient non-malleable codes
- Leakage-resilient storage
- Linear-time non-malleable codes in the bit-wise independent tampering model
- Local non-malleable codes in the bounded retrieval model
- Locally decodable and updatable non-malleable codes and their applications
- Locally decodable and updatable non-malleable codes and their applications
- 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 decision trees
- Non-malleable codes for partial functions with manipulation detection
- Non-malleable codes for space-bounded tampering
- Non-Malleable Codes from Additive Combinatorics
- 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 with Split-State Refresh
- Non-malleable encryption: simpler, shorter, stronger
- Non-malleable extractors and codes, with their many tampered extensions
- Non-malleable reductions and applications
- Non-malleable secret sharing
- Non-malleable secret sharing in the computational setting: adaptive tampering, noisy-leakage resilience, and improved rate
- On the importance of eliminating errors in cryptographic computations
- On the impossibility of cryptography with tamperable randomness
- Optimal computational split-state non-malleable codes
- Private Circuits II: Keeping Secrets in Tamperable Circuits
- Rate-optimizing compilers for continuously non-malleable codes
- Resettable public-key encryption: how to encrypt on a virtual machine
- Resettably Secure Computation
- RKA security beyond the linear barrier: IBE, encryption and signatures
- Securing circuits against constant-rate tampering
- Securing circuits and protocols against \(1/\mathrm{poly}(k)\) tampering rate
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Tamper and Leakage Resilience in the Split-State Model
- Tamper detection and continuous non-malleable codes
- Tamper resilient circuits: the adversary at the gates
- Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
- The Chaining Lemma and its application
- Theory of Cryptography
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
- Upper and lower bounds for continuous non-malleable codes
Cited in
(17)- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
- Inception makes non-malleable codes stronger
- Upper and lower bounds for continuous non-malleable codes
- Rate-optimizing compilers for continuously non-malleable codes
- Continuous non-malleable codes in the 8-split-state model
- Non-malleable functions and their applications
- Leakage-resilient non-malleable codes
- Tamper detection and continuous non-malleable codes
- From single-bit to multi-bit public-key encryption via non-malleable codes
- Non-malleable Codes with Split-State Refresh
- Continuous non-malleable codes
- Continuously non-malleable codes with split-state refresh
- Continuously non-malleable codes with split-state refresh
- Practical non-malleable codes from symmetric-key primitives in 2-split-state model
- (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates
- Non-malleable fuzzy extractors
- Continuously non-malleable codes in the split-state model from minimal assumptions
This page was built for publication: Continuously non-malleable codes in the split-state model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2210446)
