The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jörn Müller-Quade: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jörn Müller-Quade, Thomas Beth
    Calculating Generators for Invariant Fields of Linear Algebraic Groups. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:392-403 [Conf]
  2. Anderson C. A. Nascimento, Akira Otsuka, Hideki Imai, Jörn Müller-Quade
    Unconditionally Secure Homomorphic Pre-distributed Commitments. [Citation Graph (0, 0)][DBLP]
    AAECC, 2003, pp:87-97 [Conf]
  3. Goichiro Hanaoka, Hideki Imai, Jörn Müller-Quade, Anderson C. A. Nascimento, Akira Otsuka, Andreas Winter
    Information Theoretically Secure Oblivious Polynomial Evaluation: Model, Bounds, and Constructions. [Citation Graph (0, 0)][DBLP]
    ACISP, 2004, pp:62-73 [Conf]
  4. Anderson C. A. Nascimento, Jörn Müller-Quade, Akira Otsuka, Goichiro Hanaoka, Hideki Imai
    Unconditionally Non-interactive Verifiable Secret Sharing Secure against Faulty Majorities in the Commodity Based Model. [Citation Graph (0, 0)][DBLP]
    ACNS, 2004, pp:355-368 [Conf]
  5. Michael Backes, Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh
    On fairness in simulatability-based cryptographic systems. [Citation Graph (0, 0)][DBLP]
    FMSE, 2005, pp:13-22 [Conf]
  6. Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh
    Polynomial Runtime in Simulatability Definitions. [Citation Graph (0, 0)][DBLP]
    CSFW, 2005, pp:156-169 [Conf]
  7. Anderson C. A. Nascimento, Jörn Müller-Quade, Hideki Imai
    Bit String Commitment Reductions with a Non-zero Rate. [Citation Graph (0, 0)][DBLP]
    CT-RSA, 2004, pp:179-193 [Conf]
  8. Dennis Hofheinz, Jörn Müller-Quade, Rainer Steinwandt
    Initiator-Resilient Universally Composable Key Exchange. [Citation Graph (0, 0)][DBLP]
    ESORICS, 2003, pp:61-84 [Conf]
  9. Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh
    On the (Im-)Possibility of Extending Coin Toss. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2006, pp:504-521 [Conf]
  10. Jens-Matthias Bohli, Jörn Müller-Quade, Stefan Röhrich
    Fairness and Correctness in Case of a Premature Abort. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2005, pp:322-331 [Conf]
  11. Jörn Müller-Quade, Martin Rötteler
    Deciding Linear Disjointness of Finitely Generated Fields. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1998, pp:153-160 [Conf]
  12. Anderson C. A. Nascimento, Jörn Müller-Quade, Akira Otsuka, Goichiro Hanaoka, Hideki Imai
    Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations. [Citation Graph (0, 0)][DBLP]
    ISC, 2003, pp:151-164 [Conf]
  13. Dominik Raub, Rainer Steinwandt, Jörn Müller-Quade
    On the Security and Composability of the One Time Pad. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2005, pp:288-297 [Conf]
  14. Michael Backes, Jörn Müller-Quade, Dominique Unruh
    On the Necessity of Rewinding in Secure Multiparty Computation. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:157-173 [Conf]
  15. Jörn Müller-Quade, Dominique Unruh
    Long-Term Security and Universal Composability. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:41-60 [Conf]
  16. Dennis Hofheinz, Jörn Müller-Quade
    Universally Composable Commitments Using Random Oracles. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:58-76 [Conf]
  17. Jörn Müller-Quade, Rainer Steinwandt
    Recognizing Simple Subextensions of Purely Transcendental Field Extensions. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2000, v:11, n:1, pp:35-41 [Journal]
  18. Martin Rötteler, Jörn Müller-Quade
    Separation of Orbits under Group Actions with an Application to Quantum Systems. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2000, v:10, n:4/5, pp:279-303 [Journal]
  19. Jörn Müller-Quade, Hideki Imai
    Anonymous Oblivious Transfer [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  20. Jörn Müller-Quade, Hideki Imai
    More Robust Multiparty Protocols with Oblivious Transfer [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  21. Willi Geiselmann, Jörn Müller-Quade, Rainer Steinwandt, Thomas Beth
    Über Quantencomputer und Quantenkryptographie. [Citation Graph (0, 0)][DBLP]
    Datenschutz und Datensicherheit, 2002, v:26, n:8, pp:- [Journal]
  22. Dominik Janzing, Jörn Müller-Quade
    Guest editorial. [Citation Graph (0, 0)][DBLP]
    Inform., Forsch. Entwickl., 2006, v:21, n:1-2, pp:1-2 [Journal]
  23. Jörn Müller-Quade
    Quantum cryptography beyond key exchange. [Citation Graph (0, 0)][DBLP]
    Inform., Forsch. Entwickl., 2006, v:21, n:1-2, pp:39-54 [Journal]
  24. Thomas Beth, Jörn Müller-Quade, Rainer Steinwandt
    Computing restrictions of ideals in finitely generated k-algebras by means of Buchberger's algorithm. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2006, v:41, n:3-4, pp:372-380 [Journal]
  25. Jörn Müller-Quade, Rainer Steinwandt
    Gröbner Bases Applied to Finitely Generated Field Extensions. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2000, v:30, n:4, pp:469-490 [Journal]
  26. Jörn Müller-Quade, Rainer Steinwandt
    Basic Algorithms for Rational Function Fields. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1999, v:27, n:2, pp:143-170 [Journal]
  27. Willi Geiselmann, Jörn Müller-Quade, Rainer Steinwandt
    On "A New Representation of Elements of Finite Fields GF (2m) Yielding Small Complexity Arithmetic Circuits". [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2002, v:51, n:12, pp:1460-1461 [Journal]

  28. Universally Composable Incoercibility. [Citation Graph (, )][DBLP]


  29. A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model. [Citation Graph (, )][DBLP]


  30. Privacy-Aware Folksonomies. [Citation Graph (, )][DBLP]


  31. Brief Announcement: Towards Secure Cloud Computing. [Citation Graph (, )][DBLP]


  32. Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security. [Citation Graph (, )][DBLP]


  33. Bingo Voting: Secure and Coercion-Free Voting Using a Trusted Random Number Generator. [Citation Graph (, )][DBLP]


  34. Oblivious Transfer Based on the McEliece Assumptions. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.008secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002