Follow
Eduardo Soria-Vazquez
Eduardo Soria-Vazquez
Technology Innovation Institute
Verified email at tii.ae - Homepage
Title
Cited by
Cited by
Year
Low cost constant round MPC combining BMR and oblivious transfer
C Hazay, P Scholl, E Soria-Vazquez
Journal of Cryptology 33 (4), 1732-1786, 2020
1122020
More efficient constant-round multi-party computation from BMR and SHE
Y Lindell, NP Smart, E Soria-Vazquez
Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing …, 2016
532016
Faster Secure Multi-party Computation of AES and DES Using Lookup Tables
M Keller, E Orsini, D Rotaru, P Scholl, E Soria-Vazquez, S Vivek
Applied Cryptography and Network Security: 15th International Conference …, 2017
482017
Tinykeys: a new approach to efficient multi-party computation
C Hazay, E Orsini, P Scholl, E Soria-Vazquez
Journal of Cryptology 35 (2), 13, 2022
402022
Rinocchio: SNARKs for Ring Arithmetic.
C Ganesh, A Nitulescu, E Soria-Vazquez
IACR Cryptol. ePrint Arch. 2021, 322, 2021
362021
Efficient constant-round MPC with identifiable abort and public verifiability
C Baum, E Orsini, P Scholl, E Soria-Vazquez
Advances in Cryptology–CRYPTO 2020: 40th Annual International Cryptology …, 2020
362020
Concretely efficient large-scale MPC with active security (or, TinyKeys for TinyOT)
C Hazay, E Orsini, P Scholl, E Soria-Vazquez
Advances in Cryptology–ASIACRYPT 2018: 24th International Conference on the …, 2018
272018
Circuit amortization friendly encodingsand their application to statistically secure multiparty computation
A Dalskov, E Lee, E Soria-Vazquez
Advances in Cryptology–ASIACRYPT 2020: 26th International Conference on the …, 2020
172020
Some applications of verifiable computation to biometric verification
J Bringer, H Chabanne, F Kraïem, R Lescuyer, E Soria-Vázquez
2015 IEEE International Workshop on Information Forensics and Security (WIFS …, 2015
102015
Large scale, actively secure computation from LPN and free-XOR garbled circuits
A Ben-Efraim, K Cong, E Omri, E Orsini, NP Smart, E Soria-Vazquez
Advances in Cryptology–EUROCRYPT 2021: 40th Annual International Conference …, 2021
92021
Efficient information-theoretic multi-party computation over non-commutative rings
D Escudero, E Soria-Vazquez
Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021
82021
Identification method of an entity
J Bringer, ROL DE CHAPTAL-LAMURE, H Chabanne, ...
US Patent 10,230,724, 2019
82019
Towards secure multi-party computation on the internet: Few rounds and many parties
E Soria-Vázquez
University of Bristol, 2019
3*2019
HELIOPOLIS: Verifiable Computation over Homomorphically Encrypted Data from Interactive Oracle Proofs is Practical
DF Aranha, A Costache, A Guimarães, E Soria-Vazquez
Cryptology ePrint Archive, 2023
22023
Doubly efficient interactive proofs over infinite and non-commutative rings
E Soria-Vazquez
Theory of Cryptography Conference, 497-525, 2022
22022
FANNG-MPC: Framework for Artificial Neural Networks and Generic MPC
N Aaraj, A Aly, T Güneysu, C Marcolla, J Mono, R Paludo, ...
Cryptology ePrint Archive, 2023
2023
Taming Adaptivity in YOSO Protocols: The Modular Way
R Canetti, S Kolby, D Ravi, E Soria-Vazquez, S Yakoubov
Cryptology ePrint Archive, 2023
2023
TinyKeys: A New Approach to Efficient Multi-Party Computation
C Hazay, E Orsini, P Scholl, E Soria-Vazquez
Advances in Cryptology – CRYPTO 2018: 40th Annual International Cryptology …, 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–18