The following pages link to Martin Hirt (Q1976003):
Displaying 40 items.
- Player simulation and general adversary structures in perfect multiparty computation (Q1976004) (← links)
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback (Q2695652) (← links)
- Adaptive security of multi-party protocols, revisited (Q2695654) (← links)
- On communication-efficient asynchronous MPC with adaptive security (Q2697849) (← links)
- (Q2707411) (← links)
- Network-Hiding Communication and Applications to Multi-party Protocols (Q2829220) (← links)
- A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation (Q2849397) (← links)
- Efficient General-Adversary Multi-Party Computation (Q2867152) (← links)
- Key-Indistinguishable Message Authentication Codes (Q2922676) (← links)
- Multi-valued Byzantine Broadcast: The t < n Case (Q2936623) (← links)
- Anonymous Authentication with Shared Secrets (Q2946477) (← links)
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions (Q2953803) (← links)
- Graceful Degradation in Multi-Party Computation (Extended Abstract) (Q3002112) (← links)
- Player-Centric Byzantine Agreement (Q3012813) (← links)
- (Q3374936) (← links)
- Simple and Efficient Perfectly-Secure Asynchronous MPC (Q3498387) (← links)
- Efficient Byzantine Agreement with Faulty Minority (Q3498389) (← links)
- Asynchronous Multi-Party Computation with Quadratic Communication (Q3519524) (← links)
- Adaptively Secure Broadcast (Q3563851) (← links)
- Receipt-Free K-out-of-L Voting Based on ElGamal Encryption (Q3569102) (← links)
- MPC vs. SFE : Unconditional and Computational Security (Q3600361) (← links)
- (Q4249325) (← links)
- (Q4250770) (← links)
- (Q4434868) (← links)
- (Q4502503) (← links)
- (Q4783721) (← links)
- Resource-Restricted Indifferentiability (Q4924438) (← links)
- On the theoretical gap between synchronous and asynchronous MPC protocols (Q5176200) (← links)
- Optimally efficient multi-valued byzantine agreement (Q5177277) (← links)
- Passive Corruption in Statistical Multi-Party Computation (Q5200459) (← links)
- On the Complexity of Broadcast Setup (Q5326591) (← links)
- Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract) (Q5361463) (← links)
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience (Q5385737) (← links)
- Perfectly-Secure MPC with Linear Communication Complexity (Q5445508) (← links)
- MPC vs. SFE: Perfect Security in a Unified Corruption Model (Q5445509) (← links)
- Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation (Q5451065) (← links)
- Broadcast Amplification (Q5746347) (← links)
- Robust Multiparty Computation with Linear Communication Complexity (Q5756628) (← links)
- Theory of Cryptography (Q5898361) (← links)
- Efficient MPC with a Mixed Adversary (Q6059357) (← links)
