Talks and Poster Presentations
Seminars, Conferences, and Workshops
- 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
- Adaptively-Sound SNARGs for NP from Indistinguishability Obfuscation
- Distributed Broadcast Encryption from Lattices
- Private Information Retrieval: Recent Advances and Challenges
- 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
- Succinct Vector, Polynomial, and Functional Commitments from Lattices
- Computing on Private Data: Private Genomics and More
CATT Global Analytics Conference – Nov 2022
- 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
- Collusion Resistant Trace-and-Revoke for Arbitrary Identities from Standard Assumptions
- On Succinct Arguments and Witness Encryption from Groups
- 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
- 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
- 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
- Constraining Pseudorandom Functions Privately
- Privacy-Preserving Shortest Path Computation
- Homomorphic Encryption for Genomic Analysis
- Computing on Encrypted Data
- Private Database Queries using Somewhat Homomorphic Encryption
Informal Talks
- From Secure MPC to Efficient Zero-Knowledge
- A Somewhat Informal Introduction to FHE
- Somewhat (Practical) Homomorphic Encryption
|