Capacity of non-malleable codes
From MaRDI portal
Publication:2988875
DOI10.1145/2554797.2554814zbMath1366.68042arXiv1309.0458OpenAlexW2279000475MaRDI QIDQ2988875
Mahdi Cheraghchi, Venkatesan Guruswami
Publication date: 19 May 2017
Published in: Proceedings of the 5th conference on Innovations in theoretical computer science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.0458
cryptographyinformation theoryprobabilistic methoderror detectioncoding theorytamper-resilient storage
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items
Constructing locally leakage-resilient linear secret-sharing schemes, 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, The Chaining Lemma and Its Application, (Nondeterministic) hardness vs. non-malleability, Non-malleable encryption: simpler, shorter, stronger, Codes for Detection of Limited View Algebraic Tampering, Affine-evasive sets modulo a prime, Non-Malleable Codes from Additive Combinatorics, Bounded tamper resilience: how to go beyond the algebraic barrier, Non-malleable coding against bit-wise and split-state tampering, 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, Unnamed Item, Four-state non-malleable codes with explicit constant rate, Information-Theoretic Local Non-malleable Codes and Their Applications, Optimal Computational Split-state Non-malleable Codes, Locally decodable and updatable non-malleable codes and their applications, Multi-source non-malleable extractors and applications, Non-malleability against polynomial tampering, Non-malleable secret sharing against bounded joint-tampering attacks in the plain model
Cites Work
- Unnamed Item
- A hierarchy of polynomial time lattice basis reduction algorithms
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Trapdoors for hard lattices and new cryptographic constructions
- Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
- Evaluating Branching Programs on Encrypted Data
- Bounds for Width Two Branching Programs
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- New lattice-based cryptographic constructions
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
