Tamper detection and continuous non-malleable codes

DOI10.1007/978-3-662-46494-6_19MaRDI QIDQ5261640zbMATH OpenOpenAlexFDO

Authors Zahra Jafargholi, Daniel Wichs

Publication date 6 July 2015

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46494-6_19

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Non-malleable codes
• Continuous non-malleable codes
• Efficient non-malleable codes and key-derivation for poly-size tampering circuits
• Continuously non-malleable codes in the split-state model
• Strong continuous non-malleable encoding schemes with tamper-detection

Cited in

(33)

• Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions
• Fully Leakage-Resilient Codes
• The Chaining Lemma and its application
• Impossibility on tamper-resilient cryptography with uniqueness properties
• Non-malleable codes
• Four-state non-malleable codes with explicit constant rate
• Continuously non-malleable codes against bounded-depth tampering
• Non-malleable codes for partial functions with manipulation detection
• Continuously non-malleable codes in the split-state model
• Non-malleable encryption: simpler, shorter, stronger
• Strong continuous non-malleable encoding schemes with tamper-detection
• Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
• Efficient completely non-malleable and RKA secure public key encryptions
• Non-malleable functions and their applications
• Subversion-resilient signatures: definitions, constructions and applications
• Nonmalleable extractors and codes, with their many tampered extensions
• Non-malleable fuzzy extractors
• Efficient public-key cryptography with bounded leakage and tamper resilience
• (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates
• Efficient non-malleable codes and key-derivation for poly-size tampering circuits
• Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
• Non-malleable Codes with Split-State Refresh
• Non-Malleable Codes from Additive Combinatorics
• Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions
• Non-malleable codes against lookahead tampering
• More efficient public-key cryptography with leakage and tamper resilience
• Bounded tamper resilience: how to go beyond the algebraic barrier
• How to make the Cramer-Shoup cryptosystem secure against linear related-key attacks
• Codes for detection of limited view algebraic tampering
• Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
• Public key encryption resilient to leakage and tampering attacks
• Related-key secure key encapsulation from extended computational bilinear Diffie-Hellman
• Continuous non-malleable codes

This page was built for publication: Tamper detection and continuous non-malleable codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261640)