Skip to main content

Utility navigation

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

Main navigation

  • Programs & Events
    • Research Programs
    • Workshops & Symposia
    • Public Lectures
    • Research Pods
    • Internal Program Activities
    • Algorithms, Society, and the Law
  • Participate
    • Apply to Participate
    • Propose a Program
    • Postdoctoral Research Fellowships
    • Law and Society Fellowships
    • Science Communicator in Residence Program
    • Circles
    • Breakthroughs Workshops and Goldwasser Exploratory Workshops
  • People
    • Scientific Leadership
    • Staff
    • Current Long-Term Visitors
    • Research Fellows
    • Postdoctoral Researchers
    • Scientific Advisory Board
    • Governance Board
    • Affiliated Faculty
    • Science Communicators in Residence
    • Law and Society Fellows
    • Chancellor's Professors
  • News & Videos
    • News
    • Videos
  • Support for the Institute
    • Annual Fund
    • All Funders
    • Institutional Partnerships
  • For Visitors
    • Visitor Guide
    • Plan Your Visit
    • Location & Directions
    • Accessibility
    • Building Access
    • IT Guide
  • About

Results 1461 - 1470 of 23852

Workshop Talk
|
Aug. 8, 2025

The modern anonymous credential (how ZK landed in Google Wallet)

Abstract not available.

Asynchronous Concurrency in Data Structures | Richard M. Karp Distinguished Lecture

Robert Tarjan (Princeton University)

Tuesday, October 21, 2025

3:30 p.m. – 4:30 p.m. PT

Calvin Lab Auditorium & livestream


Registration is required to attend in-person. Please fill out a registration for each attendee.

 









Questions? Contact Simons Events at simonsevents@berkeley.edu

Contact Information

On Matrix Multiplication Algorithms | Richard M. Karp Distinguished Lecture

Virginia Vassilevska Williams (MIT)

Tuesday, October 28, 2025 

3:30 p.m. – 4:30 p.m. PT

Calvin Lab Auditorium & livestream


Registration is required to attend in-person. Please fill out a registration for each attendee.

 









Questions? Contact Simons Events at simonsevents@berkeley.edu

Contact Information

Computing Spectra of Quasicrystals: Case Studies in Complexity and Linear Algebra | Richard M. Karp Distinguished Lecture

Mark Embree (Virginia Tech)

Tuesday, October 7, 2025 

3:30 p.m. – 4:30 p.m. PT

Calvin Lab Auditorium & livestream


Registration is required to attend in-person. Please fill out a registration for each attendee.

 









Questions? Contact Simons Events at simonsevents@berkeley.edu

Contact Information

Virtualization and the Cost of Indirection | Richard M. Karp Distinguished Lecture

Martín Farach-Colton (New York University)

Tuesday, September 30, 2025 

3:30 p.m. – 4:30 p.m. PT

Calvin Lab Auditorium & livestream


Registration is required to attend in-person. Please fill out a registration for each attendee.

 









Questions? Contact Simons Events at simonsevents@berkeley.edu

Contact Information

Workshop Talk
|
Aug. 7, 2025

New Techniques for Building Information-Theoretic Asynchronous MPC with Linear Communication

Abstract not available.

Workshop Talk
|
Aug. 7, 2025

Recent Advances in Asynchronous Multi-Party Computation

Asynchronous MPC has received increased attention in the recent years. The talk will be an overview summarizing some of the recent advancements in the area focusing on communication complexity, including results on AMPC with linear communication accepted at Crypto'24 and Crypto'25.

Workshop Talk
|
Aug. 7, 2025

On the Adaptive Security of Key-Unique Threshold Signatures

Abstract not available.

Workshop Talk
|
Aug. 7, 2025

Is It Even Possible? On the Parallel Composition of Asynchronous MPC Protocols

Abstract not available.

Workshop Talk
|
Aug. 7, 2025

Multi-Party Distributed Point Functions

I will talk about our recent work on multiparty distributed point functions. We present the first construction of multiparty DPFs based on one-way functions, where the share sizes remain sublinear in the domain size and grow only polynomially with the number of parties. Prior constructions in Minicrypt have share sizes that grow exponentially with the number of parties.

Pagination

  • Previous page Previous
  • Page 145
  • Page 146
  • Current page 147
  • Page 148
  • Page 149
  • 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
  • Participate
  • Workshops & Symposia
  • Contact Us
  • Calendar
  • Accessibility

Footer social media

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

Main navigation

  • Programs & Events
    • Research Programs
    • Workshops & Symposia
    • Public Lectures
    • Research Pods
    • Internal Program Activities
    • Algorithms, Society, and the Law
  • Participate
    • Apply to Participate
    • Propose a Program
    • Postdoctoral Research Fellowships
    • Law and Society Fellowships
    • Science Communicator in Residence Program
    • Circles
    • Breakthroughs Workshops and Goldwasser Exploratory Workshops
  • People
    • Scientific Leadership
    • Staff
    • Current Long-Term Visitors
    • Research Fellows
    • Postdoctoral Researchers
    • Scientific Advisory Board
    • Governance Board
    • Affiliated Faculty
    • Science Communicators in Residence
    • Law and Society Fellows
    • Chancellor's Professors
  • News & Videos
    • News
    • Videos
  • Support for the Institute
    • Annual Fund
    • All Funders
    • Institutional Partnerships
  • For Visitors
    • Visitor Guide
    • Plan Your Visit
    • Location & Directions
    • Accessibility
    • Building Access
    • IT Guide
  • About

Utility navigation

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