Matthias Fitzi

According to our database1, Matthias Fitzi authored at least 34 papers between 1998 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
A New Way to Achieve Round-Efficient Byzantine Agreement.
IACR Cryptol. ePrint Arch., 2021

Fast Isomorphic State Channels.
Proceedings of the Financial Cryptography and Data Security, 2021

2020
Ledger Combiners for Fast Settlement.
IACR Cryptol. ePrint Arch., 2020

Proof-of-Stake Blockchain Protocols with Near-Optimal Throughput.
IACR Cryptol. ePrint Arch., 2020

Hydra: Fast Isomorphic State Channels.
IACR Cryptol. ePrint Arch., 2020

2018
Parallel Chains: Improving Throughput and Latency of Blockchain Protocols via Parallel Composition.
IACR Cryptol. ePrint Arch., 2018

2009
Tight Bounds for Protocols with Hybrid Security.
IACR Cryptol. ePrint Arch., 2009

On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

2008
On the Number of Synchronous Rounds Required for Byzantine Agreement.
IACR Cryptol. ePrint Arch., 2008

2007
MPC vs. SFE: Perfect Security in a Unified Corruption Model.
IACR Cryptol. ePrint Arch., 2007

Towards Optimal and Efficient Perfectly Secure Message Transmission.
Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

Secure Protocols with Asymmetric Trust.
Proceedings of the Advances in Cryptology, 2007

2006
Round-Optimal and Efficient Verifiable Secret Sharing.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Optimally efficient multi-valued byzantine agreement.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

On the Power of Imperfect Broadcast.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Minimal Complete Primitives for Secure Multi-Party Computation.
J. Cryptol., 2005

Byzantine Agreement Given Partial Broadcast.
J. Cryptol., 2005

How to Split a Shared Secret into Shared Bits in Constant-Round.
IACR Cryptol. ePrint Arch., 2005

Broadcast and secure computation under reduced setup assumptions.
Proceedings of the IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005

2004
Multi-party Computation with Hybrid Security.
Proceedings of the Advances in Cryptology, 2004

Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness.
Proceedings of the Advances in Cryptology, 2004

2003
Generalized communication and security models in Byzantine agreement.
PhD thesis, 2003

Efficient player-optimal protocols for strong and differential consensus.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Two-Threshold Broadcast and Detectable Multi-party Computation.
Proceedings of the Advances in Cryptology, 2003

2002
Extended Validity and Consistency in Byzantine Agreement.
IACR Cryptol. ePrint Arch., 2002

Efficient and Player-Optimal Strong Consensus.
IACR Cryptol. ePrint Arch., 2002

Detectable byzantine agreement secure against faulty majorities.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch.
Proceedings of the Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28, 2002

2000
From partial consistency to global broadcast.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999
Byzantine Agreement Secure against General Adversaries in the Dual Failure Model.
Proceedings of the Distributed Computing, 1999

General Adversaries in Unconditional Multi-party Computation.
Proceedings of the Advances in Cryptology, 1999

1998
Efficient Byzantine Agreement Secure Against General Adversaries.
Proceedings of the Distributed Computing, 12th International Symposium, 1998

Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract).
Proceedings of the Advances in Cryptology, 1998


  Loading...