Note: the order of the papers here is according to the year of the conference in which the paper was presented.

Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs

On the Black-Box Complexity of Optimally-Fair Coin Tossing

Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer

Highly-Efficient Universally Composable Commitments based on the DDH Assumption

A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation

1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds

Secure Computation on the Web: Computing without Simultaneous Interaction

Perfectly-Secure Multiplication for any t<n/3

The IPS Compiler: Optimizations, Variants and Concrete Efficiency

Skip to content