Efficient Cryptographic Proofs from RAA Codes
International Centre for Theoretical Sciences via YouTube
PowerBI Data Analyst - Create visualizations and dashboards from scratch
The Most Addictive Python and SQL Courses
Overview
Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
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