Zero Knowledge cover image

STIR with Gal Arnon & Giacomo Fenzi

Zero Knowledge

00:00

Folding and Verification in Cryptography

Exploring the iterative folding process in cryptography where a function is folded into smaller domains to achieve a low degree function that is verified for consistency with the original function through queries. The chapter delves into the concept of folding polynomials, its implications for reducing polynomial degrees, and transitioning between evaluation domains.

Transcript
Play full episode

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app