Martin Hirt

From MaRDI portal
Person:1976003

Available identifiers

zbMath Open hirt.martinMaRDI QIDQ1976003

List of research outcomes

PublicationDate of PublicationType
Efficient MPC with a Mixed Adversary2023-11-02Paper
On communication-efficient asynchronous MPC with adaptive security2023-04-13Paper
Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback2023-03-31Paper
Adaptive security of multi-party protocols, revisited2023-03-31Paper
Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)2017-09-29Paper
Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions2017-01-06Paper
Network-Hiding Communication and Applications to Multi-party Protocols2016-10-27Paper
Anonymous Authentication with Shared Secrets2015-09-17Paper
Optimally efficient multi-valued byzantine agreement2015-03-10Paper
On the theoretical gap between synchronous and asynchronous MPC protocols2015-03-02Paper
Multi-valued Byzantine Broadcast: The t < n Case2015-01-06Paper
Key-Indistinguishable Message Authentication Codes2014-10-14Paper
Broadcast Amplification2014-02-18Paper
Efficient General-Adversary Multi-Party Computation2013-12-10Paper
A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation2013-09-17Paper
On the Complexity of Broadcast Setup2013-08-06Paper
Resource-Restricted Indifferentiability2013-05-31Paper
Passive Corruption in Statistical Multi-Party Computation2012-11-06Paper
Player-Centric Byzantine Agreement2011-07-06Paper
Graceful Degradation in Multi-Party Computation (Extended Abstract)2011-05-19Paper
Receipt-Free K-out-of-L Voting Based on ElGamal Encryption2010-06-17Paper
Adaptively Secure Broadcast2010-06-01Paper
MPC vs. SFE : Unconditional and Computational Security2009-02-10Paper
Asynchronous Multi-Party Computation with Quadratic Communication2008-08-19Paper
Simple and Efficient Perfectly-Secure Asynchronous MPC2008-05-15Paper
Efficient Byzantine Agreement with Faulty Minority2008-05-15Paper
Cryptographic Asynchronous Multi-party Computation with Optimal Resilience2008-05-06Paper
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation2008-03-18Paper
Perfectly-Secure MPC with Linear Communication Complexity2008-03-05Paper
MPC vs. SFE: Perfect Security in a Unified Corruption Model2008-03-05Paper
Robust Multiparty Computation with Linear Communication Complexity2007-09-04Paper
Theory of Cryptography2007-02-12Paper
https://portal.mardi4nfdi.de/entity/Q33749362006-03-01Paper
https://portal.mardi4nfdi.de/entity/Q44348682003-11-26Paper
https://portal.mardi4nfdi.de/entity/Q47837212002-12-08Paper
Player simulation and general adversary structures in perfect multiparty computation2002-06-25Paper
https://portal.mardi4nfdi.de/entity/Q45025032002-01-27Paper
https://portal.mardi4nfdi.de/entity/Q27074112001-07-03Paper
https://portal.mardi4nfdi.de/entity/Q42493251999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42507701999-06-17Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Martin Hirt