| RedShift: Transparent SNARKs from List Polynomial Commitment IOPs. A Kattis, K Panarin, A Vlasov IACR Cryptol. ePrint Arch. 2019, 1400, 2019 | 41 | 2019 |
| Proof of necessary work: succinct state verification with fairness guarantees A Kattis, J Bonneau International Conference on Financial Cryptography and Data Security, 18-35, 2023 | 32 | 2023 |
| Caulk+: Table-independent lookup arguments J Posen, AA Kattis Cryptology ePrint Archive, 2022 | 21 | 2022 |
| Modeling epidemics on adaptively evolving networks: a data-mining perspective AA Kattis, A Holiday, AA Stoica, IG Kevrekidis Virulence 7 (2), 153-162, 2016 | 13 | 2016 |
| RedShift: transparent SNARKs from list polynomial commitments AA Kattis, K Panarin, A Vlasov Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications …, 2022 | 10 | 2022 |
| Data mining when each data point is a network K Rajendran, A Kattis, A Holiday, R Kondor, IG Kevrekidis Patterns of Dynamics: Berlin, July 2016 1, 289-317, 2017 | 10 | 2017 |
| Lower bounds for differential privacy from gaussian width A Kattis, A Nikolov arXiv preprint arXiv:1612.02914, 2016 | 8 | 2016 |
| Scalable Distributed Payment Systems with Minimal Trust Assumptions AA Kattis New York University, 2022 | | 2022 |
| Stabilizing Congestion in Decentralized Record-Keepers A Kattis, F Trottner arXiv preprint arXiv:2005.06093, 2020 | | 2020 |
