Efficient Cryptographic Proofs from RAA Codes
International Centre for Theoretical Sciences via YouTube
Learn Backend Development Part-Time, Online
AI Adoption - Drive Business Value and Organizational Impact
Overview
Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
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