(Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates
From MaRDI portal
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
- All-or-nothing encryption and the package transform
- BiTR: built-in tamper resilience
- Block-wise non-malleable codes
- Capacity of non-malleable codes
- Circuits resilient to additive attacks with applications to secure computation
- Continuous non-malleable codes
- 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
- Exposure-resilient functions and all-or-nothing transforms
- From single-bit to multi-bit public-key encryption via non-malleable codes
- scientific article; zbMATH DE number 1088257 (Why is no real title available?)
- scientific article; zbMATH DE number 1149907 (Why is no real title available?)
- scientific article; zbMATH DE number 1418314 (Why is no real title available?)
- Information-Theoretic Local Non-malleable Codes and Their Applications
- Local non-malleable codes in the bounded retrieval model
- Locally decodable and updatable non-malleable codes and their applications
- Non-malleability against polynomial tampering
- Non-malleable codes against bounded polynomial time tampering
- Non-malleable codes for bounded depth, bounded fan-in circuits
- Non-malleable codes for bounded parallel-time tampering
- Non-malleable codes for partial functions with manipulation detection
- Non-malleable codes for space-bounded tampering
- 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 reductions and applications
- On the importance of eliminating errors in cryptographic computations
- Optimal computational split-state non-malleable codes
- Secure outsourcing of cryptographic circuits manufacturing
- Securing circuits against constant-rate tampering
- Securing circuits and protocols against \(1/\mathrm{poly}(k)\) tampering rate
- Security analysis and improvements for the IETF MLS standard for group messaging
- Semantic security for the wiretap channel
- Something about all or nothing (transforms)
- Steel: composable hardware-based stateful and randomised functional encryption
- 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 Wire-Tap Channel
- Theory of Cryptography
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
This page was built for publication: (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489333)
