Hirt, Martin - Institut für Theoretische Informatik, Eidgenössische Technische Hochschule Zürich (ETHZ)

• Complete Characterization of Adversaries Tolerable in Secure MultiParty Computation
• Efficient Byzantine Agreement with Faulty Minority
• Upper Bounds on the Communication Complexity of Optimally Resilient
• Optimally Efficient MultiValued Byzantine Agreement Matthias Fitzi
• Efficient Multiparty Computations Secure Against an Adaptive Adversary
• Ecient Multi-Party Computation with Dispute Control ?
• Robustness for Free in Unconditional MultiParty Computation
• MPC vs. SFE : Unconditional and Computational Security #
• General Adversaries in Unconditional MultiParty Computation #
• Efficient Multi-Party Computation with Dispute Control
• Perfectly-Secure MPC with Linear Communication Complexity
• E#cient Secure MultiParty Computation # (Extended Abstract)
• Player Simulation and General Adversary Structures in Perfect Multiparty Computation \Lambda
• Simple and Ecient Perfectly-Secure Asynchronous MPC ?
• Ecient Byzantine Agreement with Faulty Minority ?
• MPC vs. SFE: Perfect Security in a Unified Corruption Model ?
• Perfectly-Secure MPC with Linear Communication Complexity ?
• E#cient Multiparty Computations Secure Against an Adaptive Adversary
• Asynchronous MultiParty Computation With Quadratic Communication
• Trading Correctness for Privacy in Unconditional MultiParty Computation #
• Cryptographic Asynchronous Multi-Party Computation with Optimal Resilience
• Asynchronous Multi-Party Computation With Quadratic Communication
• Trading Correctness for Privacy in Unconditional Multi-Party Computation
• MPC vs. SFE: Perfect Security in a Unified Corruption Model
• E#cient ReceiptFree Voting Based on Homomorphic Encryption
• ReceiptFree KoutofL Voting Based on ElGamal Encryption #
• Adaptively Secure Broadcast Martin Hirt and Vassilis Zikas
• Adaptively Secure Broadcast Martin Hirt and Vassilis Zikas
• Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation
• Detectable Byzantine Agreement Secure Against Faulty Matthias Fitzi Daniel Gottesman y Martin Hirt Thomas Holenstein
• MPC vs. SFE : Unconditional and Computational Security
• Detectable Byzantine Agreement Secure Against Faulty Matthias Fitzi
• Diss. ETH No. 14376 Multi-Party Computation
• On the Theoretical Gap Between Synchronous and Asynchronous MPC Protocols
• Receipt-Free K-out-of-L Voting Based on ElGamal Encryption
• On the Theoretical Gap Between Synchronous and Asynchronous MPC Protocols #
• Robust Multiparty Computation with Linear Communication Complexity
• General Adversaries in Unconditional Multi-Party Computation
• Robustness for Free in Unconditional Multi-Party Computation
• Graceful Degradation in Multi-Party Computation
• Graceful Degradation in MultiParty Computation
• Player-Centric Byzantine Agreement Martin Hirt1