Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic

DOI10.1007/S00145-023-09464-4MaRDI QIDQ6176271zbMATH OpenFDO

Authors Mariya Georgieva Belorgey, Sergiu Carpov, Kevin Deforth, Dimitar Jetchev, Abson Sae-Tang, Marius Vuille, Nicolas Gama, Jon Katz, Iraklis Leontiadis, Mohsen Mohammadi

Publication date 22 August 2023

Published in Journal of Cryptology (Search for Journal in Brave)

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Efficient multiparty computation for arithmetic circuits against a covert majority
• Secure multiparty computations in floating-point arithmetic
• Verifiable computation in multiparty protocols with honest majority
• scientific article; zbMATH DE number 1583776
• Generalizing efficient multiparty computation
• An Efficient Framework for Unconditionally Secure Multiparty Computation
• Scalable and Unconditionally Secure Multiparty Computation
• Robust multiparty computation with faster verification time
• Scalable Secure Multiparty Computation

Cites work

• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• scientific article; zbMATH DE number 176564 (Why is no real title available?)
• A Permutation Network
• Actively secure OT extension with optimal overhead
• Benchmarking privacy preserving scientific operations
• High-precision privacy-preserving real-valued function evaluation
• High-throughput secure three-party computation for malicious adversaries and an honest majority
• How good is multi-pivot quicksort?
• Improved Garbled Circuit: Free XOR Gates and Applications
• Improved primitives for MPC over mixed arithmetic-binary circuits
• MArBLed circuits: mixing arithmetic and Boolean circuits with active security
• Multiparty Computation from Somewhat Homomorphic Encryption
• Overdrive: making SPDZ great again
• Practically efficient multi-party sorting protocols from comparison sort algorithms
• Scikit-learn: machine learning in Python
• Sublinear GMW-style compiler for MPC with preprocessing
• Two halves make a whole: reducing data transfer in garbled circuits using half gates
• \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation
• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority

Cited in

(1)

• MPClan: protocol suite for privacy-conscious computations

This page was built for publication: Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6176271)