Compact Ring Signatures from LWE - CRYPTO 2021 Research
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
1 views • 25 slides
Strong Average-Case Circuit Lower Bounds: A Brief Overview
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.
1 views • 61 slides
New Extension of the Weil Bound for Character Sums
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
1 views • 28 slides
Derandomizing Algorithms: Challenges and Solutions
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
Randomness in Computation: Insights and Prospects
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
Graph Expansion in the New Millennium: Advances and Insights
Explore the evolution of graph expansion studies in the new millennium, focusing on key concepts like expanders, approximation algorithms, metric embeddings, and inapproximability results. Discover how advancements in expansion theory impact derandomization, network routing, and coding theory.
0 views • 25 slides
Fast Derandomization Techniques: Eliminating Randomness Efficiently
Discover effective methods for derandomizing very hard functions with minimal cost. Explore the motivation behind derandomization, its theoretical concerns, and implications in computational science. Dive into the trade-off between computational time and randomness, and learn about practical concern
0 views • 34 slides
Derandomization: New Framework and Assumptions for Hardness-to-Randomness
Explore the latest concepts in derandomization with a focus on new uniform hardness assumptions, non-black-box techniques, and instance-wise reconstructive approaches. Discover how randomness can be transformed into a valuable resource through innovative methodologies and open problems in the field.
0 views • 45 slides