Daniel Escudero
Orcid: 0000-0003-2375-0034Affiliations:
- J.P. Morgan AI Research
- Aarhus University, Denmark (former)
- Universidad Nacional de Colombia, Medellín, Colombia (former)
According to our database1,
Daniel Escudero
authored at least 40 papers
between 2016 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on escudero.me
-
on orcid.org
On csauthors.net:
Bibliography
2024
Sublinear Distributed Product Checks on Replicated Secret-Shared Data over ℤ<sub>2<sup>k</sup></sub> without Ring Extensions.
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
Perfectly-Secure Multiparty Computation with Linear Communication Complexity over Any Modulus.
IACR Cryptol. ePrint Arch., 2024
Dishonest Majority Multi-Verifier Zero-Knowledge Proofs for Any Constant Fraction of Corrupted Verifiers.
IACR Cryptol. ePrint Arch., 2024
Fully Secure MPC and zk-FLIOP Over Rings: New Constructions, Improvements and Extensions.
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
Multi-Verifier Zero-Knowledge Proofs for Any Constant Fraction of Corrupted Verifiers.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024
2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023
2022
J. Comput. Secur., 2022
IACR Cryptol. ePrint Arch., 2022
Fast Fully Secure Multi-Party Computation over Any Ring with Two-Thirds Honest Majority.
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
More Efficient Dishonest Majority Secure Computation over ℤ<sub>2<sup>k</sup></sub> via Galois Rings.
IACR Cryptol. ePrint Arch., 2022
Proceedings of the Theory of Cryptography - 20th International Conference, 2022
More Efficient Dishonest Majority Secure Computation over $\mathbb {Z}_{2^k}$ via Galois Rings.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022
2021
Proc. Priv. Enhancing Technol., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
Improved Threshold Signatures, Proactive Secret Sharing, and Input Certification from LSS Isomorphisms.
Proceedings of the Progress in Cryptology - LATINCRYPT 2021, 2021
2020
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
Fantastic Four: Honest-Majority Four-Party Secure Computation With Malicious Security.
IACR Cryptol. ePrint Arch., 2020
LSS Homomorphisms and Applications to Secure Signatures, Proactive Secret Sharing and Input Certification.
IACR Cryptol. ePrint Arch., 2020
Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z.
IACR Cryptol. ePrint Arch., 2020
Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020
2019
New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning.
IACR Cryptol. ePrint Arch., 2019
IACR Cryptol. ePrint Arch., 2019
Efficient Information-Theoretic Secure Multiparty Computation over ℤ/p<sup>k</sup> ℤ via Galois Rings.
IACR Cryptol. ePrint Arch., 2019
2018
SPDℤ<sub>2<sup>k</sup></sub>: Efficient MPC mod 2<sup>k</sup> for Dishonest Majority.
IACR Cryptol. ePrint Arch., 2018
2016
Proceedings of the Post-Quantum Cryptography - 7th International Workshop, 2016