Secure multi-party computation (also known as secure computation, multi-party computation (MPC) or privacy-preserving computation) is a subfield of cryptography...

Secure two-party computation (2PC, or secure function evaluation) is a sub-problem of secure multi-party computation (MPC) that has received special attention...

research on efficient two-party secure computation via the Yao garbled circuit construction, and on efficient multiparty computation for the multiparty honest-majority...

protocols: A protocol for computing a digital signature in a secure two-party computation protocol. A protocol for proving knowledge of a digital signature...

unconditionally secure quantum protocols for one-out-of-two oblivious transfer and other secure two-party computations. However, unconditionally secure relativistic...

Privacy-preserving computational geometry is the research area on the intersection of the domains of secure multi-party computation (SMC) and computational geometry...

circuit is a cryptographic protocol that enables two-party secure computation in which two mistrusting parties can jointly evaluate a function over their private...

Moti Yung. Journal of the ACM 57 (2009) Complete Fairness in Secure Two-Party Computation. S. Dov Gordon, Carmit Hazay, Jonathan Katz, and Yehuda Lindell...

algorithm. A more secure, but less efficient approach to realize a post-quantum–secure OPRF is to use a secure two-party computation protocol to compute...

Williams. Secure two-party computation is practical, ASIACRYPT 2009 I. Damgard, V. Pastro, N. P. Smart, and S. Zakarias. Multiparty computation from somewhat...

Nisan, Noam; Pinkas, Benny; Sella, Yaron (2004), "Fairplay – a secure two-party computation system", Proceedings of the 13th USENIX Security Symposium (Sec...

Private set intersection is a secure multiparty computation cryptographic technique that allows two parties holding sets to compare encrypted versions...

the notion of verifiable computation scheme as a protocol between two polynomial time parties to collaborate on the computation of a function F: {0,1}n...

Diffie–Hellman problem in their proposal) is computationally infeasible (i.e., very very hard) to solve, and that the two parties have access to an authentic channel...

the dining cryptographers problem studies how to perform a secure multi-party computation of the boolean-XOR function. David Chaum first proposed this...

Ostrovsky; Amit Sahai (2002). "Universally composable two-party and multi-party secure computation". Proceedings of the thiry-fourth annual ACM symposium...

protocol devised by Ralph Merkle in 1974 and published in 1978. It allows two parties to agree on a shared secret by exchanging messages, even if they have...

sharing is an important primitive in several protocols for secure multiparty computation. Secret sharing can also be used for user authentication in...

encryption Confidential computing Searchable symmetric encryption Secure multi-party computation Format-preserving encryption Polymorphic code Private set intersection...

these models of computation—quantum circuits, one-way quantum computation, adiabatic quantum computation, and topological quantum computation—have been shown...

Explain it like I’m Five: The Socialist Millionaire Problem and Secure Multi-Party Computation at the Wayback Machine (archived December 25, 2022) Goldbug...

of general secure multi-party computation. Verifiable secret sharing is important for secure multiparty computation. Multiparty computation is typically...

later evolved into what is known as secure multi-party computation protocols (for two parties, and multi parties as well). One possible algorithm for...

Original-E, a set of extensions to Java for secure distributed programming. E combines message-based computation with Java-like syntax. A concurrency model...

foundations of computation. It is difficult to circumscribe the theoretical areas precisely. The ACM's Special Interest Group on Algorithms and Computation Theory...

public key. Traditionally, secure encrypted communication between two parties required that they first exchange keys by some secure physical means, such as...

operations (e.g., RSA) are relatively expensive in terms of computational power. TLS provides a secure shortcut in the handshake mechanism to avoid these operations:...

cryptographic proof in which one party (the prover) proves to others (the verifiers) that a certain amount of a specific computational effort has been expended...

is a shared secret which was previously shared between the two parties using some secure channel before it needs to be used. To build a key from shared...

a secure multi-party computation problem introduced in 1982 by computer scientist and computational theorist Andrew Yao. The problem discusses two millionaires...