Non-malleable codes from additive combinatorics
From MaRDI portal
Publication:5259613
DOI10.1145/2591796.2591804zbMath1315.94142OpenAlexW1981712957MaRDI QIDQ5259613
Yevgeniy Dodis, Shachar Lovett, Divesh Aggarwal
Publication date: 26 June 2015
Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2591796.2591804
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Combinatorial codes (94B25)
Related Items (30)
Adaptive extractors and their application to leakage resilient secret sharing ⋮ 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 ⋮ Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions ⋮ Algebraic restriction codes and their applications ⋮ Strong continuous non-malleable encoding schemes with tamper-detection ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Practical non-malleable codes from symmetric-key primitives in 2-split-state model ⋮ Continuously non-malleable codes against bounded-depth tampering ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ Continuously non-malleable codes in the split-state model ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ Codes for Detection of Limited View Algebraic Tampering ⋮ Affine-evasive sets modulo a prime ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Bounded tamper resilience: how to go beyond the algebraic barrier ⋮ Non-malleable coding against bit-wise and split-state tampering ⋮ Non-malleable Codes with Split-State Refresh ⋮ 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 ⋮ Non-Malleable Encryption: Simpler, Shorter, Stronger ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient algorithms for privately releasing marginals via convex relaxations
- The Geometry of Differential Privacy: The Small Database and Approximate Cases
- Faster Algorithms for Privately Releasing Marginals
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Privately Releasing Conjunctions and the Statistical Query Barrier
- On the geometry of differential privacy
- Interactive privacy via the median mechanism
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Lower Bounds in Differential Privacy
- Iterative Constructions and Private Data Release
- Characterizing the sample complexity of private learners
- Faster private release of marginals on small databases
- Bounds on the Sample Complexity for Private Learning and Private Data Release
- Differential Privacy and the Fat-Shattering Dimension of Linear Queries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- Collusion-secure fingerprinting for digital data
- On the complexity of differentially private data release
- Advances in Cryptology – CRYPTO 2004
- Answering n {2+o(1)} counting queries with differential privacy is hard
- Theory of Cryptography
This page was built for publication: Non-malleable codes from additive combinatorics
