Author: Mina Doosti
-
Bit Commitment
Functionality Description Bit commitment is a fundamental cryptographic primitive between two parties that allows one party (the committer) to choose a bit (or more generally, a value), commit to it while keeping it hidden, and later reveal it to another party (the receiver) in a way that guarantees consistency. It acts like a sealed envelope:…
-
Coin Flipping
Functionality Description Coin flipping is a cryptographic primitive which allows two mistrustful parties, Alice and Bob, to remotely generate a random bit, such that none of the two parties can bias the outcome beyond a specified probability [1]. One can think of this functionality as agreeing on a coin flip over the phone. More explicitly,…
-
Byzantine Agreement
Functionality Description Byzantine agreement[1,2] is a classical problem concerned with reaching agreement on a single bit of data in a network of $n$ players, out of which $t$ players may be faulty. Each player starts with an input bit $b_{i}$ and the objective is that all non-faulty players output the same bit $d$ (agreement), under…
