default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEduardo Soria-Vazquez
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]R. Praveen Jain, Pietro Tedeschi
, Jeremy Nicola, Abdelrahaman Aly, Eduardo Soria-Vazquez, Victor Sucasas:
Privacy Preserving Underwater Collaborative Localization using Time Lock Puzzles. INFOCOM (Workshops) 2024: 1-6- 2023
- [j3]Chaya Ganesh, Anca Nitulescu, Eduardo Soria-Vazquez:
Rinocchio: SNARKs for Ring Arithmetic. J. Cryptol. 36(4): 41 (2023) - [c12]Ran Canetti, Sebastian Kolby, Divya Ravi, Eduardo Soria-Vazquez, Sophia Yakoubov:
Taming Adaptivity in YOSO Protocols: The Modular Way. TCC (2) 2023: 33-62 - [i14]Ran Canetti, Sebastian Kolby, Divya Ravi, Eduardo Soria-Vazquez, Sophia Yakoubov:
Taming Adaptivity in YOSO Protocols: The Modular Way. IACR Cryptol. ePrint Arch. 2023: 1077 (2023) - [i13]Najwa Aaraj, Abdelrahaman Aly, Tim Güneysu, Chiara Marcolla, Johannes Mono, Rogerio Paludo, Iván Santos-González, Mireia Scholz, Eduardo Soria-Vazquez, Victor Sucasas, Ajith Suresh:
FANNG-MPC: Framework for Artificial Neural Networks and Generic MPC. IACR Cryptol. ePrint Arch. 2023: 1918 (2023) - [i12]Diego F. Aranha, Anamaria Costache, Antonio Guimarães, Eduardo Soria-Vazquez:
HELIOPOLIS: Verifiable Computation over Homomorphically Encrypted Data from Interactive Oracle Proofs is Practical. IACR Cryptol. ePrint Arch. 2023: 1949 (2023) - 2022
- [j2]Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez:
TinyKeys: A New Approach to Efficient Multi-Party Computation. J. Cryptol. 35(2): 13 (2022) - [c11]Eduardo Soria-Vazquez:
Doubly Efficient Interactive Proofs over Infinite and Non-commutative Rings. TCC (1) 2022: 497-525 - [i11]Eduardo Soria-Vazquez:
Doubly Efficient Interactive Proofs over Infinite and Non-Commutative Rings. IACR Cryptol. ePrint Arch. 2022: 587 (2022) - 2021
- [c10]Daniel Escudero, Eduardo Soria-Vazquez:
Efficient Information-Theoretic Multi-party Computation over Non-commutative Rings. CRYPTO (2) 2021: 335-364 - [c9]Aner Ben-Efraim, Kelong Cong, Eran Omri, Emmanuela Orsini, Nigel P. Smart, Eduardo Soria-Vazquez:
Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits. EUROCRYPT (3) 2021: 33-63 - [i10]Aner Ben-Efraim, Kelong Cong, Eran Omri, Emmanuela Orsini, Nigel P. Smart, Eduardo Soria-Vazquez:
Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits. IACR Cryptol. ePrint Arch. 2021: 120 (2021) - [i9]Chaya Ganesh, Anca Nitulescu, Eduardo Soria-Vazquez:
Rinocchio: SNARKs for Ring Arithmetic. IACR Cryptol. ePrint Arch. 2021: 322 (2021) - [i8]Daniel Escudero, Eduardo Soria-Vazquez:
Efficient Information-Theoretic Multi-Party Computation over Non-Commutative Rings. IACR Cryptol. ePrint Arch. 2021: 1025 (2021) - 2020
- [j1]Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez:
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. J. Cryptol. 33(4): 1732-1786 (2020) - [c8]Anders P. K. Dalskov, Eysa Lee, Eduardo Soria-Vazquez:
Circuit Amortization Friendly Encodingsand Their Application to Statistically Secure Multiparty Computation. ASIACRYPT (3) 2020: 213-243 - [c7]Carsten Baum, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez:
Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. CRYPTO (2) 2020: 562-592 - [i7]Carsten Baum, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez:
Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. IACR Cryptol. ePrint Arch. 2020: 767 (2020) - [i6]Anders P. K. Dalskov, Eysa Lee, Eduardo Soria-Vazquez:
Circuit Amortization Friendly Encodings and their Application to Statistically Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2020: 1053 (2020)
2010 – 2019
- 2019
- [b1]Eduardo Soria-Vazquez:
Towards secure multi-party computation on the Internet : few rounds and many parties. University of Bristol, UK, 2019 - 2018
- [c6]Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez:
Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). ASIACRYPT (3) 2018: 86-117 - [c5]Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez:
TinyKeys: A New Approach to Efficient Multi-Party Computation. CRYPTO (3) 2018: 3-33 - [i5]Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez:
TinyKeys: A New Approach to Efficient Multi-Party Computation. IACR Cryptol. ePrint Arch. 2018: 208 (2018) - [i4]Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez:
Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). IACR Cryptol. ePrint Arch. 2018: 843 (2018) - 2017
- [c4]Marcel Keller, Emmanuela Orsini, Dragos Rotaru, Peter Scholl, Eduardo Soria-Vazquez, Srinivas Vivek:
Faster Secure Multi-party Computation of AES and DES Using Lookup Tables. ACNS 2017: 229-249 - [c3]Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez:
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. ASIACRYPT (1) 2017: 598-628 - [i3]Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez:
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. IACR Cryptol. ePrint Arch. 2017: 214 (2017) - [i2]Marcel Keller, Emmanuela Orsini, Dragos Rotaru, Peter Scholl, Eduardo Soria-Vazquez, Srinivas Vivek:
Faster Secure Multi-Party Computation of AES and DES Using Lookup Tables. IACR Cryptol. ePrint Arch. 2017: 378 (2017) - 2016
- [c2]Yehuda Lindell, Nigel P. Smart, Eduardo Soria-Vazquez:
More Efficient Constant-Round Multi-party Computation from BMR and SHE. TCC (B1) 2016: 554-581 - [i1]Yehuda Lindell, Nigel P. Smart, Eduardo Soria-Vazquez:
More Efficient Constant-Round Multi-Party Computation from BMR and SHE. IACR Cryptol. ePrint Arch. 2016: 156 (2016) - 2015
- [c1]Julien Bringer, Hervé Chabanne, Firas Kraiem, Roch Lescuyer, Eduardo Soria-Vazquez:
Some applications of verifiable computation to biometric verification. WIFS 2015: 1-6
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
