Search

Eduardo Soria-Vazquez

Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits
Circuit Amortization Friendly Encodings and their application to Statistically Secure Multiparty Computation
Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability
Low cost constant round MPC combining BMR and oblivious transfer
Concretely efficient large-scale MPC with active security (or, TinyKeys for TinyOT)
TinyKeys: A new approach to efficient multi-party computation
Low cost constant round MPC combining BMR and oblivious transfer
Faster secure multi-party computation of AES and DES using lookup tables
Identification method of an entity
More efficient constant-round multi-party computation from BMR and SHE
Some applications of verifiable computation to biometric verification

Published with Wowchemy — the free, open source website builder that empowers creators.