Eduardo Soria-Vazquez

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Verifiable computation for approximate homomorphic encryption schemes	2026-02-06	Paper
HELIOPOLIS: verifiable computation over homomorphically encrypted data from interactive oracle proofs is practical	2025-07-03	Paper
Taming adaptivity in YOSO protocols: the modular way	2024-08-02	Paper
Rinocchio: SNARKs for ring arithmetic Journal of Cryptology	2023-11-21	Paper
Doubly efficient interactive proofs over infinite and non-commutative rings Theory of Cryptography	2023-08-14	Paper
Circuit amortization friendly encodingsand their application to statistically secure multiparty computation	2023-03-29	Paper
Efficient constant-round MPC with identifiable abort and public verifiability	2022-11-09	Paper
Faster secure multi-party computation of AES and DES using lookup tables	2022-07-01	Paper
Efficient information-theoretic multi-party computation over non-commutative rings	2022-04-22	Paper
TinyKeys: a new approach to efficient multi-party computation Journal of Cryptology	2022-04-11	Paper
Large scale, actively secure computation from LPN and free-XOR garbled circuits	2021-12-08	Paper
Low cost constant round MPC combining BMR and oblivious transfer Journal of Cryptology	2020-11-06	Paper
TinyKeys: a new approach to efficient multi-party computation Lecture Notes in Computer Science	2020-06-30	Paper
Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)	2019-01-23	Paper
Low cost constant round MPC combining BMR and oblivious transfer Advances in Cryptology – ASIACRYPT 2017	2018-04-06	Paper
More efficient constant-round multi-party computation from BMR and SHE Theory of Cryptography	2016-12-21	Paper

Research outcomes over time

This page was built for person: Eduardo Soria-Vazquez