Discover published sets by community

A cryptographic protocol that allows multiple parties to compute a function over their inputs while keeping those inputs private.

An encryption technique that allows secure computation of Boolean circuits via one-time tables representing the circuit's gates.

A method to distribute a secret amongst a group of participants, each of whom is allocated a share of the secret.

A cryptographic algorithm created by Adi Shamir that divides a secret into multiple parts, where a subset of parts can be used to reconstruct the secret.

An encryption method that allows computation on ciphertexts, generating an encrypted result which, when decrypted, matches the result of operations on the plaintexts.

A type of protocol where a sender transfers some of many possible pieces of information to a receiver, but remains oblivious to what piece has been transferred.

A cryptographic method by which one party can prove to another that a statement is true without revealing any information beyond the validity of the statement itself.

A protocol technique used in secure computation where one party creates multiple instances and the other party chooses some to inspect, ensuring honest behavior.

Precomputed values used in MPC protocols to perform multiplication on shared secrets without revealing those secrets.

An MPC protocol for secure two-party computation which uses garbled circuits and oblivious transfer.

An MPC protocol capable of secure multi-party computation over a Boolean circuit with any number of parties.

A form of homomorphic encryption that supports both addition and multiplication on ciphertexts, allowing for arbitrary computation on encrypted data.

A cryptographic primitive that allows a set of parties to secretly share a function instead of a specific value, enabling distributed computation.

In the context of MPC, it refers to the property that not only are the inputs kept secret, but the function computed is also not revealed.

An enhancement to secret sharing where the correctness of the distributed shares can be verified by other parties.

A guarantee of security that is not dependent on computational assumptions, but rather on information entropy.

Security based on the computational difficulty of solving certain problems, which remains secure as long as the problem is computationally infeasible.

Protocols that define how parties should interact and perform computations to ensure the security and privacy of the inputs.

A feature of MPC that ensures the secrecy of each participant's private inputs throughout the computation process.

The property that either all parties learn the result of the computation, or none do, ensuring no party has an advantage over others.

In certain contexts, it ensures that only authorized parties learn the result of the computation, while others only learn their respective outputs.

Ensures that the result of the MPC computation is correct and matches what would be obtained if a trusted third party performed the computation.

Proofs where the prover can convince the verifier without any interaction, typically using a pre-agreed protocol.

Cryptography where a certain threshold of participants is required to perform an operation, such as decrypting a message or generating a signature.

A system for publicly sharing information about a dataset by describing the patterns of groups within the dataset while withholding information about individuals in the dataset.

Defines the capabilities and limitations of an adversary in the context of analyzing the security of cryptographic protocols.

A cryptographic protocol whereby one party commits to a value while keeping it hidden, with the ability to reveal it later.

Communication channels that are protected by cryptographic methods to ensure confidentiality and integrity of the data being transmitted.