Eduardo Soria-Vazquez

Orcid: 0000-0002-4882-0230

According to our database1, Eduardo Soria-Vazquez authored at least 19 papers between 2015 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Verifiable Computation for Approximate Homomorphic Encryption Schemes.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Privacy Preserving Underwater Collaborative Localization using Time Lock Puzzles.
Proceedings of the IEEE INFOCOM 2024, 2024

HELIOPOLIS: Verifiable Computation over Homomorphically Encrypted Data from Interactive Oracle Proofs is Practical.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
FANNG-MPC: Framework for Artificial Neural Networks and Generic MPC.
IACR Cryptol. ePrint Arch., 2023

Taming Adaptivity in YOSO Protocols: The Modular Way.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

2022
Doubly Efficient Interactive Proofs over Infinite and Non-commutative Rings.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

2021
Rinocchio: SNARKs for Ring Arithmetic.
IACR Cryptol. ePrint Arch., 2021

Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Efficient Information-Theoretic Multi-party Computation over Non-commutative Rings.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Circuit Amortization Friendly Encodings and their Application to Statistically Secure Multiparty Computation.
IACR Cryptol. ePrint Arch., 2020

Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Circuit Amortization Friendly Encodingsand Their Application to Statistically Secure Multiparty Computation.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
Towards secure multi-party computation on the Internet : few rounds and many parties
PhD thesis, 2019

2018
TinyKeys: A New Approach to Efficient Multi-Party Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT).
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

Faster Secure Multi-party Computation of AES and DES Using Lookup Tables.
Proceedings of the Applied Cryptography and Network Security, 2017

2016
More Efficient Constant-Round Multi-party Computation from BMR and SHE.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

2015
Some applications of verifiable computation to biometric verification.
Proceedings of the 2015 IEEE International Workshop on Information Forensics and Security, 2015


  Loading...