Explore a groundbreaking cryptography research presentation from Crypto 2017 that challenges existing notions about security reductions for unique signatures. Delve into the innovative work of Fuchun Guo, Rongmao Chen, Willy Susilo, Jianchang Lai, Guomin Yang, and Yi Mu as they present their paper on bypassing impossibilities with a counterexample. Learn how this 25-minute talk introduces novel concepts that could potentially reshape our understanding of optimal security reductions in cryptographic systems.
Optimal Security Reductions for Unique Signatures - Bypassing Impossibilities with A Counterexample
Overview
Syllabus
Optimal Security Reductions for Unique Signatures Bypassing Impossibilities with A Counterexample
Taught by
TheIACR
Related Courses
-
Cryptographic Reverse Firewall via Malleable Smooth Projective Hash Functions
-
Memory Tight Reductions
-
On the Provable Security of -EC-DSA Signatures
-
Towards Tightly Secure Lattice Short Signature and Id Based Encryption
-
Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
-
Compact Structure Preserving Signatures with Almost Tight Security
