Seminars, Conferences, and Workshops
Silent Threshold Cryptography from Pairings
Pairing-Based Aggregate Signatures without Random Oracles
Lattice Assumptions with Hints: Succinct LWE and its Applications
Exotic Lattice Assumptions and How to Tame Them
New Techniques for Preimage Sampling: NIZKs and More from LWE
Simons Institute Proofs Reading Group
Adaptively-Sound SNARGs for NP from Indistinguishability Obfuscation
Distributed Broadcast Encryption from Lattices
Private Information Retrieval: Recent Advances and Challenges
AWS Security
TW-US Joint Workshop on Resilient Networks and AI for Cybersecurity
Succinct Functional Commitments for Circuits from k-Lin
Lattice-Based Functional Commitments: Constructions and Cryptanalysis
Removing Trust Assumptions from Advanced Encryption Schemes
Lattice-Based Functional Commitments: Fast Verification and Cryptanalysis
How to Use (Plain) Witness Encryption: Registered ABE, Flexible Broadcast, and More
Berkeley Crypto Reading Group
Succinct Vector, Polynomial, and Functional Commitments from Lattices
UMD Crypto Reading Group
Computing on Private Data: Private Genomics and More
CATT Global Analytics Conference
Multi-Authority ABE from Lattices without Random Oracles
Registered Attribute-Based Encryption
Batch Arguments for NP and More from Standard Bilinear Group Assumptions
Spiral: Fast High-Rate Single-Server Private Information Retrieval
Traceable PRFs: Full Collusion Resistance and Active Security
Beyond Software Watermarking: Traitor-Tracing for Pseudorandom Functions
Post-Quantum Designated Verifier zkSNARKs from Lattices
CWI Crypto Seminar
Collusion Resistant Trace-and-Revoke for Arbitrary Identities from Standard Assumptions
On Succinct Arguments and Witness Encryption from Groups
UCLA Crypto Seminar
Berkeley Crypto Reading Group
Can Verifiable Delay Functions be Based on Random Oracles?
New Constructions of Statistical NIZKs: Dual-Mode DV-NIZKs and More
Watermarking and Traitor Tracing for PRFs
Computing with Lattices: Commitments, Signatures, and Zero-Knowledge
Watermarking PRFs from Lattices via Extractable PRFs
Order-Revealing Encryption: Definitions, Constructions, and Challenges
New Constructions of Reusable Designated-Verifier NIZKs
Exploring Crypto Dark Matter: New Simple PRF Candidates and Their Applications
Multi-Theorem Preprocessing NIZKs from Lattices
Lattice-Based Non-Interactive Argument Systems
PhD Thesis Defense
Protecting Patient Privacy in Genomic Analysis
Security and Privacy through Modern Cryptography
Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs
Constrained Keys for Invertible Pseudorandom Functions
Center for Encrypted Functionalities Seminar
Watermarking Cryptographic Functionalities from Standard Lattice Assumptions
Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
Order-Revealing Encryption: New Constructions, Applications, and Lower Bounds
Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions
Privately Evaluating Decision Trees and Random Forests
Privacy, Discovery, and Authentication for the Internet of Things
Practical Order-Revealing Encryption with Limited Leakage
Stanford Data Science Initiative Workshop on Data Science for Biomedicine
Constraining Pseudorandom Functions Privately
Privacy-Preserving Shortest Path Computation
Homomorphic Encryption for Genomic Analysis
Stanford Data Science Initiative Monthly Meeting
Computing on Encrypted Data
Private Database Queries using Somewhat Homomorphic Encryption
MSR Summer Crypto Lunch
Informal Talks
From Secure MPC to Efficient Zero-Knowledge
Stanford Theory Qualifying Exam
A Somewhat Informal Introduction to FHE
MSR Summer Crypto Lunch
Somewhat (Practical) Homomorphic Encryption