What is secure multiparty computation, and can it keep AI chats private?

The Morse teamPublished 11 min read

Secure multiparty computation (MPC) is a branch of cryptography that lets several parties compute a result from their combined data while each party's own input stays hidden from the others, so they learn the answer and nothing about what anyone else put in. NIST's privacy-enhancing cryptography project describes it as letting "multiple parties, often mutually distrustful, to compute some property of their joint inputs," with the same result as if "a trusted third party" had done it, but with no such party (NIST PEC). As of November 2026, secure multi-party computation runs real wage-gap studies and ad measurement, but no AI chat app we know of runs a language model under it, because the research systems still take seconds to minutes per word.

We read NIST's MPC and threshold pages, the Boston Women's Workforce Council's and Boston University's own pages on their wage study, the researchers' write-up of the Danish sugar beet auction, Google's, Meta's, and Coinbase's MPC code repositories, the Internet Security Research Group's pages on the COVID exposure notification analytics, and seven papers on MPC for language models, all on November 4, 2026. Each number below links to the page it came from.

Key factAs of November 4, 2026
What it doesComputes "a function over inputs distributed across several parties, without each party revealing their input" (NIST PEC)
Main building blocksSecret sharing, garbled circuits, and oblivious transfer
What it assumesUsually that the parties don't collude; if they pool what they hold, the inputs can be rebuilt
First large-scale useThe Danish sugar beet auction, computed on January 14, 2008 (ERCIM News)
StandardsNone for MPC itself; NIST's First Call for Multi-Party Threshold Schemes (NIST IR 8214C) went final on January 20, 2026 (NIST)
Speed on a language modelAbout 5 minutes per token for LLaMA-7B in a 2023 paper; about 3 seconds per token for a 6-billion-parameter model in 2024 (arXiv, arXiv)
Used for AI chat todayNo. Private AI chat runs in trusted execution environments instead

How does secure multiparty computation work?

It splits each secret into pieces that are meaningless alone, lets each party compute on the pieces it holds, and combines only the final results. The two classic ways to do that are secret sharing and garbled circuits.

Secret sharing is the easier one to picture. Say three coworkers want their average salary without telling each other what they earn. You earn $80,000, so you pick two random numbers and a third that makes them add up: 51,312, minus 9,104, and 37,792. You hand one piece to each of three servers. Every coworker does the same. Each server adds up the pieces it received, which is a meaningless number, and the three servers' totals add up to the true sum of all three salaries. Divide by three and you have the average. No server ever saw a salary, and no single piece says anything about one.

Adding is free in this scheme. Multiplying shared numbers takes a round of messages between the servers, and a neural network does billions of multiplications. That traffic is where MPC's cost comes from.

Garbled circuits handle two parties. One party writes the computation as a circuit of logic gates and encrypts every gate's table of inputs and outputs. The other party gets the encrypted circuit and, through a step called oblivious transfer, the keys for its own input bits, without the first party learning which keys it took. The second party runs the circuit gate by gate and can decrypt only the final output.

Both work only if the parties holding the pieces don't pool them. The Internet Security Research Group, which ran an MPC system for the US exposure notification apps, put that as the design rule that "no single organization controls both of the aggregator servers" (Divvi Up, May 2022).

Where is secure multiparty computation used today?

In a handful of places where several organizations want one statistic and none will hand over its records. Each row below is read on the deployer's own page or the researchers' own write-up:

DeploymentWhat was computedWho held the piecesSource
Danish sugar beet auction, January 2008The market-clearing price for production contracts, from about 1,200 bidders; about 25,000 tons of rights changed hands, and the computation took about 30 minutesDanisco, the growers' association DKS, and the SIMAP research projectERCIM News
Boston wage gap study, every two yearsGender and racial pay gaps across Greater Boston employersA Boston University server and an independent third partyBWWC, Boston University
Exposure Notifications Private Analytics, from 2020Totals such as how many exposure alerts phones showedTwo aggregators, run by ISRG and the NIH; Apple's and Google's servers passed on shares they couldn't decryptISRG, June 2021
Google's Private Join and ComputeAd conversion rates: how many users two companies share, and the sum of a value for themThe two companiesGoogle on GitHub, IACR ePrint
Meta's Private Lift and Private AttributionAd lift and attribution metrics "without revealing opportunity or conversion data" per personMeta and the advertiserMeta on GitHub

The sugar beet auction ran every year until 2015, "when it was no longer needed," according to Partisia (Partisia). The researchers, Ivan Damgård and Tomas Toft, reported that 80% of bidders who answered a survey said the confidentiality of their bids was important to them.

