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

Techniques for Efficient Secure Computation Based on Yao’s Protocol.

A Note on Constant-Round Zero-Knowledge Proofs of Knowledge.

A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness

On the Feasibility of Extending Oblivious Transfer

Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries

More Efficient Oblivious Transfer and Extensions for Faster Secure Computation

Fair and Efficient Secure Multiparty Computation with Reputation Systems

Hiding the Input-Size in Secure Two-Party Computation

Skip to content