Antigoni Polychroniadou

Orcid: 0009-0003-0125-2971

According to our database1, Antigoni Polychroniadou authored at least 70 papers between 2012 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Balancing Fairness and Accuracy in Data-Restricted Binary Classification.
ACM Trans. Knowl. Discov. Data, September, 2025

Ethereum Price Prediction Employing Large Language Models for Short-term and Few-shot Forecasting.
CoRR, March, 2025

MAFE: Multi-Agent Fair Environments for Decision-Making Systems.
CoRR, February, 2025

Towards Scalable YOSO MPC via Packed Secret-Sharing.
IACR Cryptol. ePrint Arch., 2025

Efficient, Scalable Threshold ML-DSA Signatures: An MPC Approach.
IACR Cryptol. ePrint Arch., 2025

Brief Announcement: Towards Scalable YOSO MPC via Packed Secret-Sharing.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025

Indifferential Privacy: A New Paradigm and Its Applications to Optimal Matching in Dark Pool Auctions.
Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, 2025

sfOPA: One-Shot Private Aggregation with Single Client Interaction and Its Applications to Federated Learning.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Armadillo: Robust Single-Server Secure Aggregation for Federated Learning with Input Validation.
Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, 2025

2024
A Canonical Data Transformation for Achieving Inter- and Within-Group Fairness.
IEEE Trans. Inf. Forensics Secur., 2024

MicroSecAgg: Streamlined Single-Server Secure Aggregation.
Proc. Priv. Enhancing Technol., 2024

OPA: One-shot Private Aggregation with Single Client Interaction and its Applications to Federated Learning.
IACR Cryptol. ePrint Arch., 2024

Dishonest Majority Multi-Verifier Zero-Knowledge Proofs for Any Constant Fraction of Corrupted Verifiers.
IACR Cryptol. ePrint Arch., 2024

DMM: Distributed Matrix Mechanism for Differentially-Private Federated Learning using Packed Secret Sharing.
IACR Cryptol. ePrint Arch., 2024

Balancing Fairness and Accuracy in Data-Restricted Binary Classification.
CoRR, 2024

Perfectly Secure Fluid MPC with Abort and Linear Communication Complexity.
IACR Commun. Cryptol., 2024

PriDe CT: Towards Public Consensus, Private Transactions, and Forward Secrecy in Decentralized Payments.
Proceedings of the IEEE Symposium on Security and Privacy, 2024

Bounding the Excess Risk for Linear Models Trained on Marginal-Preserving, Differentially-Private, Synthetic Data.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Multi-Verifier Zero-Knowledge Proofs for Any Constant Fraction of Corrupted Verifiers.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

Atlas-X Equity Financing: Unlocking New Methods to Securely Obfuscate Axe Inventory Data Based on Differential Privacy.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023
An Efficient Data-Independent Priority Queue and its Application to Dark Pools.
IACR Cryptol. ePrint Arch., 2023

PriDe CT: Towards Public Consensus, Private Transactions, and Forward Secrecy in Decentralized Payments.
IACR Cryptol. ePrint Arch., 2023

Prime Match: A Privacy-Preserving Inventory Matching System.
Proceedings of the 32nd USENIX Security Symposium, 2023

Flamingo: Multi-Round Single-Server Secure Aggregation with Applications to Private Federated Learning.
Proceedings of the 44th IEEE Symposium on Security and Privacy, 2023

SuperPack: Dishonest Majority MPC with Constant Online Communication.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

On Linear Communication Complexity for (Maximally) Fluid MPC.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks.
Proceedings of the 4th Conference on Information-Theoretic Cryptography, 2023

LERNA: Secure Single-Server Aggregation via Key-Homomorphic Masking.
Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022
MicroFedML: Privacy Preserving Federated Learning for Small Weights.
IACR Cryptol. ePrint Arch., 2022

Paving the Way towards 800 Gbps Quantum-Secured Optical Channel Deployment in Mission-Critical Environments.
CoRR, 2022

Prio+: Privacy Preserving Aggregate Statistics via Boolean Shares.
Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

Addressing Extreme Market Responses Using Secure Aggregation.
Proceedings of the 3rd ACM International Conference on AI in Finance, 2022

Collusion Resistant Federated Learning with Oblivious Distributed Differential Privacy.
Proceedings of the 3rd ACM International Conference on AI in Finance, 2022

Kicking-the-Bucket: Fast Privacy-Preserving Trading Using Buckets.
Proceedings of the Financial Cryptography and Data Security, 2022

Lightweight, Maliciously Secure Verifiable Function Secret Sharing.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Sharing Transformation and Dishonest Majority MPC with Packed Secret Sharing.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

TurboPack: Honest Majority MPC with Constant Online Communication.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
Lightweight, Verifiable Function Secret Sharing and its Applications.
IACR Cryptol. ePrint Arch., 2021

Privacy-preserving portfolio pricing.
Proceedings of the ICAIF'21: 2nd ACM International Conference on AI in Finance, Virtual Event, November 3, 2021

Constant-Overhead Unconditionally Secure Multiparty Computation Over Binary Fields.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Unconditional Communication-Efficient MPC via Hall's Marriage Theorem.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

ATLAS: Efficient and Scalable MPC in the Honest Majority Setting.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

ACCO: Algebraic Computation with Comparison.
Proceedings of the CCSW@CCS '21: Proceedings of the 2021 on Cloud Computing Security Workshop, 2021

2020
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

CryptoCredit: securely training fair models.
Proceedings of the ICAIF '20: The First ACM International Conference on AI in Finance, 2020

Differentially private secure multi-party computation for federated learning in financial applications.
Proceedings of the ICAIF '20: The First ACM International Conference on AI in Finance, 2020

SecretMatch: inventory matching from fully homomorphic encryption.
Proceedings of the ICAIF '20: The First ACM International Conference on AI in Finance, 2020

Succinct Non-interactive Secure Computation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Privacy-Preserving Dark Pools.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2018
Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Round-Optimal Secure Multi-Party Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Limits of Practical Sublinear Secure Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

More is Less: Perfectly Secure Oblivious Algorithms in the Multi-server Setting.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
Four Round Secure Computation Without Setup.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model.
Proceedings of the Public-Key Cryptography - PKC 2017, 2017

Laconic Oblivious Transfer and Its Applications.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE).
Proceedings of the Public-Key Cryptography - PKC 2016, 2016

The Exact Round Complexity of Secure Computation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

On the Communication Required for Unconditionally Secure Multiplication.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015
Round-Optimal Token-Based Secure Computation.
IACR Cryptol. ePrint Arch., 2015

On the Communication required for Unconditionally Secure Multiplication.
IACR Cryptol. ePrint Arch., 2015

Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Efficient Leakage Resilient Circuit Compilers.
Proceedings of the Topics in Cryptology, 2015

Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
Adaptively Secure UC Constant Round Multi-Party Computation Protocols.
IACR Cryptol. ePrint Arch., 2014

2012
A Compatible Implementation between Identity-based and Certificateless Encryption Schemes.
Proceedings of the WEBIST 2012 - Proceedings of the 8th International Conference on Web Information Systems and Technologies, Porto, Portugal, 18, 2012

Improved NetArgus - A Suite of Wi-fi Positioning & SNMP Monitor.
Proceedings of the SIGMAP and WINSYS 2012, 2012

The Concept of Compatibility between Identity-based and Certificateless Encryption Schemes.
Proceedings of the SECRYPT 2012, 2012

A Coding-Theoretic Approach to Recovering Noisy RSA Keys.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012


  Loading...