(Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates
From MaRDI portal
Publication:6489333
DOI10.1007/S00145-024-09498-2MaRDI QIDQ6489333
Yiannis Tselekounis, Feng-Hao Liu, Aggelos Kiayias
Publication date: 21 April 2024
Published in: Journal of Cryptology (Search for Journal in Brave)
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Theory of error-correcting codes and error-detecting codes (94Bxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-malleable codes for partial functions with manipulation detection
- Secure outsourcing of cryptographic circuits manufacturing
- 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
- Local non-malleable codes in the bounded retrieval model
- Steel: composable hardware-based stateful and randomised functional encryption
- Security analysis and improvements for the IETF MLS standard for group messaging
- Non-malleability against polynomial tampering
- Non-malleable codes for bounded parallel-time tampering
- Non-malleable codes against bounded polynomial time tampering
- Information-Theoretic Local Non-malleable Codes and Their Applications
- Optimal Computational Split-state Non-malleable Codes
- Non-malleable Codes from Two-Source Extractors
- Tamper Resilient Circuits: The Adversary at the Gates
- Semantic Security for the Wiretap Channel
- 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
- Capacity of non-malleable codes
- Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
- BiTR: Built-in Tamper Resilience
- Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations
- The Wire-Tap Channel
- All-or-nothing encryption and the package transform
- 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
- 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
- Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- 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
- Something about all or nothing (transforms)
- On the importance of eliminating errors in cryptographic computations
This page was built for publication: (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates