YoVDO

Memory Tight Reductions

Offered By: TheIACR via YouTube

Tags

Conference Talks Courses Cryptography Courses Theoretical Computer Science Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

Syllabus

Memory Tight Reductions


Taught by

TheIACR

Related Courses

Applied Cryptography
University of Virginia via Udacity Cryptography II
Stanford University via Coursera Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera Cryptography I
Stanford University via Coursera Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera