Daniel Escudero

Elisaweta Masserova

IACR Cryptol. ePrint Arch., 2025

Efficient, Scalable Threshold ML-DSA Signatures: An MPC Approach.

[BibT_eX]

[DOI]

Alexander Bienstock

Leo de Castro

Akira Takahashi

IACR Cryptol. ePrint Arch., 2025

Share the MAYO: Thresholdizing MAYO.

[BibT_eX]

[DOI]

Sofía Celi

Guilhem Niot

Proceedings of the Post-Quantum Cryptography - 16th International Workshop, 2025

Brief Announcement: Towards Scalable YOSO MPC via Packed Secret-Sharing.

[BibT_eX]

[DOI]

Elisaweta Masserova

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025

2024

Dishonest Majority Multi-Verifier Zero-Knowledge Proofs for Any Constant Fraction of Corrupted Verifiers.

[BibT_eX]

[DOI]

Chenkai Weng

IACR Cryptol. ePrint Arch., 2024

Honest Majority GOD MPC with O(depth(C)) Rounds and Low Online Communication.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

Perfectly Secure Fluid MPC with Abort and Linear Communication Complexity.

[BibT_eX]

[DOI]

Alexander Bienstock

IACR Commun. Cryptol., 2024

On Information-Theoretic Secure Multiparty Computation with Local Repairability.

[BibT_eX]

[DOI]

Ivan Tjuawinata

Chaoping Xing

Proceedings of the Public-Key Cryptography - PKC 2024, 2024

Fully Secure MPC and zk-FLIOP over Rings: New Constructions, Improvements and Extensions.

[BibT_eX]

[DOI]

Ariel Nof

Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

Sublinear Distributed Product Checks on Replicated Secret-Shared Data over Z2k Without Ring Extensions.

[BibT_eX]

[DOI]

Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

Multi-Verifier Zero-Knowledge Proofs for Any Constant Fraction of Corrupted Verifiers.

[BibT_eX]

[DOI]

Chenkai Weng

Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

Perfectly-Secure Multiparty Computation with Linear Communication Complexity over Any Modulus.

[BibT_eX]

[DOI]

Wenhao Wang

Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

Honest Majority GOD MPC with O(sfdepth(C)) Rounds and Low Online Communication.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023

Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

On Fully-Secure Honest Majority MPC Without n2 Round Overhead.

[BibT_eX]

[DOI]

Serge Fehr

Proceedings of the Progress in Cryptology - LATINCRYPT 2023, 2023

SuperPack: Dishonest Majority MPC with Constant Online Communication.

[BibT_eX]

[DOI]

Vipul Goyal

Chenkai Weng

Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

On Linear Communication Complexity for (Maximally) Fluid MPC.

[BibT_eX]

[DOI]

Alexander Bienstock

Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks.

[BibT_eX]

[DOI]

Ivan Damgård

Proceedings of the 4th Conference on Information-Theoretic Cryptography, 2023

Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022

Vector Commitments over Rings and Compressed Σ-Protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

More Efficient Dishonest Majority Secure Computation over ℤ2k via Galois Rings.

[BibT_eX]

[DOI]

Chaoping Xing

Chen Yuan

IACR Cryptol. ePrint Arch., 2022

Vector Commitments over Rings and Compressed $\varSigma $-Protocols.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 20th International Conference, 2022

More Efficient Dishonest Majority Secure Computation over $\mathbb {Z}_{2^k}$ via Galois Rings.

[BibT_eX]

[DOI]

Chaoping Xing

Chen Yuan

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Fast Fully Secure Multi-Party Computation over Any Ring with Two-Thirds Honest Majority.

[BibT_eX]

[DOI]

Ariel Nof

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

TurboPack: Honest Majority MPC with Constant Online Communication.

[BibT_eX]

[DOI]

Vipul Goyal

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021

Secure Computation over Integers Modulo Powers of Two.

[BibT_eX]

[DOI]

Mark Abspoel

Ronald Cramer

ERCIM News, 2021

Fantastic Four: Honest-Majority Four-Party Secure Computation With Malicious Security.

[BibT_eX]

[DOI]

Marcel Keller

Proceedings of the 30th USENIX Security Symposium, 2021

Information-Theoretically Secure MPC Against Mixed Dynamic Adversaries.

[BibT_eX]

[DOI]

Ivan Damgård

Divya Ravi

Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Honest Majority MPC with Abort with Minimal Online Communication.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology - LATINCRYPT 2021, 2021

Improved Threshold Signatures, Proactive Secret Sharing, and Input Certification from LSS Isomorphisms.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology - LATINCRYPT 2021, 2021

Efficient Information-Theoretic Multi-party Computation over Non-commutative Rings.

[BibT_eX]

[DOI]

Eduardo Soria-Vazquez

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Improved Single-Round Secure Multiplication Using Regenerating Codes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

An Efficient Passive-to-Active Compiler for Honest-Majority MPC over Rings.

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 2021

2020

Secure Evaluation of Quantized Neural Networks.

[BibT_eX]

[DOI]

Marcel Keller

Proc. Priv. Enhancing Technol., 2020

LSS Homomorphisms and Applications to Secure Signatures, Proactive Secret Sharing and Input Certification.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Secure training of decision trees with continuous attributes.

[BibT_eX]

[DOI]

Mark Abspoel

Nikolaj Volgushev

IACR Cryptol. ePrint Arch., 2020

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE.

[BibT_eX]

[DOI]

Carsten Baum

Juan Ramón Troncoso-Pastoriza

Alberto Pedrouzo-Ulloa

Peter Scholl

Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019

Secure Evaluation of Quantized Neural Networks.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Efficient Information-Theoretic Secure Multiparty Computation over Z/pkZ via Galois Rings.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning.

[BibT_eX]

[DOI]

Ivan Damgård