Non-malleable Reductions and Applications
From MaRDI portal
Publication:2941538
DOI10.1145/2746539.2746544zbMath1321.94139OpenAlexW2032056095MaRDI QIDQ2941538
Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski
Publication date: 21 August 2015
Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2746539.2746544
Related Items (25)
Non-malleable codes for bounded parallel-time tampering ⋮ Adaptive extractors and their application to leakage resilient secret sharing ⋮ Continuously non-malleable secret sharing for general access structures ⋮ Interactive non-malleable codes ⋮ Privacy amplification from non-malleable codes ⋮ (Nondeterministic) hardness vs. non-malleability ⋮ Strong continuous non-malleable encoding schemes with tamper-detection ⋮ Extractors: low entropy requirements colliding with non-malleability ⋮ Explicit non-malleable codes from bipartite graphs ⋮ Practical non-malleable codes from symmetric-key primitives in 2-split-state model ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ Continuously non-malleable codes in the split-state model ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ 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 ⋮ Non-malleability against polynomial tampering ⋮ Non-malleable secret sharing against bounded joint-tampering attacks in the plain model
Uses Software
Cites Work
- Unnamed Item
- Ramsey partitions and proximity data structures
- On sparse spanners of weighted graphs
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
- On Approximate Distance Labels and Routing Schemes with Affine Stretch
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Approximate distance oracles
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Near-Linear Time Construction of Sparse Neighborhood Covers
- Shortest-path queries in static networks
- Approximate distance oracles with constant query time
- Automata, Languages and Programming
This page was built for publication: Non-malleable Reductions and Applications
