# Introduction Distributed cryptography’s theoretical foundation and a basic challenge of distributed computing are both secure multi-party computation. The hypothesis is based on the 1982 book “Yao’s Millionaires’ Problem.” Simply defined, secure multi-party computing refers to a set of players known as P1 Pn who collaborate to safely calculate the function f(x1, xn )=(y1, yn). Then each of the n participants has one of the function f inputs. Pi has the secret input xi and receives the output yi after calculation. In this case, security necessitates ensuring the validity of the computing result, even if some individuals cheat throughout the computation process. This implies that after the computations are finished, each participant must receive the right result yi, and all participant input is protected. Through the calculation, Pi can obtain no further information other than (xi,yi). --- # Agent Instructions: Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter: ``` GET https://whitepaper.litho.ai/makalu/packages/docs/locked-account-generation-scheme/introduction.md?ask= ``` The question should be specific, self-contained, and written in natural language. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.