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

DOI10.1007/s00145-023-09464-4MaRDI QIDQ6176271

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

Publication date: 22 August 2023

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

Mathematics Subject Classification ID

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

Related Items (1)

MPClan: protocol suite for privacy-conscious computations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Overdrive: making SPDZ great again
• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
• 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
• MArBLed circuits: mixing arithmetic and Boolean circuits with active security
• Benchmarking privacy preserving scientific operations
• High-precision privacy-preserving real-valued function evaluation
• Multiparty Computation from Somewhat Homomorphic Encryption
• Two Halves Make a Whole
• Actively Secure OT Extension with Optimal Overhead
• Improved Garbled Circuit: Free XOR Gates and Applications
• Practically Efficient Multi-party Sorting Protocols from Comparison Sort Algorithms
• How Good Is Multi-Pivot Quicksort?
• A Permutation Network
• High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority

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