Skip to main content

Utility navigation

  • Calendar
  • Contact
  • Login
  • MAKE A GIFT
Berkeley University of California
Home Home

Main navigation

  • Home
  • Programs & Events
    • Research Programs
    • Workshops & Symposia
    • Public Lectures
    • Research Pods
    • Internal Program Activities
    • Algorithms, Society, and the Law
  • People
    • Scientific Leadership
    • Staff
    • Current Long-Term Visitors
    • Research Fellows
    • Postdoctoral Researchers
    • Scientific Advisory Board
    • Governance Board
    • Industry Advisory Council
    • Affiliated Faculty
    • Science Communicators in Residence
    • Law and Society Fellows
  • Participate
    • Apply to Participate
    • Plan Your Visit
    • Location & Directions
    • Postdoctoral Research Fellowships
    • Law and Society Fellowships
    • Science Communicator in Residence Program
    • Circles
    • Breakthroughs Workshops and Goldwasser Exploratory Workshops
  • Support
    • Annual Fund
    • Funders
    • Industrial Partnerships
  • News & Videos
    • News
    • Videos
  • About
Image
Meta-complexity_logo_hi-res

Minimal Complexity Assumptions for Cryptography

Program
Meta-Complexity
Date
Monday, May 1 – Friday, May 5, 2023
Back to calendar

Error message

Could not retrieve the oEmbed resource.

Breadcrumb

  1. Home
  2. Workshop & Symposia
  3. Videos

Secondary tabs

  • The Workshop
  • Schedule
  • Videos
Remote video URL

Tutorial on Proof Systems

Visit talk page
Remote video URL

Correlation Intractability and SNARGs from Sub-exponential DDH

Visit talk page
Remote video URL

Constant-Round Arguments from One-Way Functions

Visit talk page
Remote video URL

Rate-1 BARGs via fully-local SSB hash families

Visit talk page
Remote video URL

Non-interactive Universal Arguments

Visit talk page
Remote video URL

Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness

Visit talk page
Remote video URL

New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust *Presented Virtually

Visit talk page
Remote video URL

Cryptography and Kolmogorov Complexity: A Quick Tutorial

Visit talk page

Talk By

Visit talk page
Remote video URL

Incompressiblity and Next-Block Pseudoentropy

Visit talk page

Pagination

  • Current page 1
  • Page 2
  • Page 3
  • Page 4
  • Next page Next
Home
The Simons Institute for the Theory of Computing is the world's leading venue for collaborative research in theoretical computer science.

Footer

  • Programs & Events
  • About
  • Participate
  • Workshops & Symposia
  • Contact Us
  • Calendar
  • Accessibility

Footer social media

  • Twitter
  • Facebook
  • Youtube
© 2013–2025 Simons Institute for the Theory of Computing. All Rights Reserved.
link to homepage

Main navigation

  • Home
  • Programs & Events
    • Research Programs
    • Workshops & Symposia
    • Public Lectures
    • Research Pods
    • Internal Program Activities
    • Algorithms, Society, and the Law
  • People
    • Scientific Leadership
    • Staff
    • Current Long-Term Visitors
    • Research Fellows
    • Postdoctoral Researchers
    • Scientific Advisory Board
    • Governance Board
    • Industry Advisory Council
    • Affiliated Faculty
    • Science Communicators in Residence
    • Law and Society Fellows
  • Participate
    • Apply to Participate
    • Plan Your Visit
    • Location & Directions
    • Postdoctoral Research Fellowships
    • Law and Society Fellowships
    • Science Communicator in Residence Program
    • Circles
    • Breakthroughs Workshops and Goldwasser Exploratory Workshops
  • Support
    • Annual Fund
    • Funders
    • Industrial Partnerships
  • News & Videos
    • News
    • Videos
  • About

Utility navigation

  • Calendar
  • Contact
  • Login
  • MAKE A GIFT
link to homepage