Research
Conference Publications
The Black-Box Simulation Barrier Persists in a Fully Quantum World
Tight Quantum Time-Space Tradeoffs for Permutation Inversion
Equivalence Checking of Quantum Circuits via Path-Sum and Weighted Model Counting
AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs
On Central Primitives for Quantum Cryptography with Classical Communication
Best-of-Both-Worlds Multiparty Quantum Computation with Publicly Verifiable Identifiable Abort
On the (Im)possibility of Time-Lock Puzzles in the Quantum Random Oracle Model
AutoQ: An Automata-based Quantum Circuit Verifier
On the Impossibility of General Parallel Fast-forwarding of Hamiltonian Simulation
An Automata-based Framework for Verification and Bug Hunting in Quantum Circuits
Black-Box Separations for Non-Interactive Commitments in a Quantum World
Collusion-Resistant Functional Encryption for RAMs
On the Impossibility of Key Agreements from Quantum Random Oracles
Post-Quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round
Constant-round Blind Classical Verification of Quantum Sampling
A Note on the Post-Quantum Security of (Ring) Signatures
On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds
On the Concurrent Composition of Quantum Zero-Knowledge
Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort
Game-Theoretic Fairness Meets Multi-Party Protocols: The Case of Leader Election
A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds
Sample Efficient Algorithms for Learning Quantum Channels in PAC Model and the Approximate State Discrimination Problem
On the Compressed-Oracle Technique, and Post-Quantum Security of Proofs of Sequential Work
Classical Verification of Quantum Computations with Efficient Verifier
Tight Quantum Time-Space Tradeoffs for Function Inversion
On the Hardness of Massively Parallel Computation
Lower Bounds for Function Inversion with Quantum Advice
MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture
On the Need for Large Quantum Depth
Adaptively Secure Garbling Schemes for Parallel Computations
Interactive Leakage Chain Rule for Quantum Min-entropy
A Quantum-Proof Non-Malleable Extractor With Application to Privacy Amplification against Active Quantum Adversaries
On Quantum Advantage in Information Theoretic Single-Server PIR
Foundations of Differentially Oblivious Algorithms
On the Algorithmic Power of Spiking Neural Networks
Game Theoretic Notions of Fairness in Multi-Party Coin Toss
On the Complexity of Simulating Auxiliary Input
On the Depth of Oblivious Parallel RAM
Computational Notions of Quantum Min-Entropy
General Randomness Amplification with Non-signaling Security
Delegating RAM Computations with Adaptive Soundness and Privacy
Cryptography for Parallel RAM from Indistinguishability Obfuscation
Oblivious Parallel RAM and Applications
Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation
Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
Parallel Repetition for Entangled k-player Games via Fast Quantum Search
Tight Parallel Repetition Theorems for Public-Coin Arguments using KL-divergence
From Weak to Strong Zero-Knowledge and Applications
On the Impossibility of Cryptography with Tamperable Randomness
Distributed Algorithms for the Lovász Local Lemma and Graph Coloring
Statistically-secure ORAM with Õ(log² n) Overhead
Physical Randomness Extractors: Generating Random Numbers with Minimal Assumptions
On Extractability (a.k.a. Differing-Inputs) Obfuscation
4-Round Resettably-Sound Zero Knowledge
Constant-round Concurrent Zero-knowledge from Falsifiable Assumptions
Interactive Coding, Revisited
Non-black-box Simulation from One-way Functions and Applications to Resettable Security
Simultaneous Resettability from One-Way Functions
Functional Encryption from (Small) Hardware Tokens
On the Lattice Smoothing Parameter Problem
Randomness-Dependent Message Security
Can theories be tested?: a cryptographic treatment of forecast testing
On the Power of Non-uniform Proofs of Security
Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified
The Knowledge Tightness of Parallel Zero-Knowledge
The Randomness Complexity of Parallel Repetition
Efficient Secure Two-Party Exponentiation
Improved Delegation of Computation Using Fully Homomorphic Encryption
Efficient String-Commitment from Weak Bit-Commitment
Parallel Repetition Theorems for Interactive Arguments
AMS Without 4-Wise Independence on Product Domains
Tight Bounds for Hashing Block Sources
S-T Connectivity on Digraphs with a Known Stationary Distribution
Decomposition Methods for Linear Support Vector Machines
An Optimal Algorithm for the Maximum-Density Segment Problem
Radius Margin Bounds for Support Vector Machines with the RBF Kernel
Journal Publications
Online TSP and Online Dial-a-Ride with Predictions
On the Need for Large Quantum Depth
Foundations of Differentially Oblivious Algorithms
Cryptography with Disposable Backdoors
Quantum encryption and generalized Shannon impossibility
On Statistically-Secure Quantum Homomorphic Encryption
Space-efficient classical and quantum algorithms for the shortest vector problem
On the Impossibility of Cryptography with Tamperable Randomness
Distributed Algorithms for the Lovász Local Lemma and Graph Coloring
Non-black-box Simulation from One-way Functions and Applications to Resettable Security
Parallel repetition theorems for interactive arguments
Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream
S-T Connectivity on Digraphs with a Known Stationary Distribution
An Optimal Algorithm for the Maximum-Density Segment Problem
Decomposition Methods for Linear Support Vector Machines
Radius Margin Bounds for Support Vector Machines with the RBF Kernel
Book Chapter
When Simple Hash Functions Suffice
Ph.D. Thesis
Efficient Parallel Repetition Theorems with Applications to Security Amplification
Manuscripts
Leakage Chain Rule and Superdense Coding
Multi-Source Randomness Extractors Against Quantum Side Information, and their Applications
Unprovable Security of Two-Message Zero-Knowledge
