Efficient ZHFE Key Generation. - John B. Baena; Daniel Cabarcas; Daniel E. Escudero; Jaiberth Porras-Barrera; Javier A. Verbel (PQCrypto, 2016)

Rank Analysis of Cubic Multivariate Cryptosystems. - John Baena; Daniel Cabarcas; Daniel E. Escudero; Karan Khathuria; Javier A. Verbel (IACR Cryptol. ePrint Arch., 2018)

SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority. - Ronald Cramer; Ivan Damgård; Daniel Escudero 001; Peter Scholl; Chaoping Xing (IACR Cryptol. ePrint Arch., 2018)

Efficient Information-Theoretic Secure Multiparty Computation over ℤ/pk ℤ via Galois Rings. - Mark Abspoel; Ronald Cramer; Ivan Damgård; Daniel Escudero 001; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2019)

An Efficient Passive-to-Active Compiler for Honest-Majority MPC over Rings. - Mark Abspoel; Anders P. K. Dalskov; Daniel Escudero 001; Ariel Nof (IACR Cryptol. ePrint Arch., 2019)

Secure Evaluation of Quantized Neural Networks. - Assi Barak; Daniel Escudero 001; Anders P. K. Dalskov; Marcel Keller (IACR Cryptol. ePrint Arch., 2019)

New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning. - Ivan Damgård; Daniel Escudero 001; Tore Kasper Frederiksen; Marcel Keller; Peter Scholl; Nikolaj Volgushev (IACR Cryptol. ePrint Arch., 2019)

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $ mathbb {Z}/p^k mathbb {Z} $. - Mark Abspoel; Ronald Cramer; Ivan Damgård; Daniel Escudero 001; Matthieu Rambaud; Chaoping Xing; Chen Yuan 003 (ASIACRYPT (3), 2020)

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z. - Mark Abspoel; Ronald Cramer; Ivan Damgård; Daniel Escudero 001; Matthieu Rambaud; Chaoping Xing; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2020)

LSS Homomorphisms and Applications to Secure Signatures, Proactive Secret Sharing and Input Certification. - Diego F. Aranha; Anders P. K. Dalskov; Daniel Escudero 001; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2020)

Fantastic Four: Honest-Majority Four-Party Secure Computation With Malicious Security. - Anders P. K. Dalskov; Daniel Escudero 001; Marcel Keller (IACR Cryptol. ePrint Arch., 2020)

Honest Majority MPC with Abort with Minimal Online Communication. - Daniel Escudero 001; Anders P. K. Dalskov (IACR Cryptol. ePrint Arch., 2020)

Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits. - Daniel Escudero 001; Satrajit Ghosh; Marcel Keller; Rahul Rachuri; Peter Scholl (IACR Cryptol. ePrint Arch., 2020)

Secure Evaluation of Quantized Neural Networks. - Anders P. K. Dalskov; Daniel Escudero 001; Marcel Keller (Proc. Priv. Enhancing Technol., 2020)

Improved Threshold Signatures, Proactive Secret Sharing, and Input Certification from LSS Isomorphisms. - Diego F. Aranha; Anders P. K. Dalskov; Daniel Escudero 001; Claudio Orlandi (LATINCRYPT, 2021)

Secure Computation over Integers Modulo Powers of Two. - Mark Abspoel; Ronald Cramer; Daniel Escudero 001 (ERCIM News, 2021)

Efficient Information-Theoretic Multi-Party Computation over Non-Commutative Rings. - Daniel Escudero 001; Eduardo Soria-Vazquez (IACR Cryptol. ePrint Arch., 2021)

Improved single-round secure multiplication using regenerating codes. - Mark Abspoel; Ronald Cramer; Daniel Escudero 001; Ivan Damgård; Chaoping Xing (IACR Cryptol. ePrint Arch., 2021)

Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks. - Ivan Damgård; Daniel Escudero 001; Antigoni Polychroniadou (IACR Cryptol. ePrint Arch., 2021)

Information-Theoretically Secure MPC against Mixed Dynamic Adversaries. - Ivan Damgård; Daniel Escudero 001; Divya Ravi 001 (IACR Cryptol. ePrint Arch., 2021)

Secure training of decision trees with continuous attributes. - Mark Abspoel; Daniel Escudero 001; Nikolaj Volgushev (Proc. Priv. Enhancing Technol., 2021)

More Efficient Dishonest Majority Secure Computation over $ mathbb {Z}_{2^k}$ via Galois Rings. - Daniel Escudero 001; Chaoping Xing; Chen Yuan 003 (CRYPTO (1), 2022)

Vector Commitments over Rings and Compressed $ varSigma $-Protocols. - Thomas Attema; Ignacio Cascudo; Ronald Cramer; Ivan Damgård; Daniel Escudero 001 (TCC (1), 2022)

More Efficient Dishonest Majority Secure Computation over ℤ2k via Galois Rings. - Daniel Escudero 001; Chaoping Xing; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2022)

Vector Commitments over Rings and Compressed Σ-Protocols. - Thomas Attema; Ignacio Cascudo; Ronald Cramer; Ivan Bjerre Damgård; Daniel Escudero 001 (IACR Cryptol. ePrint Arch., 2022)