The Boston study started from a 2013 pledge by Mayor Tom Menino's office, which required signing employers to give "anonymized wage data to a neutral third party" (Boston University, April 2015). Boston University's method is the salary example above at city scale. Each company masks its pay totals with large random numbers, sends the masked totals to a BU server and the random numbers to an independent third party, and the two sums are combined so BU learns the aggregate without "any single company's totals" (Boston University, June 2025). The December 2023 report found the gender gap in base pay fell "from 30¢ to 21¢," with over 250 employers signed up (Hariri Institute). In May 2025 the university debuted a platform built the same way for Massachusetts, whose pay equity law requires employers with 100 or more employees to submit wage data reports.

Meta's tools are winding down. Its Private Computation Solutions repository "was archived by the owner on Jun 20, 2025" and says only critical bug fixes will be applied, and its CrypTen machine-learning framework was archived on May 13, 2025 (CrypTen). Guides that still cite them as Meta's current MPC work are out of date.

What does NIST say about MPC?

NIST treats MPC as a core privacy tool but hasn't standardized it. Its privacy-enhancing cryptography page, updated October 26, 2026, says "MPC is one of the main techniques of interest to the PEC project" (NIST PEC). As an example of where it could help, NIST points to a bill in the US Congress that "proposes the use of SMPC to calculate, on behalf of students, the expected monetary return" on a degree, because the data needed "is held by multiple sources" (NIST PEC).

The nearest thing to a standard is NIST's First Call for Multi-Party Threshold Schemes, NIST IR 8214C, published in final form on January 20, 2026. It asks for threshold schemes that "apply principles of secure multiparty computation (MPC)," and its scope includes fully homomorphic encryption too (NIST). Its 2026 workshop, held January 26 to 29, heard preview talks on planned submissions, with more previews on September 30 and in October 2026.

Can MPC be used for AI?

Yes, for training statistics and for small models, but on language models it is still a research result. MPC already sits inside some AI training, in federated learning's secure aggregation step, which lets a server add up thousands of phones' model updates without seeing any one (IACR ePrint). We cover how that fits with the rest of federated learning in what is federated learning.

Running a chatbot under MPC is much harder. Here is what the papers measured, in their own numbers:

PaperModelResult
MPCFormer, ICLR 2023BERT-baseEarlier private inference "can increase the inference latency by more than 60x"; its own method was 5.3 times faster on one benchmark by changing the model (arXiv)
PUMA, 2023LLaMA-7B"Around 5 minutes to generate 1 token," the first model that size under MPC (arXiv)
BumbleBee, NDSS (ePrint 2023)LLaMA-7B"One token in approximately 14 minutes using CPUs" (IACR ePrint)
SIGMA, PETS 2024Llama 2 13B and GPT-2Llama 2 with 13 billion parameters "in 44 seconds," GPT-2 in 1.6 seconds, on GPUs (IACR ePrint)
PermLLM, 2024ChatGLM-6B"Around 3s/token" over a 1 Gbps network with 10 ms round trips; earlier methods needed "gigabytes of data transfer and several minutes" per token (arXiv)
MPCache, NeurIPS 2025Not named in the abstract1.8 to 2.01 times lower decoding latency, and 3.39 to 8.37 times less communication, than earlier MPC inference (arXiv)
Comet, 2025Four common LLMs1.87 to 2.63 times faster than six earlier systems (arXiv)

Times have fallen from 14 minutes a token in one design to about 3 seconds in another. The fastest result is on a 6-billion-parameter model, though, much smaller than the models people chat with, and 3 seconds a token still means a 300-word answer takes around 20 minutes.

Why don't AI chat apps use MPC yet?

Speed is the first reason, and the table above shows it. Three more come out of the same papers and deployments:

  • The traffic. Every multiplication on shared numbers needs a round of messages, which is how earlier systems reached "gigabytes of data transfer" per token, in the PermLLM authors' words. MPCache and Comet both count cutting that traffic among their main gains.
  • The approximations. A model's softmax and GeLU steps are expensive under MPC, so systems swap in approximations. MPCFormer retrains the model to fit; PUMA's selling point is that it matches the original model's accuracy without that.
  • The second party. MPC is private only if the parties don't pool their pieces. Either your own device is one party, trading data with the server for every token, or a second organization runs the other server and you trust the two not to compare notes. The exposure notification system put its two aggregators on different public clouds for that reason, and its operators wrote that each cross-cloud misconfiguration could open a security hole (Divvi Up).

