Overview
Explore an innovative approach to automated cryptographic analysis presented at Eurocrypt 2016. Delve into the world of generic group models and automated proofs for cryptographic constructions. Learn about bilinear groups, security experiments, and constraint solving rules. Discover how simplification, coefficient extraction, and case distinction techniques are applied in this cutting-edge research. Examine real-world examples and gain insights into the implementation of this automated unbounded analysis method for cryptographic constructions.
Syllabus
Introduction
Goal
Motivation
Related work
Bilinear Groups
Generic Model
Automated Proofs
Address with Strategy
Previous Work
Security Experiment
Constraint Solving Rules
Simplification
Coefficient Extraction
Case Distinction
Implementation
Real Examples
Summary
Taught by
TheIACR