Explore a groundbreaking paper presented at Crypto 2018 that delves into proofs of work derived from worst-case assumptions. Gain insights into the collaborative research by Marshall Ball, Alon Rosen, Manuel Sabin, and Prashant Nalini Vasudevan as they examine novel approaches to cryptographic protocols. Discover how this 24-minute presentation challenges conventional thinking and potentially revolutionizes the field of cryptography.
Overview
Syllabus
Proofs of Work from Worst Case Assumptions
Taught by
TheIACR
Related Courses
-
Zero Knowledge Proofs
-
Simple Proofs of Sequential Work
-
Multi Theorem Preprocessing NIZKs from Lattices
-
Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
-
PoW Based Distributed Cryptography with No Trusted Setup
-
Non-malleable Codes from Average-Case Hardness
