Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic
DOI10.1007/S00145-023-09464-4MaRDI QIDQ6176271FDOQ6176271
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)
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
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Scikit-learn: machine learning in Python
- Multiparty Computation from Somewhat Homomorphic Encryption
- Improved Garbled Circuit: Free XOR Gates and Applications
- A Permutation Network
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- High-throughput secure three-party computation for malicious adversaries and an honest majority
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Actively secure OT extension with optimal overhead
- Overdrive: making SPDZ great again
- Benchmarking privacy preserving scientific operations
- Improved primitives for MPC over mixed arithmetic-binary circuits
- Sublinear GMW-style compiler for MPC with preprocessing
- \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation
- Practically efficient multi-party sorting protocols from comparison sort algorithms
- High-precision privacy-preserving real-valued function evaluation
- How good is multi-pivot quicksort?
Cited In (1)
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)
