Practical continuously non-malleable randomness encoders in the random oracle model
From MaRDI portal
Publication:2149829
DOI10.1007/978-3-030-92548-2_15zbMath1504.94139OpenAlexW3206690052MaRDI QIDQ2149829
Publication date: 29 June 2022
Full work available at URL: https://eprint.iacr.org/2021/1269
Cites Work
- Continuously non-malleable codes in the split-state model from minimal assumptions
- Non-malleable randomness encoders and their applications
- Continuously non-malleable secret sharing for general access structures
- Upper and lower bounds for continuous non-malleable codes
- Rate-optimizing compilers for continuously non-malleable codes
- Non-malleable secret sharing in the computational setting: adaptive tampering, noisy-leakage resilience, and improved rate
- Non-Malleable Encryption: Simpler, Shorter, Stronger
- Optimal Computational Split-state Non-malleable Codes
- Non-malleable Codes from Two-Source Extractors
- Tamper and Leakage Resilience in the Split-State Model
- Capacity of non-malleable codes
- Leakage-Resilient Cryptography from the Inner-Product Extractor
- Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations
- Public-Key Encryption in the Bounded-Retrieval Model
- Leakage-Resilient Storage
- Non-Malleable Codes
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- Non-malleable codes from additive combinatorics
- Leakage-Resilient Non-malleable Codes
- Locally Decodable and Updatable Non-malleable Codes and Their Applications
- From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes
- Non-malleable extractors and codes, with their many tampered extensions
- Continuous Non-malleable Codes
- Theory of Cryptography
- Continuously non-malleable codes with split-state refresh
This page was built for publication: Practical continuously non-malleable randomness encoders in the random oracle model
