The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Matthias Fitzi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Matthias Fitzi, Martin Hirt, Ueli M. Maurer
    General Adversaries in Unconditional Multi-party Computation. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1999, pp:232-246 [Conf]
  2. Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky
    Minimal Complete Primitives for Secure Multi-party Computation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2001, pp:80-100 [Conf]
  3. Matthias Fitzi, Martin Hirt, Ueli M. Maurer
    Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1998, pp:121-136 [Conf]
  4. Matthias Fitzi, Stefan Wolf, Jürg Wullschleger
    Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:562-578 [Conf]
  5. Matthias Fitzi, Nicolas Gisin, Ueli M. Maurer, Oliver von Rotz
    Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2002, pp:482-501 [Conf]
  6. Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger
    Two-Threshold Broadcast and Detectable Multi-party Computation. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:51-67 [Conf]
  7. Matthias Fitzi, Thomas Holenstein, Jürg Wullschleger
    Multi-party Computation with Hybrid Security. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2004, pp:419-438 [Conf]
  8. Matthias Fitzi, Juan A. Garay
    Efficient player-optimal protocols for strong and differential consensus. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:211-220 [Conf]
  9. Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam Smith
    Detectable byzantine agreement secure against faulty majorities. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:118-126 [Conf]
  10. Matthias Fitzi, Martin Hirt
    Optimally efficient multi-valued byzantine agreement. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:163-168 [Conf]
  11. Matthias Fitzi, Ueli M. Maurer
    From partial consistency to global broadcast. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:494-503 [Conf]
  12. Matthias Fitzi, Matthew K. Franklin, Juan A. Garay, S. Harsha Vardhan
    Towards Optimal and Efficient Perfectly Secure Message Transmission. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:311-322 [Conf]
  13. Ivan Damgård, Matthias Fitzi, Eike Kiltz, Jesper Buus Nielsen, Tomas Toft
    Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:285-304 [Conf]
  14. Matthias Fitzi, Juan A. Garay, Shyamnath Gollakota, C. Pandu Rangan, K. Srinathan
    Round-Optimal and Efficient Verifiable Secret Sharing. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:329-342 [Conf]
  15. Bernd Altmann, Matthias Fitzi, Ueli M. Maurer
    Byzantine Agreement Secure against General Adversaries in the Dual Failure Model. [Citation Graph (0, 0)][DBLP]
    DISC, 1999, pp:123-137 [Conf]
  16. Matthias Fitzi, Ueli M. Maurer
    Efficient Byzantine Agreement Secure Against General Adversaries. [Citation Graph (0, 0)][DBLP]
    DISC, 1998, pp:134-148 [Conf]
  17. Jeffrey Considine, Matthias Fitzi, Matthew K. Franklin, Leonid A. Levin, Ueli M. Maurer, David Metcalf
    Byzantine Agreement Given Partial Broadcast. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2005, v:18, n:3, pp:191-217 [Journal]
  18. Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky
    Minimal Complete Primitives for Secure Multi-Party Computation. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2005, v:18, n:1, pp:37-61 [Journal]
  19. Ivan Damgård, Yvo Desmedt, Matthias Fitzi, Jesper Buus Nielsen
    Secure Protocols with Asymmetric Trust. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2007, pp:357-375 [Conf]

  20. MPC vs. SFE: Perfect Security in a Unified Corruption Model. [Citation Graph (, )][DBLP]


  21. On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement. [Citation Graph (, )][DBLP]


Search in 0.064secs, Finished in 0.065secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002