Optimal Computational Split-state Non-malleable Codes
From MaRDI portal
Publication:2799103
DOI10.1007/978-3-662-49099-0_15zbMath1382.94038OpenAlexW2295237590MaRDI QIDQ2799103
Hemanta K. Maji, Divesh Aggarwal, Omkant Pandey, Manoj Prabhakaran, Shashank Agrawal, Divya Gupta
Publication date: 8 April 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49099-0_15
pseudorandom generatorsone-way functionsexplicit constructionnon-malleable codessplit-stateauthenticated encryption schemescomputational settingrate 1
Related Items (20)
On the round complexity of black-box secure MPC ⋮ Non-malleable codes for bounded parallel-time tampering ⋮ Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ Practical continuously non-malleable randomness encoders in the random oracle model ⋮ Continuously non-malleable secret sharing for general access structures ⋮ Interactive non-malleable codes ⋮ Privacy amplification from non-malleable codes ⋮ On the related-key attack security of authenticated encryption schemes ⋮ Strong continuous non-malleable encoding schemes with tamper-detection ⋮ Explicit non-malleable codes from bipartite graphs ⋮ Practical non-malleable codes from symmetric-key primitives in 2-split-state model ⋮ Round-optimal black-box MPC in the plain model ⋮ Continuously non-malleable codes in the split-state model ⋮ Non-Malleable Codes from Additive Combinatorics ⋮ 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 ⋮ Continuously non-malleable codes with split-state refresh ⋮ Four-state non-malleable codes with explicit constant rate ⋮ Locally decodable and updatable non-malleable codes and their applications ⋮ Non-malleable secret sharing against bounded joint-tampering attacks in the plain model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Affine-evasive sets modulo a prime
- Non-malleable coding against bit-wise and split-state tampering
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- A statistical theorem of set addition
- On the Bogolyubov-Ruzsa lemma
- Non-malleable Codes from Two-Source Extractors
- Tamper and Leakage Resilience in the Split-State Model
- Non-malleable Reductions and Applications
- Capacity of non-malleable codes
- BiTR: Built-in Tamper Resilience
- Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations
- Public-Key Locally-Decodable Codes
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Non-malleable codes from additive combinatorics
- A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
- Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model
- 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
- Private Locally Decodable Codes
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Theory of Cryptography
- Continuous Non-malleable Codes
- Locally Updatable and Locally Decodable Codes
This page was built for publication: Optimal Computational Split-state Non-malleable Codes
