Explore a research paper presentation from Crypto 2017 on memory tight reductions, authored by Benedikt Auerbach, David Cash, Manuel Fersch, and Eike Kiltz. Delve into the concepts and findings of this 20-minute talk, which addresses an important topic in cryptography and security. Gain insights into the researchers' approach to memory-efficient reductions and their implications for cryptographic protocols.
Overview
Syllabus
Memory Tight Reductions
Taught by
TheIACR
Related Courses
-
On the Impossibility of Tight Cryptographic Reductions
-
Optimal Security Reductions for Unique Signatures - Bypassing Impossibilities with A Counterexample
-
Compact Structure Preserving Signatures with Almost Tight Security
-
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
-
Tightly Secure Signatures From Five Move Identification Protocols
-
Everybody's a Target - Scalability in Public-Key Encryption
