Some applications of verifiable computation to biometric verification. - Julien Bringer; Hervé Chabanne; Firas Kraiem; Roch Lescuyer; Eduardo Soria-Vazquez (WIFS, 2015)

More Efficient Constant-Round Multi-Party Computation from BMR and SHE. - Yehuda Lindell; Nigel P. Smart; Eduardo Soria-Vazquez (IACR Cryptol. ePrint Arch., 2016)

Faster Secure Multi-Party Computation of AES and DES Using Lookup Tables. - Marcel Keller; Emmanuela Orsini; Dragos Rotaru; Peter Scholl; Eduardo Soria-Vazquez; Srinivas Vivek 001 (IACR Cryptol. ePrint Arch., 2017)

Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). - Carmit Hazay; Emmanuela Orsini; Peter Scholl; Eduardo Soria-Vazquez (IACR Cryptol. ePrint Arch., 2018)

Towards secure multi-party computation on the Internet : few rounds and many parties - Eduardo Soria-Vazquez (2019)

Circuit Amortization Friendly Encodingsand Their Application to Statistically Secure Multiparty Computation. - Anders P. K. Dalskov; Eysa Lee; Eduardo Soria-Vazquez (ASIACRYPT (3), 2020)

Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. - Carsten Baum; Emmanuela Orsini; Peter Scholl; Eduardo Soria-Vazquez (IACR Cryptol. ePrint Arch., 2020)

Circuit Amortization Friendly Encodings and their Application to Statistically Secure Multiparty Computation. - Anders P. K. Dalskov; Eysa Lee; Eduardo Soria-Vazquez (IACR Cryptol. ePrint Arch., 2020)

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. - Carmit Hazay; Peter Scholl; Eduardo Soria-Vazquez (J. Cryptol., 2020)

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

Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits. - Aner Ben-Efraim; Kelong Cong; Eran Omri; Emmanuela Orsini; Nigel P. Smart; Eduardo Soria-Vazquez (IACR Cryptol. ePrint Arch., 2021)

Doubly Efficient Interactive Proofs over Infinite and Non-Commutative Rings. - Eduardo Soria-Vazquez (IACR Cryptol. ePrint Arch., 2022)

TinyKeys: A New Approach to Efficient Multi-Party Computation. - Carmit Hazay; Emmanuela Orsini; Peter Scholl; Eduardo Soria-Vazquez (J. Cryptol., 2022)

HELIOPOLIS: Verifiable Computation over Homomorphically Encrypted Data from Interactive Oracle Proofs is Practical. - Diego F. Aranha; Anamaria Costache; Antonio Guimarães; Eduardo Soria-Vazquez (IACR Cryptol. ePrint Arch., 2023)

Taming Adaptivity in YOSO Protocols: The Modular Way. - Ran Canetti; Sebastian Kolby; Divya Ravi 001; Eduardo Soria-Vazquez; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2023)

Rinocchio: SNARKs for Ring Arithmetic. - Chaya Ganesh; Anca Nitulescu; Eduardo Soria-Vazquez (J. Cryptol., 2023)

Privacy Preserving Underwater Collaborative Localization using Time Lock Puzzles. - R. Praveen Jain; Pietro Tedeschi; Jeremy Nicola; Abdelrahaman Aly; Eduardo Soria-Vazquez; Victor Sucasas (INFOCOM (Workshops), 2024)

Verifiable Computation for Approximate Homomorphic Encryption Schemes. - Ignacio Cascudo; Anamaria Costache; Daniele Cozzo; Dario Fiore 001; Antonio Guimarães; Eduardo Soria-Vazquez (IACR Cryptol. ePrint Arch., 2025)

FANNG-MPC: Framework for Artificial Neural Networks and Generic MPC. - Najwa Aaraj; Abdelrahaman Aly; Tim Güneysu; Chiara Marcolla; Johannes Mono; Rogerio Paludo; Iván Santos-González; Mireia Scholz; Eduardo Soria-Vazquez; Victor Sucasas; Ajith Suresh (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2025)