Optimal computational split-state non-malleable codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1414321 (Why is no real title available?)
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations
- A statistical theorem of set addition
- Affine-evasive sets modulo a prime
- BiTR: built-in tamper resilience
- Block-wise non-malleable codes
- Capacity of non-malleable codes
- Continuous non-malleable codes
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Efficient non-malleable codes and key-derivation for poly-size tampering circuits
- Explicit non-malleable codes against bit-wise tampering and permutations
- From single-bit to multi-bit public-key encryption via non-malleable codes
- Locally updatable and locally decodable codes
- Low-degree tests at large distances
- Non-malleable codes from additive combinatorics (extended abstract)
- Non-malleable codes from two-source extractors
- Non-malleable reductions and applications
- On the Bogolyubov-Ruzsa lemma
- Optimal algebraic manipulation detection codes in the constant-error model
- Private Locally Decodable Codes
- Public-Key Locally-Decodable Codes
- Tamper and Leakage Resilience in the Split-State Model
- Theory of Cryptography
Cited in
(26)- Continuously non-malleable codes in the split-state model
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
- Split-state non-malleable codes and secret sharing schemes for quantum messages
- Locally decodable and updatable non-malleable codes and their applications
- Non-malleable codes from leakage resilient cryptographic primitives
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
- Non-malleable codes for bounded parallel-time tampering
- Strong continuous non-malleable encoding schemes with tamper-detection
- Non-malleable secret sharing against bounded joint-tampering attacks in the plain model
- Explicit non-malleable codes from bipartite graphs
- Continuously non-malleable secret sharing for general access structures
- On the round complexity of black-box secure MPC
- Practical continuously non-malleable randomness encoders in the random oracle model
- Round-optimal black-box MPC in the plain model
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
- Non-Malleable Codes from Additive Combinatorics
- Non-malleable codes with optimal rate for poly-size circuits
- Interactive non-malleable codes
- Continuously non-malleable codes with split-state refresh
- Four-state non-malleable codes with explicit constant rate
- (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates
- Privacy amplification from non-malleable codes
- On the related-key attack security of authenticated encryption schemes
- Practical non-malleable codes from symmetric-key primitives in 2-split-state model
- Four-state non-malleable codes with explicit constant rate
- Non-malleable Codes with Split-State Refresh
This page was built for publication: Optimal computational split-state non-malleable codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2799103)
