Computational Integrity with a Public Random String from Quasi Linear PCPs

Explore a conference talk on computational integrity using quasi-linear PCPs with a public random string. Delve into the research presented at Eurocrypt 2017 by a team of cryptography experts. Examine the goals, results, and alternative approaches to non-universal systems. Gain insights into classical theory, cryptographic assumptions, and protocol overviews. Learn about low degree testing, the use of interactions, and the importance of measurements and graphs in this field. Discover how knowledge is applied and summarized in this cutting-edge cryptographic research.

Introduction
Outline
Goal
Result
Other approaches
Non universal systems
Classical theory
Cryptographic assumptions
Protocol overview
Low degree testing
Using interactions
Measurements
Graphs
Knowledge
Summary