Subtopic Deep Dive
Secure Multi-Party Computation
Research Guide
What is Secure Multi-Party Computation?
Secure Multi-Party Computation (SMPC) enables multiple parties to jointly compute a function over their private inputs while keeping those inputs confidential from each other.
SMPC protocols rely on cryptographic primitives like secret sharing and garbled circuits to ensure security against semi-honest or malicious adversaries. Foundational work by Lindell and Pinkas (2000, 1028 citations) and (2002, 671 citations) introduced efficient SMPC for data mining tasks. Over 10 key papers from 1998-2021, cited 400-1000+ times, demonstrate applications in privacy-preserving machine learning and blockchain.
Why It Matters
SMPC allows hospitals to train AI models on patient data without sharing records, as in Kaissis et al. (2020, 1148 citations) for federated medical imaging. It supports blockchain privacy via techniques reviewed in Bernal Bernabé et al. (2019, 396 citations), enabling secure auctions and voting. Du and Atallah (2001, 440 citations) highlight applications in untrusted cooperative computation for cloud services.
Key Research Challenges
Computational Efficiency
SMPC protocols like garbled circuits incur high overhead, limiting scalability to large datasets. Lindell and Pinkas (2002, 671 citations) showed million-gate circuits take seconds on early hardware. Recent works seek optimizations for real-time use in machine learning (Kaissis et al., 2020).
Malicious Adversary Security
Most protocols assume semi-honest parties; malicious models require costlier zero-knowledge proofs. Du and Atallah (2001, 440 citations) identify gaps in robust applications. Xu et al. (2014, 621 citations) note vulnerabilities in big data mining.
Communication Bandwidth
Secret sharing floods networks with shares proportional to input size. Gertner et al. (1998, 447 citations) address related PIR bandwidth issues. Yin et al. (2021, 528 citations) survey PPFL needs for low-bandwidth aggregation.
Essential Papers
Secure, privacy-preserving and federated machine learning in medical imaging
Georgios Kaissis, Marcus R. Makowski, Daniel Rückert et al. · 2020 · Nature Machine Intelligence · 1.1K citations
Privacy Preserving Data Mining
Yehuda Lindell, Benny Pinkas · 2000 · Lecture notes in computer science · 1.0K citations
Information Security in Big Data: Privacy and Data Mining
Lei Xu, Chunxiao Jiang, Jian Wang et al. · 2014 · IEEE Access · 621 citations
The growing popularity and development of data mining technologies bring serious threat to the security of individual,'s sensitive information. An emerging research topic in data mining, known as p...
A Comprehensive Survey of Privacy-preserving Federated Learning
Xuefei Yin, Yanming Zhu, Jiankun Hu · 2021 · ACM Computing Surveys · 528 citations
The past four years have witnessed the rapid development of federated learning (FL). However, new privacy concerns have also emerged during the aggregation of the distributed intermediate results. ...
Protecting data privacy in private information retrieval schemes
Yael Gertner, Yuval Ishai, Eyal Kushilevitz et al. · 1998 · 447 citations
Article Free Access Share on Protecting data privacy in private information retrieval schemes Authors: Yael Gertner Department of Computer and Information Science, University of Pennsylvania, Phila...
Secure multi-party computation problems and their applications
Wenliang Du, Mikhail J. Atallah · 2001 · 440 citations
The growth of the Internet has triggered tremendous opportunities for cooperative computation, where people are jointly conducting computation tasks based on the private inputs they each supplies. ...
Machine Learning with Membership Privacy using Adversarial Regularization
Milad Nasr, Reza Shokri, Amir Houmansadr · 2018 · 420 citations
10.1145/3243734.3243855
Reading Guide
Foundational Papers
Start with Lindell and Pinkas (2000, 1028 citations) for core SMPC-data mining; Du and Atallah (2001, 440 citations) for applications; Gertner et al. (1998, 447 citations) for privacy primitives.
Recent Advances
Kaissis et al. (2020, 1148 citations) for federated imaging; Yin et al. (2021, 528 citations) PPFL survey; Bernal Bernabé et al. (2019, 396 citations) blockchain review.
Core Methods
Garbled circuits (Yao's protocol via Lindell/Pinkas 2002); secret sharing (Shamir's scheme); GMW protocol for malicious security (Du and Atallah, 2001).
How PapersFlow Helps You Research Secure Multi-Party Computation
Discover & Search
Research Agent uses citationGraph on Lindell and Pinkas (2000) to map 1000+ citing works in SMPC for data mining, then exaSearch for 'SMPC garbled circuits scalability' to find 50 recent optimizations. findSimilarPapers expands to blockchain apps like Bernal Bernabé et al. (2019).
Analyze & Verify
Analysis Agent runs readPaperContent on Kaissis et al. (2020) to extract SMPC protocol details, then verifyResponse with CoVe checks claims against Du and Atallah (2001). runPythonAnalysis simulates secret sharing overhead with NumPy, graded by GRADE for statistical rigor in efficiency benchmarks.
Synthesize & Write
Synthesis Agent detects gaps in malicious SMPC via contradiction flagging across Lindell papers, then Writing Agent uses latexEditText and latexSyncCitations to draft a review with 20 refs. exportMermaid visualizes protocol comparison diagrams; latexCompile produces camera-ready LaTeX.
Use Cases
"Benchmark secret sharing efficiency in SMPC for 100-party medical imaging."
Research Agent → searchPapers 'SMPC secret sharing benchmarks' → Analysis Agent → runPythonAnalysis (NumPy simulation of share generation/scaling) → matplotlib plot of overhead vs. parties.
"Write LaTeX survey comparing garbled circuits vs. secret sharing in SMPC."
Synthesis Agent → gap detection on Lindell/Pinkas papers → Writing Agent → latexEditText (protocol tables) → latexSyncCitations (20 refs) → latexCompile → PDF output.
"Find GitHub repos implementing SMPC from recent papers."
Research Agent → citationGraph (Kaissis 2020) → Code Discovery → paperExtractUrls → paperFindGithubRepo → githubRepoInspect (PriMIA codebase stats, usage).
Automated Workflows
Deep Research workflow scans 50+ SMPC papers via searchPapers → citationGraph, producing structured report with GRADE-verified efficiency metrics from Kaissis et al. DeepScan's 7-step chain analyzes Du and Atallah (2001) with CoVe checkpoints for application gaps. Theorizer generates hypotheses on SMPC+blockchain from Bernal Bernabé et al. (2019) citations.
Frequently Asked Questions
What is Secure Multi-Party Computation?
SMPC lets parties compute functions on private inputs without revealing them, using secret sharing or garbled circuits (Lindell and Pinkas, 2000).
What are core SMPC methods?
Key methods include Yao's garbled circuits and Shamir's secret sharing; Lindell and Pinkas (2002) apply them to data mining with efficiency proofs.
What are key SMPC papers?
Lindell and Pinkas (2000, 1028 citations) foundational; Kaissis et al. (2020, 1148 citations) for medical apps; Du and Atallah (2001, 440 citations) for applications.
What are open problems in SMPC?
Scalability for malicious adversaries and low-bandwidth protocols; Yin et al. (2021) highlight PPFL gaps; Xu et al. (2014) note big data challenges.
Research Privacy-Preserving Technologies in Data with AI
PapersFlow provides specialized AI tools for Computer Science researchers. Here are the most relevant for this topic:
AI Literature Review
Automate paper discovery and synthesis across 474M+ papers
Code & Data Discovery
Find datasets, code repositories, and computational tools
Deep Research Reports
Multi-source evidence synthesis with counter-evidence
AI Academic Writing
Write research papers with AI assistance and LaTeX support
See how researchers in Computer Science & AI use PapersFlow
Field-specific workflows, example queries, and use cases.
Start Researching Secure Multi-Party Computation with AI
Search 474M+ papers, run AI-powered literature reviews, and write with integrated citations — all in one workspace.
See how PapersFlow works for Computer Science researchers