Fast Fully Secure Multi-Party Computation over Any Ring with Two-Thirds Honest Majority. - Anders P. K. Dalskov; Daniel Escudero 001; Ariel Nof (IACR Cryptol. ePrint Arch., 2022)

TurboPack: Honest Majority MPC with Constant Online Communication. - Daniel Escudero 001; Vipul Goyal; Antigoni Polychroniadou; Yifan Song 001 (IACR Cryptol. ePrint Arch., 2022)

Efficient protocols for oblivious linear function evaluation from ring-LWE. - Carsten Baum; Daniel Escudero 001; Alberto Pedrouzo-Ulloa; Peter Scholl; Juan Ramón Troncoso-Pastoriza (J. Comput. Secur., 2022)

Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications. - Daniel Escudero 001; Cheng Hong 001; Hongqing Liu; Chaoping Xing; Chen Yuan 003 (ASIACRYPT (1), 2023)

On Linear Communication Complexity for (Maximally) Fluid MPC. - Alexander Bienstock; Daniel Escudero 001; Antigoni Polychroniadou (IACR Cryptol. ePrint Arch., 2023)

On Fully-Secure Honest Majority MPC without n2 Round Overhead. - Daniel Escudero 001; Serge Fehr (IACR Cryptol. ePrint Arch., 2023)

SUPERPACK: Dishonest Majority MPC with Constant Online Communication. - Daniel Escudero 001; Vipul Goyal; Antigoni Polychroniadou; Yifan Song 001; Chenkai Weng (IACR Cryptol. ePrint Arch., 2023)

Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications. - Daniel Escudero 001; Hongqing Liu; Chaoping Xing; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2023)

Honest Majority GOD MPC with O(sfdepth(C)) Rounds and Low Online Communication. - Amit Agarwal; Alexander Bienstock; Ivan Damgård; Daniel Escudero 001 (ASIACRYPT (6), 2024)

Multi-Verifier Zero-Knowledge Proofs for Any Constant Fraction of Corrupted Verifiers. - Daniel Escudero 001; Antigoni Polychroniadou; Yifan Song 001; Chenkai Weng (CCS, 2024)

Perfectly Secure Fluid MPC with Abort and Linear Communication Complexity. - Alexander Bienstock; Daniel Escudero 001; Antigoni Polychroniadou (IACR Commun. Cryptol., 2024)

Honest Majority GOD MPC with O(depth(C)) Rounds and Low Online Communication. - Amit Agarwal; Alexander Bienstock; Ivan Damgård; Daniel Escudero 001 (IACR Cryptol. ePrint Arch., 2024)

Share the MAYO: thresholdizing MAYO. - Sofía Celi; Daniel Escudero 001; Guilhem Niot (IACR Cryptol. ePrint Arch., 2024)

Fully Secure MPC and zk-FLIOP Over Rings: New Constructions, Improvements and Extensions. - Anders P. K. Dalskov; Daniel Escudero 001; Ariel Nof (IACR Cryptol. ePrint Arch., 2024)

Dishonest Majority Multi-Verifier Zero-Knowledge Proofs for Any Constant Fraction of Corrupted Verifiers. - Daniel Escudero 001; Antigoni Polychroniadou; Yifan Song 001; Chenkai Weng (IACR Cryptol. ePrint Arch., 2024)

Perfectly-Secure Multiparty Computation with Linear Communication Complexity over Any Modulus. - Daniel Escudero 001; Yifan Song 001; Wenhao Wang (IACR Cryptol. ePrint Arch., 2024)

On Information-Theoretic Secure Multiparty Computation with Local Repairability. - Daniel Escudero 001; Ivan Tjuawinata; Chaoping Xing (IACR Cryptol. ePrint Arch., 2024)

Sublinear Distributed Product Checks on Replicated Secret-Shared Data over ℤ2k without Ring Extensions. - Yun Li 010; Daniel Escudero 001; Yufei Duan; Zhicong Huang; Cheng Hong 001; Chao Zhang 008; Yifan Song 001 (IACR Cryptol. ePrint Arch., 2024)

Brief Announcement: Towards Scalable YOSO MPC via Packed Secret-Sharing. - Daniel Escudero 001; Elisaweta Masserova; Antigoni Polychroniadou (PODC, 2025)

Efficient, Scalable Threshold ML-DSA Signatures: An MPC Approach. - Alexander Bienstock; Leo de Castro; Daniel Escudero 001; Antigoni Polychroniadou; Akira Takahashi (IACR Cryptol. ePrint Arch., 2025)

Towards Scalable YOSO MPC via Packed Secret-Sharing. - Daniel Escudero 001; Elisaweta Masserova; Antigoni Polychroniadou (IACR Cryptol. ePrint Arch., 2025)

Covert Attacks on Machine Learning Training in Passively Secure MPC. - Matthew Jagielski; Rahul Rachuri; Daniel Escudero 001; Peter Scholl (IACR Cryptol. ePrint Arch., 2025)