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
| Tag | 3VT5EZ8J6W |
|---|---|
| URI | m2://3VT5EZ8J6W |
| Kind | topic |
| Writing | W0 stub |
| MSC | 94A60, 94A62, 68Q85 |
| Part of | Mathematical cryptography |
| Changed | 17 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.
| Date | Change | Field | By |
|---|---|---|---|
| 2026-11-17 | add | the whole node | tamnd |
What links here
No page links to this page yet.