Credit networks model transitive trust (or credit) between users in a distributed environment
and have recently seen a rapid increase of popularity due to their flexible design and …

Classical results on secure multi-party computation (MPC) imply that fully secure
computation, including fairness (either all parties get output or none) and robustness (output …

Consider encrypting n inputs under n independent public keys. Given the ciphertexts {c_i=
Enc _ pk _i (x_i)\} _i, Alice outputs ciphertexts c'_1, ..., c'_n that decrypt to y_1, ..., y_n …

We present a new non-malleable commitment protocol. Our protocol has the following
features: itemize The protocol has only three rounds of interaction. Pass (TCC 2013) showed …

Garbled circuits provide a powerful tool for jointly evaluating functions while preserving the
privacy of each user's inputs. While recent research has made the use of this primitive more …

Proof systems for verifiable computation (VC) have the potential to make cloud outsourcing
more trustworthy. Recent schemes enable a verifier with limited resources to delegate large …

We revisit the exact round complexity of secure computation in the multi-party and two-party
settings. For the special case of two-parties without a simultaneous message exchange …

Abstract Ishai, Kushilevitz, Ostrovsky and Sahai (STOC 2007, SIAM JoC 2009) introduced
the powerful “MPC-in-the-head” technique that provided a general transformation of …

When analyzing the round complexity of multi-party computation (MPC), one often overlooks
the fact that underlying resources, such as a broadcast channel, can by themselves be …

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 …