Eduardo Soria-Vazquez
Eduardo Soria-Vazquez
Verified email at cs.au.dk
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
442020
More Efficient Constant-Round Multi-Party Computation from BMR and SHE
Y Lindell, NP Smart, E Soria-Vazquez
Theory of Cryptography Conference, 554-581, 2016
272016
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
152017
TinyKeys: A New Approach to Efficient Multi-Party Computation
C Hazay, E Orsini, P Scholl, E Soria-Vazquez
Annual International Cryptology Conference, 2018
142018
Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT)
C Hazay, E Orsini, P Scholl, E Soria-Vazquez
International Conference on the Theory and Application of Cryptology and …, 2018
82018
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
82015
Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability
C Baum, E Orsini, P Scholl, E Soria-Vazquez
Annual International Cryptology Conference, 562-592, 2020
2020
Circuit Amortization Friendly Encodings and their Application to Statistically Secure Multiparty Computation
A Dalskov, E Lee, E Soria-Vazquez
Asiacrypt, 2020
2020
Identification method of an entity
J Bringer, ROL DE CHAPTAL-LAMURE, H Chabanne, ...
US Patent 10,230,724, 2019
2019
The system can't perform the operation now. Try again later.
Articles 1–9