We construct the first UC commitment scheme for binary strings with the optimal properties of
rate approaching 1 and linear time complexity (in the amortised sense, using a small …

We present a new multiparty computation protocol secure against a static and malicious
dishonest majority. Unlike most previous protocols that were based on working on MAC-ed …

Homomorphic universally composable (UC) commitments allow for the sender to reveal the
result of additions and multiplications of values contained in commitments without revealing …

Coin tossing is a fundamental concept in probability theory, often used as a practical
example to illustrate principles of randomness, simulation, and probabilistic inference. This …

Commitment schemes are a fundamental primitive in modern cryptography, serving as a
building block for a myriad of complex protocols and applications. Universally composable …

Secure two-party computation is a general cryptographic functionality that allows two parties
to interact as if intermediated by a trusted third party [Gol04 Gol04]. A canonical example is …