| 2009 |
| 33 | EE | Rafael Dowsley,
Jörn Müller-Quade,
Anderson C. A. Nascimento:
A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model.
CT-RSA 2009: 240-251 |
| 32 | EE | Robin Künzler,
Jörn Müller-Quade,
Dominik Raub:
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security.
TCC 2009: 238-255 |
| 2008 |
| 31 | | Jacques Calmet,
Willi Geiselmann,
Jörn Müller-Quade:
Mathematical Methods in Computer Science, MMICS 2008, Karlsruhe, Germany, December 17-19, 2008 - Essays in Memory of Thomas Beth
Springer 2008 |
| 30 | EE | Rafael Dowsley,
Jeroen van de Graaf,
Jörn Müller-Quade,
Anderson C. A. Nascimento:
Oblivious Transfer Based on the McEliece Assumptions.
ICITS 2008: 107-117 |
| 2007 |
| 29 | EE | Michael Backes,
Jörn Müller-Quade,
Dominique Unruh:
On the Necessity of Rewinding in Secure Multiparty Computation.
TCC 2007: 157-173 |
| 28 | EE | Jörn Müller-Quade,
Dominique Unruh:
Long-Term Security and Universal Composability.
TCC 2007: 41-60 |
| 27 | EE | Jens-Matthias Bohli,
Jörn Müller-Quade,
Stefan Röhrich:
Bingo Voting: Secure and Coercion-Free Voting Using a Trusted Random Number Generator.
VOTE-ID 2007: 111-124 |
| 2006 |
| 26 | EE | Dennis Hofheinz,
Jörn Müller-Quade,
Dominique Unruh:
On the (Im-)Possibility of Extending Coin Toss.
EUROCRYPT 2006: 504-521 |
| 25 | EE | Dominik Janzing,
Jörn Müller-Quade:
Guest editorial.
Inform., Forsch. Entwickl. 21(1-2): 1-2 (2006) |
| 24 | EE | Jörn Müller-Quade:
Quantum cryptography beyond key exchange.
Inform., Forsch. Entwickl. 21(1-2): 39-54 (2006) |
| 23 | EE | Thomas Beth,
Jörn Müller-Quade,
Rainer Steinwandt:
Computing restrictions of ideals in finitely generated k-algebras by means of Buchberger's algorithm.
J. Symb. Comput. 41(3-4): 372-380 (2006) |
| 2005 |
| 22 | EE | Dennis Hofheinz,
Jörn Müller-Quade,
Dominique Unruh:
Polynomial Runtime in Simulatability Definitions.
CSFW 2005: 156-169 |
| 21 | EE | Michael Backes,
Dennis Hofheinz,
Jörn Müller-Quade,
Dominique Unruh:
On fairness in simulatability-based cryptographic systems.
FMSE 2005: 13-22 |
| 20 | EE | Jens-Matthias Bohli,
Jörn Müller-Quade,
Stefan Röhrich:
Fairness and Correctness in Case of a Premature Abort.
INDOCRYPT 2005: 322-331 |
| 19 | EE | Dominik Raub,
Rainer Steinwandt,
Jörn Müller-Quade:
On the Security and Composability of the One Time Pad.
SOFSEM 2005: 288-297 |
| 2004 |
| 18 | EE | 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.
ACISP 2004: 62-73 |
| 17 | EE | 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.
ACNS 2004: 355-368 |
| 16 | EE | Anderson C. A. Nascimento,
Jörn Müller-Quade,
Hideki Imai:
Bit String Commitment Reductions with a Non-zero Rate.
CT-RSA 2004: 179-193 |
| 15 | EE | Dennis Hofheinz,
Jörn Müller-Quade:
Universally Composable Commitments Using Random Oracles.
TCC 2004: 58-76 |
| 2003 |
| 14 | EE | Anderson C. A. Nascimento,
Akira Otsuka,
Hideki Imai,
Jörn Müller-Quade:
Unconditionally Secure Homomorphic Pre-distributed Commitments.
AAECC 2003: 87-97 |
| 13 | EE | Dennis Hofheinz,
Jörn Müller-Quade,
Rainer Steinwandt:
Initiator-Resilient Universally Composable Key Exchange.
ESORICS 2003: 61-84 |
| 12 | EE | 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.
ISC 2003: 151-164 |
| 2002 |
| 11 | | Willi Geiselmann,
Jörn Müller-Quade,
Rainer Steinwandt,
Thomas Beth:
Über Quantencomputer und Quantenkryptographie.
Datenschutz und Datensicherheit 26(8): (2002) |
| 10 | EE | 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".
IEEE Trans. Computers 51(12): 1460-1461 (2002) |
| 2001 |
| 9 | EE | Jörn Müller-Quade,
Hideki Imai:
More Robust Multiparty Protocols with Oblivious Transfer
CoRR cs.CR/0101020: (2001) |
| 8 | EE | Anderson C. A. Nascimento,
Jörn Müller-Quade,
Hideki Imai:
Quantum Identification Protocol with Technologically Bounded Parties.
Electronic Notes in Discrete Mathematics 6: 15-24 (2001) |
| 2000 |
| 7 | EE | Martin Rötteler,
Jörn Müller-Quade:
Separation of Orbits under Group Actions with an Application to Quantum Systems.
Appl. Algebra Eng. Commun. Comput. 10(4/5): 279-303 (2000) |
| 6 | EE | Jörn Müller-Quade,
Rainer Steinwandt:
Recognizing Simple Subextensions of Purely Transcendental Field Extensions.
Appl. Algebra Eng. Commun. Comput. 11(1): 35-41 (2000) |
| 5 | EE | Jörn Müller-Quade,
Hideki Imai:
Anonymous Oblivious Transfer
CoRR cs.CR/0011004: (2000) |
| 4 | | Jörn Müller-Quade,
Rainer Steinwandt:
Gröbner Bases Applied to Finitely Generated Field Extensions.
J. Symb. Comput. 30(4): 469-490 (2000) |
| 1999 |
| 3 | | Jörn Müller-Quade,
Thomas Beth:
Calculating Generators for Invariant Fields of Linear Algebraic Groups.
AAECC 1999: 392-403 |
| 2 | | Jörn Müller-Quade,
Rainer Steinwandt:
Basic Algorithms for Rational Function Fields.
J. Symb. Comput. 27(2): 143-170 (1999) |
| 1998 |
| 1 | EE | Jörn Müller-Quade,
Martin Rötteler:
Deciding Linear Disjointness of Finitely Generated Fields.
ISSAC 1998: 153-160 |