Articles with public access mandates - Antigoni PolychroniadouLearn more
Available somewhere: 26
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
Mandates: US National Science Foundation
Four round secure computation without setup
Z Brakerski, S Halevi, A Polychroniadou
Theory of Cryptography Conference, 645-677, 2017
Mandates: US National Science Foundation, US Department of Defense, Danish Council for …
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
Mandates: US National Science Foundation, US Department of Defense
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
Mandates: US National Science Foundation, Danish Council for Strategic Research
Two-round adaptively secure MPC from indistinguishability obfuscation
S Garg, A Polychroniadou
Theory of Cryptography: 12th Theory of Cryptography Conference, TCC 2015 …, 2015
Mandates: Danish Council for Independent Research, Danish National Research Foundation …
Prio+: Privacy preserving aggregate statistics via boolean shares
S Addanki, K Garbe, E Jaffe, R Ostrovsky, A Polychroniadou
International Conference on Security and Cryptography for Networks, 516-539, 2022
Mandates: US National Science Foundation, US Department of Defense
Round-optimal secure multi-party computation
S Halevi, C Hazay, A Polychroniadou, M Venkitasubramaniam
Journal of Cryptology 34 (3), 19, 2021
Mandates: US National Science Foundation, US Department of Defense
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
Mandates: US National Science Foundation, US Department of Energy, US Department of …
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
Mandates: National Natural Science Foundation of China, Danish National Research …
On the communication required for unconditionally secure multiplication
I Damgård, JB Nielsen, A Polychroniadou, M Raskin
Annual International Cryptology Conference, 459-488, 2016
Mandates: US National Science Foundation, Danish Council for Independent Research …
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
Mandates: US National Science Foundation, National Natural Science Foundation of China …
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
Mandates: US National Science Foundation, US Department of Defense, Research Grants …
Flamingo: Multi-round single-server secure aggregation with applications to private federated learning
Y Ma, J Woods, S Angel, A Polychroniadou, T Rabin
2023 IEEE Symposium on Security and Privacy (SP), 477-496, 2023
Mandates: US National Science Foundation, US Department of Defense
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
Mandates: Danish Council for Independent Research, Danish National Research Foundation …
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
Mandates: US National Science Foundation, US Department of Energy, US Department of …
Sharing transformation and dishonest majority MPC with packed secret sharing
V Goyal, A Polychroniadou, Y Song
Annual International Cryptology Conference, 3-32, 2022
Mandates: US National Science Foundation, US Department of Energy, US Department of …
Kicking-the-bucket: Fast privacy-preserving trading using buckets
MB da Gama, J Cartlidge, A Polychroniadou, NP Smart, YT Alaoui
International Conference on Financial Cryptography and Data Security, 20-37, 2022
Mandates: Research Foundation (Flanders), European Commission
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
Mandates: US National Science Foundation, US Department of Defense
Turbopack: honest majority MPC with constant online communication
D Escudero, V Goyal, A Polychroniadou, Y Song
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications …, 2022
Mandates: US National Science Foundation, US Department of Energy, US Department of …
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
Mandates: US National Science Foundation, Danish Council for Independent Research …
Publication and funding information is determined automatically by a computer program