So private AI chat went another way. Apple's Private Cloud Compute post says large cloud models need "unencrypted access to the user's request," which "precludes the use of end-to-end encryption," so iPhones talk only to servers that "can cryptographically attest to running publicly listed software" (Apple Security, June 2024). That's a trusted execution environment, and what is a trusted execution environment covers how attestation works and where its limits are.

MPC vs homomorphic encryption vs TEEs: which keeps data private?

They hide different things from different people, at very different speeds. Homomorphic encryption lets one server compute on data it can't decrypt, and what is homomorphic encryption covers its schemes and costs. Here are the five techniques side by side, on the questions that matter for a chat:

TechniqueWho can see your raw dataSpeed on a large modelUsed for AI chat today?
Secure multiparty computationNo single party, as long as the parties don't colludeAbout 3 seconds to 14 minutes a token in the papers aboveNo
Homomorphic encryptionOnly the key holder; the server computes on ciphertext18 seconds a token for Llama-3-8B on 8 GPUs in a 2026 paper (arXiv)No
Trusted execution environmentOnly the code inside the attested hardware"Up to 98% of the performance of unsecured deployments" on NVIDIA's GPUs (NVIDIA)Yes, in Apple's Private Cloud Compute and in apps with enclave-based encrypted modes
Differential privacyWhoever collects the data, in the usual setup; it limits what published results reveal about any one person (NIST SP 800-226)Adds noise, not delayNot for hiding prompts; it protects statistics and training
Federated learningYour device keeps the raw data; the server sees model updatesApplies to training, not answeringNot for chat; used to train keyboards such as Gboard

NIST's threshold call covers MPC and homomorphic encryption alike. Where they differ for a chat is the trust they ask for. Homomorphic encryption asks you to trust the math alone, while MPC asks you to trust that two organizations won't collude, and a TEE asks you to trust the chip maker's hardware.

How Morse keeps your prompts unreadable without MPC

A model has to read your prompt to answer it, and every technique in this article is a way to keep that reading away from the people who run the servers. MPC does it by splitting the prompt across servers that mustn't collude, at seconds to minutes a token. Morse doesn't use MPC. Its E2EE mode does the reading inside a secure enclave, a trusted execution environment, that your browser checks first.

  • E2EE, for prompts no server operator should read. Your browser verifies the enclave's hardware attestation itself and compares what's running against versions pinned in the app. Then it encrypts the message on your device so only that enclave can read it. Morse's servers relay ciphertext they can't read, and the reply is decrypted only in your browser. Open-weight models like GLM, Kimi, and DeepSeek run there, and every reply has a lock you can open to see each check that passed. The guarantee rests on the enclave hardware and attestation working as designed, and the enclaves are run by third-party providers, not by Morse. E2EE chats come with Pro, at $19 a month.
  • Private, for prompts a host may read but mustn't keep. Morse has zero data retention agreements with its inference, search, and other providers, so the hosts agreed to keep nothing. Where a provider confirms zero retention on each reply, Morse checks it and refuses a reply that doesn't.
  • Anonymous, for GPT, Claude, and Gemini. Morse's proxy removes your account, email, and IP address, so the provider sees the message without knowing it's you. The provider may keep it for a limited time to check for abuse, under its own policy, so leave out names you'd rather not send.

Morse isn't the only app that uses enclaves, and the end-to-end encrypted AI chat guide shows what to check in any of them. In every Morse mode, your chat history is stored in your browser, encrypted, not on Morse's servers, and Morse doesn't train AI on your chats, sell your data, or show ads. Because Morse doesn't store chats, it usually has very little to give authorities.

You can start free with no card, and move to Pro when a chat needs the enclave.

Common questions

What is an MPC wallet?

It's a crypto wallet whose signing key is split into shares held by different parties, so a transaction is signed jointly and no single device holds the whole key. Coinbase's open-source cb-mpc library, for example, lets parties generate and refresh keyshares and produce signatures without combining them.

Is MPC the same as threshold cryptography?

Threshold cryptography is one use of it. NIST describes threshold schemes as applying the principles of MPC to give "a secure distribution of trust" in operations like signing and decryption, so no single key holder can act alone.

Does federated learning use secure multiparty computation?

Often, in its secure aggregation step. A 2017 Google protocol lets a server "compute the sum of large, user-held data vectors from mobile devices" while staying secure even if some phones drop out, so it learns the total update without any one phone's.

What happens if one party in an MPC protocol cheats?

It depends on the protocol's security model. Google's Private Join and Compute, for example, promises its guarantees only when both parties follow the protocol, and its README warns that a party who deviates could learn more.

Ask what you actually want to ask.

Over 30 models, characters, and images, with every chat encrypted and kept on your device. Free to start.

Start a private chat

Read next