In YACL, all existing algorithms are under the semi-honest model.

My question is: is it possible to implement a Beaver Triple and shuffling protocols in the malicious setting? We need those protocols as primitives to design a new protocol and use secretflow to test our protocol for benchmarking to publish academic papers.

The necessary knowledge that might be used in this issue includes cryptography, oblivious transfer, and secret shared shuffle.
And let's consider the computational security parameter is $\kappa=128$.

Some related works are provided as follows.
Ferret: Fast extension for correlated OT with small communication. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security.
Secret-shared shuffle. ASIACRYPT 2020