Publications
Economics and Modeling
- Balancing Power in Decentralized Governance: Quadratic Voting under Imperfect Information
- Economics of NFTs: The value of creator royalties
- Scaling Blockchains: Can Elected Committees help?
- Privacy-preserving network analytics Management Science 2022
- Token-weighted Crowdsourcing Management Science 2020
- Sensitivity and Computational Complexity in Financial Networks Algorithmic Finance 2016
Cryptography
- Proactive Secret Sharing with Constant Communication TCC 2023
- DORAM revisited: Maliciously secure RAM-MPC with logarithmic overhead TCC 2023
- GigaDORAM: Breaking the Billion Address Barrier USENIX 2023
- Two variable polynomial congruences and capacity theory Mathematical Cryptology 2023
- A Linear-Time 2-Party Secure Merge Protocol CSCML 2022
- 3-Party Distributed ORAM from Oblivious Set Membership SCN 2022
- Secure Merge with O(n log log n) Secure Operations ITC 2021
- Alibi: A Flaw in Cuckoo-Hashing based Hierarchical ORAM Schemes and a Solution EUROCRYPT 2020
- Honeycrisp: Large-scale Differentially Private Aggregation Without a Trusted Core SOSP 2019
- DURASIFT A robust, decentralized, encrypted database supporting private searches with complex policy-controls WPES 2019
- Private Set Intersection with Linear Communication from General Assumptions WPES 2019
- SoK: General Purpose Compilers for Secure Multi-Party ComputationOakland 2019
- ETERNAL: Encrypted Transmission With an Error-correcting, Real-time, Noise-resilient Apparatus on Lightweight Devices MPS 2018
- Cryptographic applications of capacity theory: On the optimality of Coppersmith’s method for univariate polynomials ASIACRYPT 2016
- Adaptive Security with Quasi-Optimal Rate TCC 2016
- Non-committing encryption from $\Phi$-hiding TCC 2015
- Extended-DDH and Lossy Trapdoor Functions PKC 2012
- On Homomorphic Encryption and Chosen-Ciphertext Security PKC 2012
- Correlated Product Security From Any One-Way Function and the New Notion of Decisional Correlated Product Security PKC 2012
- Public Key Locally Decodable Codes with Short Keys RANDOM 2011
- Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security ASIACRYPT 2011
- Public Key Locally Decodable Codes CRYPTO 2008
Error-Correcting Codes
- Properties of Constacyclic Codes Under the Schur Product Designs, Codes and Cryptography 2020
- Local List Recovery of High-rate Tensor Codes and Applications FOCS 2017
- Linear-time list recovery of high-rate expander codes ICALP 2015
- Local Correctability of Expander Codes ICALP 2013
- Optimal entanglement-assisted one-shot classical communication Physical Review A 2013
- Public Key Locally Decodable Codes with Short Keys RANDOM 2011
- Public Key Locally Decodable Codes CRYPTO 2008
Cryptography Policy
- A Comprehensive Approach to Crypto Regulation University of Pennsylvania Journal of Business Law 2023
- Computing Statistics from Private Data Data Science Journal 2018
- A new era for data sharing? Significance 2016
- High-precision Secure Computation of Satellite Collision Probabilities SCN 2016
- Cryptographers Could Prevent Satellite Collisions Scientific American, February 2015
- Ramifications of DARPA’s Programming Computation on Encrypted Data Program A RAND Technical Report
- Benefits of a Centralized Anomaly Database and Methods for Securely Sharing Information Among Satellite Operators A RAND Technical Report
- Achieving Higher-Fidelity Conjunction Analyses Using Cryptography to Improve Information Sharing A RAND Technical Report
Sparse Recovery
- Recovering Simple Signals ITA 2012
- Reusable low-error compressive sampling schemes through privacy SSP 2012
Congruent Primes
- On congruent primes and class numbers of imaginary quadratic fields Acta Arithmetica 2013
- Master’s Thesis: On Recognizing Congruent Primes
Fun
- The Diversity Discrepancy Mathematics Magazine
- Why People Die Before They Expect To Mathematics Magazine