Non-malleable Codes from Average-Case Hardness

Explore the concept of non-malleable codes derived from average-case hardness in this 22-minute conference talk presented at Eurocrypt 2018. Delve into the paper by Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, and Tal Malkin as they discuss encoding scheme expectations, prior work, and their main results. Examine the syntax of NY double encryption, including its keygen and encrypt processes. Understand the construction overview, ingredients for encoding single bits, and the proof sketch. Learn about the generic framework for multi-bit encoding and its positive aspects. Conclude with a summary and explore interesting directions for future research in this field of cryptography.

Introduction
Encoding Scheme Expectations
Examples of F
Prior Work
Our Main Results
Our Results - Highlights
Road Map
Syntax
NY Double Encryption: Keygen
NY Double Encryption: Encrypt
Construction Overview
Ingredients for Encoding Single Bit
Proof Sketch
Why the proof works?
Generic Framework Multi-Bit
Generic Framework: Posit
Summary
Interesting Directions