Martin Hirt

IACR Cryptol. ePrint Arch., 2021

Round-Efficient Byzantine Agreement and Multi-Party Computation with Asynchronous Fallback.

[BibT_eX]

[DOI]

Giovanni Deligios

IACR Cryptol. ePrint Arch., 2021

On Communication-Efficient Asynchronous MPC with Adaptive Security.

[BibT_eX]

[DOI]

Annick Chopard

IACR Cryptol. ePrint Arch., 2021

2020

Efficient MPC with a Mixed Adversary.

[BibT_eX]

[DOI]

Marta Mularczyk

IACR Cryptol. ePrint Arch., 2020

Multi-Threshold Asynchronous Reliable Broadcast and Consensus.

[BibT_eX]

[DOI]

Ard Kastrati

IACR Cryptol. ePrint Arch., 2020

From Partial to Global Asynchronous Reliable Broadcast.

[BibT_eX]

[DOI]

Diana Ghinea

IACR Cryptol. ePrint Arch., 2020

Brief Announcement: Multi-Threshold Asynchronous Reliable Broadcast and Consensus.

[BibT_eX]

[DOI]

Ard Kastrati

Proceedings of the 34th International Symposium on Distributed Computing, 2020

2018

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

2016

Network-Hiding Communication and Applications to Multi-Party Protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Constant-Round Asynchronous Multi-Party Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2014

Key-Indistinguishable Message Authentication Codes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Anonymous Authentication with Shared Secrets.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

2013

Efficient General-Adversary Multi-Party Computation.

[BibT_eX]

[DOI]

Daniel Tschudi

IACR Cryptol. ePrint Arch., 2013

Multi-Valued Byzantine Broadcast: the t<n Case.

[BibT_eX]

[DOI]

Pavel Raykov

IACR Cryptol. ePrint Arch., 2013

On the Complexity of Broadcast Setup.

[BibT_eX]

[DOI]

Pavel Raykov

IACR Cryptol. ePrint Arch., 2013

Broadcast Amplification.

[BibT_eX]

[DOI]

Pavel Raykov

IACR Cryptol. ePrint Arch., 2013

A Dynamic Tradeoff Between Active and Passive Corruptions in Secure Multi-Party Computation.

[BibT_eX]

[DOI]

Christoph Lucas

IACR Cryptol. ePrint Arch., 2013

Asynchronous Multiparty Computation with Linear Communication Complexity.

[BibT_eX]

[DOI]

Ashish Choudhury

Arpita Patra

Proceedings of the Distributed Computing - 27th International Symposium, 2013

Erratum: A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation.

[BibT_eX]

[DOI]

Christoph Lucas

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012

Passive Corruption in Statistical Multi-Party Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Resource-Restricted Indifferentiability.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Unconditionally Secure Asynchronous Multiparty Computation with Linear Communication Complexity.

[BibT_eX]

[DOI]

Ashish Choudhury

Arpita Patra

IACR Cryptol. ePrint Arch., 2012

Passive Corruption in Statistical Multi-Party Computation - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security - 6th International Conference, 2012

2011

Graceful Degradation in Multi-Party Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Graceful Degradation in Multi-Party Computation (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security - 5th International Conference, 2011

Player-Centric Byzantine Agreement.

[BibT_eX]

[DOI]

Vassilis Zikas

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

Receipt-Free <i>K</i>-out-of-<i>L</i> Voting Based on ElGamal Encryption.

[BibT_eX]

[DOI]

Proceedings of the Towards Trustworthy Elections, New Directions in Electronic Voting, 2010

On the theoretical gap between synchronous and asynchronous MPC protocols.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009

Adaptively Secure Broadcast.

[BibT_eX]

[DOI]

Vassilis Zikas

IACR Cryptol. ePrint Arch., 2009

2008

Almost-Asynchronous MPC with Faulty Minority.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Perfectly-Secure MPC with Linear Communication Complexity.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Asynchronous Multi-Party Computation with Quadratic Communication.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

MPC vs. SFE : Unconditional and Computational Security.

[BibT_eX]

[DOI]

Vassilis Zikas

Proceedings of the Advances in Cryptology, 2008

2007

MPC vs. SFE: Perfect Security in a Unified Corruption Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

Efficient Byzantine Agreement with Faulty Minority.

[BibT_eX]

[DOI]

Micha Riser

Proceedings of the Advances in Cryptology, 2007

Simple and Efficient Perfectly-Secure Asynchronous MPC.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

2006

Efficient Multi-party Computation with Dispute Control.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Optimally efficient multi-valued byzantine agreement.

[BibT_eX]

[DOI]

Matthias Fitzi

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Robust Multiparty Computation with Linear Communication Complexity.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2006

2005

Cryptographic Asynchronous Multi-party Computation with Optimal Resilience (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

2004

Cryptographic Asynchronous Multi-Party Computation with Optimal Resilience.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

2003

Two-Threshold Broadcast and Detectable Multi-party Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2003

2002

Extended Validity and Consistency in Byzantine Agreement.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2002

Detectable byzantine agreement secure against faulty majorities.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

2001

Multi party computation: efficient protocols, general adversaries, and voting.

[BibT_eX]

[DOI]

PhD thesis, 2001

Robustness for Free in Unconditional Multi-Party Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2001

2000

Player Simulation and General Adversary Structures in Perfect Multiparty Computation.

[BibT_eX]

[DOI]

J. Cryptol., 2000

Efficient Receipt-Free Voting Based on Homomorphic Encryption.

[BibT_eX]

[DOI]

Kazue Sako

Proceedings of the Advances in Cryptology, 2000

Efficient Secure Multi-party Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2000

1999

Efficient Multiparty Computations Secure Against an Adaptive Adversary.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1999

General Adversaries in Unconditional Multi-party Computation.

[BibT_eX]

[DOI]

Matthias Fitzi

Proceedings of the Advances in Cryptology, 1999

1998

Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract).

[BibT_eX]

[DOI]

Matthias Fitzi

Proceedings of the Advances in Cryptology, 1998

1997

Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation (Extended Abstract).

[BibT_eX]

[DOI]