The chapter focuses on the process of converting a specific construction from AHP to RSIOP, discussing the similarities between the two and the key contribution of recursion and formalizations in the paper.
This week, we explore the Fractal transparent SNARK construction with its authors Dev Ojha and Nick Spooner - both students of Alessandro Chiesa at UC Berkeley. We explore how Fractal works, how it improves on some of the earlier work on Sonic and Marlin, how it borrows from but differentiates itself from STARKs, as well as what they discovered while working on this paper about recursive SNARKs and what makes that property possible.
Just recently, a critical vulnerability was found in the certificate validation functionality on Windows 10 and Windows Server 2016/2019 This bug allows attackers to break the validation of trust in a wide variety of contexts, such as HTTPS and code signing - Trail of Bits has developed a PoC exploit and put up a website Whose Curve is it Anyway that let's users test whether or not they are vulnerable.
To learn more about this vulnerability and the Trail of Bits exploit, please check out this recent blog post entitled: Exploiting the Windows CryptoAPI Vulnerability. Also keep an eye on the ToB blog for security news and explanation pieces like this one.