Follow
Antigoni Polychroniadou
Antigoni Polychroniadou
Cryptography Research Lead, JPMorgan AI Research
Verified email at cornell.edu
Title
Cited by
Cited by
Year
The exact round complexity of secure computation
S Garg, P Mukherjee, O Pandey, A Polychroniadou
Annual International Conference on the Theory and Applications of …, 2016
752016
Four round secure computation without setup
Z Brakerski, S Halevi, A Polychroniadou
Theory of Cryptography Conference, 645-677, 2017
742017
Two-round adaptively secure MPC from indistinguishability obfuscation
S Garg, A Polychroniadou
Theory of Cryptography Conference, 614-637, 2015
622015
Laconic oblivious transfer and its applications
C Cho, N Döttling, S Garg, D Gupta, P Miao, A Polychroniadou
Annual International Cryptology Conference, 33-65, 2017
592017
Round-optimal secure multi-party computation
S Halevi, C Hazay, A Polychroniadou, M Venkitasubramaniam
Journal of Cryptology 34 (3), 1-63, 2021
492021
A coding-theoretic approach to recovering noisy RSA keys
KG Paterson, A Polychroniadou, DL Sibborn
International Conference on the Theory and Application of Cryptology and …, 2012
492012
On the communication required for unconditionally secure multiplication
I Damgård, JB Nielsen, A Polychroniadou, M Raskin
Annual International Cryptology Conference, 459-488, 2016
332016
Efficient multi-party computation: from passive to active security via secure SIMD circuits
D Genkin, Y Ishai, A Polychroniadou
Annual Cryptology Conference, 721-741, 2015
332015
Composable security in the tamper-proof hardware model under minimal complexity
C Hazay, A Polychroniadou, M Venkitasubramaniam
Theory of Cryptography Conference, 367-399, 2016
31*2016
Adaptively secure multi-party computation from LWE (via equivocal FHE)
I Damgård, A Polychroniadou, V Rao
Public-Key Cryptography--PKC 2016, 208-233, 2016
24*2016
More is less: Perfectly secure oblivious algorithms in the multi-server setting
THH Chan, J Katz, K Nayak, A Polychroniadou, E Shi
International Conference on the Theory and Application of Cryptology and …, 2018
162018
Constant round adaptively secure protocols in the tamper-proof hardware model
C Hazay, A Polychroniadou, M Venkitasubramaniam
IACR International Workshop on Public Key Cryptography, 428-460, 2017
162017
Two-round adaptively secure multiparty computation from standard assumptions
F Benhamouda, H Lin, A Polychroniadou, M Venkitasubramaniam
Theory of Cryptography Conference, 175-205, 2018
152018
Prio+: Privacy preserving aggregate statistics via boolean shares
S Addanki, K Garbe, E Jaffe, R Ostrovsky, A Polychroniadou
Cryptology ePrint Archive, 2021
142021
Differentially private secure multi-party computation for federated learning in financial applications
D Byrd, A Polychroniadou
Proceedings of the First ACM International Conference on AI in Finance, 1-9, 2020
142020
ATLAS: efficient and scalable MPC in the honest majority setting
V Goyal, H Li, R Ostrovsky, A Polychroniadou, Y Song
Annual International Cryptology Conference, 244-274, 2021
122021
Smpai: Secure multi-party computation for federated learning
V Mugunthan, A Polychroniadou, D Byrd, TH Balch
Proceedings of the NeurIPS 2019 Workshop on Robust AI in Financial Services, 2019
122019
Efficient leakage resilient circuit compilers
M Andrychowicz, I Damgård, S Dziembowski, S Faust, A Polychroniadou
Cryptographers’ Track at the RSA Conference, 311-329, 2015
102015
Unconditional communication-efficient MPC via hall’s marriage theorem
V Goyal, A Polychroniadou, Y Song
Annual International Cryptology Conference, 275-304, 2021
92021
Privacy-preserving dark pools
G Asharov, T Hybinette Balch, A Polychroniadou, M Veloso
Proceedings of the 19th International Conference on Autonomous Agents and …, 2020
92020
The system can't perform the operation now. Try again later.
Articles 1–20