Practical Non-Malleable Codes from I-More Extractable Hash Functions

Explore a conference talk on non-malleable codes and extractable hash functions presented at the 23rd ACM Conference on Computer and Communications Security (CCS 2016). Delve into the construction of practical non-malleable codes using l-more extractable hash functions. Examine key concepts such as split-state models, application of primitives, and security considerations. Learn about extractable hash functions, knowledge of exponent assumptions, and their implications for public key encryption. Gain insights into semantic security, collision resistance, and error correction in the context of non-malleable codes. Understand the significance of this research for enhancing cryptographic security and its potential applications in computer and communication systems.

Intro
Experiment
MessageS Prime
Application
Security
Error Correction
Split State Model
Application of the Primitive
Construction of the Primitive
Comparison Table
Logic
Affine
Extractable Hush
Extractable Heart
Zero More Extractable Hash
Knowledge of Exponential Assumption
Question
Construction
Code
Authenticity
Semantic Security
Extractable Hash
Collision Resistance
public key Encryption