Math 2.0

Areas Mathematical cryptography Topic

Secure multiparty computation

Summary

This topic is a part of mathematical cryptography. It covers the joint computation of a function on private inputs, with the definitions, the feasibility theorems, oblivious transfer as the core primitive, and the main techniques of protocols.

About this page
Tag3VT5EZ8J6W
URIm2://3VT5EZ8J6W
Kindtopic
WritingW0 stub
MSC94A60, 94A62, 68Q85
Part ofMathematical cryptography
Changed17 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a same_as or a source (0 of 1)
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

History

Each change to this page, from its provenance log. A change by an agent names its run.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe whole nodetamnd

What links here

No page links to this page yet.