| 2026 | CRYPTO | Actively Secure MPC with O(|C|) Computation and Communication via CRT. | Alexander Bienstock, Daniel Escudero, Antigoni Polychroniadou |
| 2025 | ASIACRYPT | Towards Scalable YOSO MPC via Packed Secret-Sharing. | Daniel Escudero, Elisaweta Masserova, Antigoni Polychroniadou |
| 2025 | CCS | Armadillo: Robust Single-Server Secure Aggregation for Federated Learning with Input Validation. | Yiping Ma, Yue Guo, Harish Karthikeyan, Antigoni Polychroniadou |
| 2025 | CRYPTO | sfOPA: One-Shot Private Aggregation with Single Client Interaction and Its Applications to Federated Learning. | Harish Karthikeyan, Antigoni Polychroniadou |
| 2025 | ICML | DMM: Distributed Matrix Mechanism for Differentially-Private Federated Learning Based on Constant-Overhead Linear Secret Resharing. | Alexander Bienstock, Ujjwal Kumar, Antigoni Polychroniadou |
| 2025 | ICML | EncryptedLLM: Privacy-Preserving Large Language Model Inference via GPU-Accelerated Fully Homomorphic Encryption. | Leo de Castro, Daniel Escudero, Adya Agrawal, Antigoni Polychroniadou, Manuela Veloso |
| 2025 | PODC | Brief Announcement: Towards Scalable YOSO MPC via Packed Secret-Sharing. | Daniel Escudero, Elisaweta Masserova, Antigoni Polychroniadou |
| 2024 | CCS | Multi-Verifier Zero-Knowledge Proofs for Any Constant Fraction of Corrupted Verifiers. | Daniel Escudero, Antigoni Polychroniadou, Yifan Song, Chenkai Weng |
| 2024 | ICML | Bounding the Excess Risk for Linear Models Trained on Marginal-Preserving, Differentially-Private, Synthetic Data. | Yvonne Zhou, Mingyu Liang, Ivan Brugere, Danial Dervovic, Antigoni Polychroniadou, Min Wu, Dana Dachman-Soled |
| 2024 | SP | PriDe CT: Towards Public Consensus, Private Transactions, and Forward Secrecy in Decentralized Payments. | Yue Guo, Harish Karthikeyan, Antigoni Polychroniadou, Chaddy Huussin |
| 2023 | ASIACRYPT | LERNA: Secure Single-Server Aggregation via Key-Homomorphic Masking. | Hanjun Li, Huijia Lin, Antigoni Polychroniadou, Stefano Tessaro |
| 2023 | CRYPTO | On Linear Communication Complexity for (Maximally) Fluid MPC. | Alexander Bienstock, Daniel Escudero, Antigoni Polychroniadou |
| 2023 | EuroCrypt | SuperPack: Dishonest Majority MPC with Constant Online Communication. | Daniel Escudero, Vipul Goyal, Antigoni Polychroniadou, Yifan Song, Chenkai Weng |
| 2023 | SP | Flamingo: Multi-Round Single-Server Secure Aggregation with Applications to Private Federated Learning. | Yiping Ma, Jess Woods, Sebastian Angel, Antigoni Polychroniadou, Tal Rabin |
| 2022 | CCS | TurboPack: Honest Majority MPC with Constant Online Communication. | Daniel Escudero, Vipul Goyal, Antigoni Polychroniadou, Yifan Song |
| 2022 | CRYPTO | Sharing Transformation and Dishonest Majority MPC with Packed Secret Sharing. | Vipul Goyal, Antigoni Polychroniadou, Yifan Song |
| 2022 | EuroCrypt | Lightweight, Maliciously Secure Verifiable Function Secret Sharing. | Leo de Castro, Antigoni Polychroniadou |
| 2022 | FC | Kicking-the-Bucket: Fast Privacy-Preserving Trading Using Buckets. | Mariana Botelho da Gama, John Cartlidge, Antigoni Polychroniadou, Nigel P. Smart, Younes Talibi Alaoui |
| 2022 | SCN | Prio+: Privacy Preserving Aggregate Statistics via Boolean Shares. | Surya Addanki, Kevin Garbe, Eli Jaffe, Rafail Ostrovsky, Antigoni Polychroniadou |
| 2021 | CRYPTO | ATLAS: Efficient and Scalable MPC in the Honest Majority Setting. | Vipul Goyal, Hanjun Li, Rafail Ostrovsky, Antigoni Polychroniadou, Yifan Song |
| 2021 | CRYPTO | Unconditional Communication-Efficient MPC via Hall's Marriage Theorem. | Vipul Goyal, Antigoni Polychroniadou, Yifan Song |
| 2021 | EuroCrypt | Constant-Overhead Unconditionally Secure Multiparty Computation Over Binary Fields. | Antigoni Polychroniadou, Yifan Song |
| 2020 | EuroCrypt | Succinct Non-interactive Secure Computation. | Andrew Morgan, Rafael Pass, Antigoni Polychroniadou |
| 2020 | SODA | Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels. | T.-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou, Elaine Shi |
| 2018 | ASIACRYPT | More is Less: Perfectly Secure Oblivious Algorithms in the Multi-server Setting. | T.-H. Hubert Chan, Jonathan Katz, Kartik Nayak, Antigoni Polychroniadou, Elaine Shi |
| 2018 | CRYPTO | Limits of Practical Sublinear Secure Computation. | Elette Boyle, Yuval Ishai, Antigoni Polychroniadou |
| 2018 | CRYPTO | Round-Optimal Secure Multi-Party Computation. | Shai Halevi, Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam |
| 2018 | TCC | Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions. | Fabrice Benhamouda, Huijia Lin, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam |
| 2017 | CRYPTO | Laconic Oblivious Transfer and Its Applications. | Chongwon Cho, Nico Dttling, Sanjam Garg, Divya Gupta, Peihan Miao, Antigoni Polychroniadou |
| 2017 | PKC | Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model. | Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam |
| 2017 | TCC | Four Round Secure Computation Without Setup. | Zvika Brakerski, Shai Halevi, Antigoni Polychroniadou |
| 2016 | CRYPTO | On the Communication Required for Unconditionally Secure Multiplication. | Ivan Damgrd, Jesper Buus Nielsen, Antigoni Polychroniadou, Michael A. Raskin |
| 2016 | EuroCrypt | The Exact Round Complexity of Secure Computation. | Sanjam Garg, Pratyay Mukherjee, Omkant Pandey, Antigoni Polychroniadou |
| 2016 | PKC | Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE). | Ivan Damgrd, Antigoni Polychroniadou, Vanishree Rao |
| 2016 | TCC | Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity. | Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam |
| 2015 | CRYPTO | Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits. | Daniel Genkin, Yuval Ishai, Antigoni Polychroniadou |
| 2015 | TCC | Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation. | Sanjam Garg, Antigoni Polychroniadou |
| 2012 | ASIACRYPT | A Coding-Theoretic Approach to Recovering Noisy RSA Keys. | Kenneth G. Paterson, Antigoni Polychroniadou, Dale L. Sibborn |
| 2012 | WEBIST | A Compatible Implementation between Identity-based and Certificateless Encryption Schemes. | Antigoni Polychroniadou, Konstantinos Chalkias, George Stephanides |
| 2012 | SECRYPT | The Concept of Compatibility between Identity-based and Certificateless Encryption Schemes. | Antigoni Polychroniadou, Konstantinos Chalkias, George Stephanides |