Research presented at CRYPTO 2021 introduces a compact ring signature scheme using components instantiated from LWE. The scheme allows each signer to sign on behalf of a ring of users, offering properties of unforgeability, anonymity, and compactness. The work explores the possibility of building co

0 views • 25 slides

Exploring the history and motivation behind the Circuit Lower Bounds Program focused on proving complexity class separations through non-trivial derandomization, with a primary emphasis on Strong Average-Case Lower Bounds. Ren and Chen delve into the pursuit to establish ?? ≠ ? since the 1980s.

0 views • 61 slides

Tali Kaufman and Shachar Lovett present a new extension of the Weil bound for character sums, providing applications to coding theory. The Weil bound offers insights into the behavior of low-degree polynomials, distinguishing between structured and random-like functions. This extension has implicati

0 views • 28 slides

Delve into the realm of derandomizing algorithms with Oded Goldreich from the Weizmann Institute of Science as he discusses standard and quantified derandomization challenges, exploring the search problems and proofs underlying the quest to find input solutions for specific circuit classes. Discover

0 views • 9 slides

Delve into the realm of randomness in computation as discussed by prominent researchers including Moni Naor, Ran Raz, Luca Trevisan, Salil Vadhan, Avi Wigderson, and Omer Reingold. Uncover the significance of randomness in various facets of computing such as distributed computing, cryptography, comm

0 views • 25 slides