Obserwuj
Antigoni Polychroniadou
Antigoni Polychroniadou
Cryptography Research Lead, JPMorgan AI Research
Zweryfikowany adres z cornell.edu
Tytuł
Cytowane przez
Cytowane przez
Rok
Four round secure computation without setup
Z Brakerski, S Halevi, A Polychroniadou
Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore …, 2017
852017
The exact round complexity of secure computation
S Garg, P Mukherjee, O Pandey, A Polychroniadou
Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference …, 2016
812016
Laconic oblivious transfer and its applications
C Cho, N Döttling, S Garg, D Gupta, P Miao, A Polychroniadou
Advances in Cryptology–CRYPTO 2017: 37th Annual International Cryptology …, 2017
662017
Two-round adaptively secure MPC from indistinguishability obfuscation
S Garg, A Polychroniadou
Cryptology ePrint Archive, 2014
652014
Round-optimal secure multi-party computation
S Halevi, C Hazay, A Polychroniadou, M Venkitasubramaniam
Journal of Cryptology 34 (3), 19, 2021
582021
A coding-theoretic approach to recovering noisy RSA keys
KG Paterson, A Polychroniadou, DL Sibborn
Advances in Cryptology–ASIACRYPT 2012: 18th International Conference on the …, 2012
502012
Efficient multi-party computation: from passive to active security via secure SIMD circuits
D Genkin, Y Ishai, A Polychroniadou
Advances in Cryptology--CRYPTO 2015: 35th Annual Cryptology Conference …, 2015
372015
On the communication required for unconditionally secure multiplication
I Damgård, JB Nielsen, A Polychroniadou, M Raskin
Advances in Cryptology–CRYPTO 2016: 36th Annual International Cryptology …, 2016
342016
Composable security in the tamper-proof hardware model under minimal complexity
C Hazay, A Polychroniadou, M Venkitasubramaniam
Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing …, 2016
34*2016
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
262020
Adaptively secure multi-party computation from LWE (via equivocal FHE)
I Damgård, A Polychroniadou, V Rao
Public-Key Cryptography–PKC 2016: 19th IACR International Conference on …, 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
Advances in Cryptology–ASIACRYPT 2018: 24th International Conference on the …, 2018
182018
ATLAS: Efficient and scalable MPC in the honest majority setting
V Goyal, H Li, R Ostrovsky, A Polychroniadou, Y Song
Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021
162021
Two-round adaptively secure multiparty computation from standard assumptions
F Benhamouda, H Lin, A Polychroniadou, M Venkitasubramaniam
Theory of Cryptography: 16th International Conference, TCC 2018, Panaji …, 2018
162018
Constant round adaptively secure protocols in the tamper-proof hardware model
C Hazay, A Polychroniadou, M Venkitasubramaniam
Public-Key Cryptography–PKC 2017: 20th IACR International Conference on …, 2017
162017
Prio+: Privacy preserving aggregate statistics via boolean shares
S Addanki, K Garbe, E Jaffe, R Ostrovsky, A Polychroniadou
Security and Cryptography for Networks: 13th International Conference, SCN …, 2022
152022
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
152019
Limits of practical sublinear secure computation
E Boyle, Y Ishai, A Polychroniadou
Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018
122018
Privacy-preserving dark pools
G Asharov, T Hybinette Balch, A Polychroniadou, M Veloso
Proceedings of the 19th International Conference on Autonomous Agents and …, 2020
112020
Unconditional communication-efficient MPC via Hall’s marriage theorem
V Goyal, A Polychroniadou, Y Song
Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021
102021
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20