Efficient Cryptographic Proofs from RAA Codes
International Centre for Theoretical Sciences via YouTube
Lead AI-Native Products with Microsoft's Agentic AI Program
Google Data Analytics, IBM AI & Meta Marketing — All in One Subscription
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore how RAA codes can be leveraged to construct efficient cryptographic proofs in this 31-minute conference talk from the ICTS Workshop on HDXs and Codes. Discover the intersection between error-correcting codes and cryptographic proof systems, examining how specific properties of RAA (Reverse Affine Algebra) codes enable the development of more efficient proof mechanisms. Learn about the theoretical foundations underlying these constructions and their potential applications in modern cryptography. Understand the mathematical techniques used to analyze the efficiency and security properties of these proof systems, and gain insights into how advances in coding theory can drive innovations in cryptographic protocols. The presentation is part of a comprehensive workshop exploring the connections between High Dimensional Expanders and Error-Correcting Codes, featuring cutting-edge research at the intersection of mathematics, theoretical computer science, and cryptography.
Syllabus
Efficient Cryptographic Proofs from RAA Codes by Nicolas Resch
Taught by
International Centre for Theoretical Sciences