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


Simple Three-Round Multiparty Schnorr Signing with Full Simulatability


Secure Multiparty Computation (MPC)


Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest


Fast Garbling of Circuits over 3-Valued Logic.

Privacy-Preserving Search of Similar Patients in Genomic Data.

Fast Large-Scale Honest-Majority MPC for Malicious Adversaries.

Fast Distributed RSA Key Generation for Semi-Honest and Malicious Adversaries

Generalizing the SPDZ Compiler For Other Protocols

An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants.

Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody.


More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries.

High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority.

Optimized Honest-Majority MPC for Malicious Adversaries – Breaking the 1 Billion-Gate Per Second Barrier.

Fast Secure Two-Party ECDSA Signing.

Better Bounds for Block Cipher Modes of Operation via Nonce-Based Key Derivation.

A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority.

Efficient Scalable Constant-Round MPC via Garbled Circuits.

Secure Two-Party Computation with Fairness – A Necessary Design Principle.


How To Simulate It – A Tutorial on the Simulation Proof Technique

Attribute-based Key Exchange with General Policies

Optimizing Semi-Honest Secure Multiparty Computation for the Internet

High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority

More Efficient Constant-Round Multi-Party Computation from BMR and SHE.


An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-Programmable Random Oracle

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries

Adaptively Secure Computation with Partial Erasures

A Simpler Variant of Universally Composable Security for Standard Multiparty Computation

Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ.

Fast Garbling of Circuits Under Standard Assumptions

GCM-SIV: Full Nonce Misuse-Resistant Authenticated Encryption at Under One Cycle per Byte

Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries


Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings

Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation.


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


Completeness for Symmetric Two-Party Functionalities – Revisited

SCAPI: The Secure Computation Application Programming Interface


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


Private Web Search with Malicious Adversaries


Secure Multiparty Computation for Privacy-Preserving Data Mining

Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer

Adaptively Secure Two-Party Computation with Erasures

Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1

Collusion-Free Multiparty Computation in the Mediated Model

Utility Dependence in Correct and Fair Rational Secret Sharing


Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries

Aggregate Message Authentication Codes

Legally Enforceable Fairness in Secure Two-Party Computation

Efficient Fully-Simulatable Oblivious Transfer

Complete Fairness in Secure Two-Party Computation

Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries

Constructions of Truly Practical Secure Protocols using Standard Smartcards


Concurrently-Secure Blind Signatures without Random Oracles or Setup Assumptions

Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries


Black-Box Constructions of Protocols for Secure Computation

Information-Theoretically Secure Protocols and Security Under Composition

On Achieving the “Best of Both Worlds” in Secure Multiparty Computation


Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs

Concurrent Composition of Secure Protocols in the Timing Model

Universally Composable Password-Based Key Exchange

Secure Computation Without Authentication


Lower Bounds for Concurrent Self Composition

Lower Bounds and Impossibility Results for Concurrent Self Composition

Protocol Initialization for the Framework of Universal Composability

A Proof of Security of Yao’s Protocol for Two-Party Computation


On the Composition of Secure Multi-Party Protocols

A Simpler Construction of CCA2-Secure Public-Key Encryption Under General Assumptions

A Framework for Password-Based Authenticated Key Exchange

On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions

Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions

Lower Bounds for Non-Black-Box Zero-Knowledge

General Composition and Universal Composability in Secure Multi-Party Computation


Strict Polynomial-Time in Simulation and Extraction

Universally Composable Two-Party and Multi-Party Secure Computation

On the Composition of Authenticated Byzantine Agreement

Sequential Composition of Protocols without Simultaneous Termination

Secure Computation Without Agreement


Session-Key Generation using Human Passwords Only

Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation

Resettably-Sound Zero-Knowledge and its Applications


Privacy Preserving Data Mining


A Statistical Theory for Quantitative Association Rules


Text Mining at the Term Level

TextVis: An Integrated Visual Environment for Text Mining

Skip to content