We stand with Ukraine

We stand with Ukraine

Matthias Fitzi

According to our database¹, Matthias Fitzi authored at least 38 papers between 1998 and 2022.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2022

FairTraDEX: A Decentralised Exchange Preventing Value Extraction.

[BibT_eX]

[DOI]

Conor McMenamin

,

,

IACR Cryptol. ePrint Arch., 2022

Minotaur: Multi-Resource Blockchain Consensus.

[BibT_eX]

[DOI]

,

,

,

Aggelos Kiayias

,

Nikos Leonardos

,

Pramod Viswanath

,

IACR Cryptol. ePrint Arch., 2022

FairTraDEX: A Decentralised Exchange Preventing Value Extraction.

[BibT_eX]

[DOI]

Conor McMenamin

,

,

,

Padraic O'Donoghue

Proceedings of the 2022 ACM CCS Workshop on Decentralized Finance and Security, 2022

2021

A New Way to Achieve Round-Efficient Byzantine Agreement.

[BibT_eX]

[DOI]

,

Chen-Da Liu-Zhang

,

IACR Cryptol. ePrint Arch., 2021

Ofelimos: Combinatorial Optimization via Proof-of-Useful-Work \\ A Provably Secure Blockchain Protocol.

[BibT_eX]

[DOI]

,

Aggelos Kiayias

,

Giorgos Panagiotakos

,

Alexander Russell

IACR Cryptol. ePrint Arch., 2021

Fast Isomorphic State Channels.

[BibT_eX]

[DOI]

Manuel M. T. Chakravarty

,

,

,

,

,

Aggelos Kiayias

,

Alexander Russell

Proceedings of the Financial Cryptography and Data Security, 2021

2020

Ledger Combiners for Fast Settlement.

[BibT_eX]

[DOI]

,

,

Aggelos Kiayias

,

Alexander Russell

IACR Cryptol. ePrint Arch., 2020

Proof-of-Stake Blockchain Protocols with Near-Optimal Throughput.

[BibT_eX]

[DOI]

,

,

Aggelos Kiayias

,

Alexander Russell

IACR Cryptol. ePrint Arch., 2020

Hydra: Fast Isomorphic State Channels.

[BibT_eX]

[DOI]

Manuel M. T. Chakravarty

,

,

,

,

,

Aggelos Kiayias

,

Alexander Russell

IACR Cryptol. ePrint Arch., 2020

2018

Parallel Chains: Improving Throughput and Latency of Blockchain Protocols via Parallel Composition.

[BibT_eX]

[DOI]

,

,

Aggelos Kiayias

,

Alexander Russell

IACR Cryptol. ePrint Arch., 2018

2009

Tight Bounds for Protocols with Hybrid Security.

[BibT_eX]

[DOI]

,

IACR Cryptol. ePrint Arch., 2009

On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement.

[BibT_eX]

[DOI]

,

Jesper Buus Nielsen

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

2008

On the Number of Synchronous Rounds Required for Byzantine Agreement.

[BibT_eX]

[DOI]

,

Jesper Buus Nielsen

IACR Cryptol. ePrint Arch., 2008

2007

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

[BibT_eX]

[DOI]

Zuzana Beerliová-Trubíniová

,

,

,

,

IACR Cryptol. ePrint Arch., 2007

Towards Optimal and Efficient Perfectly Secure Message Transmission.

[BibT_eX]

[DOI]

,

Matthew K. Franklin

,

,

Harsha Vardhan Simhadri

Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

Secure Protocols with Asymmetric Trust.

[BibT_eX]

[DOI]

,

,

,

Jesper Buus Nielsen

Proceedings of the Advances in Cryptology, 2007

2006

Round-Optimal and Efficient Verifiable Secret Sharing.

[BibT_eX]

[DOI]

,

,

Shyamnath Gollakota

,

C. Pandu Rangan

,

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.

[BibT_eX]

[DOI]

,

,

,

Jesper Buus Nielsen

,

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

Optimally efficient multi-valued byzantine agreement.

[BibT_eX]

[DOI]

,

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

On the Power of Imperfect Broadcast.

[BibT_eX]

[DOI]

,

,

Jürg Wullschleger

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

Minimal Complete Primitives for Secure Multi-Party Computation.

[BibT_eX]

[DOI]

,

,

,

Rafail Ostrovsky

J. Cryptol., 2005

Byzantine Agreement Given Partial Broadcast.

[BibT_eX]

[DOI]

Jeffrey Considine

,

,

Matthew K. Franklin

,

Leonid A. Levin

,

,

J. Cryptol., 2005

How to Split a Shared Secret into Shared Bits in Constant-Round.

[BibT_eX]

[DOI]

,

,

Jesper Buus Nielsen

,

IACR Cryptol. ePrint Arch., 2005

Broadcast and secure computation under reduced setup assumptions.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005

2004

Multi-party Computation with Hybrid Security.

[BibT_eX]

[DOI]

,

Thomas Holenstein

,

Jürg Wullschleger

Proceedings of the Advances in Cryptology, 2004

Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness.

[BibT_eX]

[DOI]

,

,

Jürg Wullschleger

Proceedings of the Advances in Cryptology, 2004

2003

Generalized communication and security models in Byzantine agreement.

[BibT_eX]

[DOI]

PhD thesis, 2003

Efficient player-optimal protocols for strong and differential consensus.

[BibT_eX]

[DOI]

,

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Two-Threshold Broadcast and Detectable Multi-party Computation.

[BibT_eX]

[DOI]

,

,

Thomas Holenstein

,

Jürg Wullschleger

Proceedings of the Advances in Cryptology, 2003

2002

Extended Validity and Consistency in Byzantine Agreement.

[BibT_eX]

[DOI]

,

,

Thomas Holenstein

,

Jürg Wullschleger

IACR Cryptol. ePrint Arch., 2002

Efficient and Player-Optimal Strong Consensus.

[BibT_eX]

[DOI]

,

IACR Cryptol. ePrint Arch., 2002

Detectable byzantine agreement secure against faulty majorities.

[BibT_eX]

[DOI]

,

Daniel Gottesman

,

,

Thomas Holenstein

,

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.

[BibT_eX]

[DOI]

,

,

,

Oliver von Rotz

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.

[BibT_eX]

[DOI]

,

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.

[BibT_eX]

[DOI]

,

,

Proceedings of the Distributed Computing, 1999

General Adversaries in Unconditional Multi-party Computation.

[BibT_eX]

[DOI]

,

,

Proceedings of the Advances in Cryptology, 1999

1998

Efficient Byzantine Agreement Secure Against General Adversaries.

[BibT_eX]

[DOI]

,

Proceedings of the Distributed Computing, 12th International Symposium, 1998

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

[BibT_eX]

[DOI]

,

,

Proceedings of the Advances in Cryptology, 1998

Loading...