Towards practical secure neural network inference: the journey so far and the road ahead

ZÁ Mann, C Weinert, D Chabal, JW Bos - ACM Computing Surveys, 2023 - dl.acm.org
Neural networks (NNs) have become one of the most important tools for artificial
intelligence. Well-designed and trained NNs can perform inference (eg, make decisions or …

Concretely efficient secure multi-party computation protocols: survey and more

D Feng, K Yang - Security and Safety, 2022 - sands.edpsciences.org
Secure multi-party computation (MPC) allows a set of parties to jointly compute a function on
their private inputs, and reveals nothing but the output of the function. In the last decade …

Rinocchio: SNARKs for ring arithmetic

C Ganesh, A Nitulescu, E Soria-Vazquez - Journal of Cryptology, 2023 - Springer
Succinct non-interactive arguments of knowledge (SNARKs) enable non-interactive efficient
verification of NP computations and admit short proofs. However, all current SNARK …

Efficient multiplicative-to-additive function from Joye-Libert cryptosystem and its application to threshold ECDSA

H Xue, MH Au, M Liu, KY Chan, H Cui, X **e… - Proceedings of the …, 2023 - dl.acm.org
Threshold ECDSA receives interest lately due to its widespread adoption in blockchain
applications. A common building block of all leading constructions involves a secure …

Practical fully secure three-party computation via sublinear distributed zero-knowledge proofs

E Boyle, N Gilboa, Y Ishai, A Nof - … of the 2019 ACM SIGSAC Conference …, 2019 - dl.acm.org
Secure multiparty computation enables a set of parties to securely carry out a joint
computation on their private inputs without revealing anything but the output. A particularly …

Overdrive2k: Efficient secure MPC over from somewhat homomorphic encryption

E Orsini, NP Smart, F Vercauteren - Cryptographers' Track at the RSA …, 2020 - Springer
Recently, Cramer et al.(CRYPTO 2018) presented a protocol, SPDZ2k, for actively secure
multiparty computation for dishonest majority in the pre-processing model over the ring Z …

More Efficient Dishonest Majority Secure Computation over  via Galois Rings

D Escudero, C **ng, C Yuan - Annual International Cryptology Conference, 2022 - Springer
In this work we present a novel actively secure multiparty computation protocol in the
dishonest majority setting, where the computation domain is a ring of the type Z 2 k. Instead …

Threshold Linearly Homomorphic Encryption on 

G Castagnos, F Laguillaumie, I Tucker - … on the Theory and Application of …, 2022 - Springer
A threshold public key encryption protocol is a public key system where the private key is
distributed among n different servers. It offers high security since no single server is …

Improved multiplication triple generation over rings via RLWE-based AHE

D Rathee, T Schneider, KK Shukla - International conference on …, 2019 - Springer
An important characteristic of recent MPC protocols is an input-independent setup phase in
which most computations are offloaded, which greatly reduces the execution overhead of …

Use your brain! Arithmetic 3PC for any modulus with active security

H Eerikson, M Keller, C Orlandi, P Pullonen… - Cryptology ePrint …, 2019 - eprint.iacr.org
Secure multiparty computation (MPC) allows a set of mutually distrustful parties to compute a
public function on their private inputs without revealing anything beyond the output of the …