Jörn Müller-Quade

Nico Döttling, Thilo Mie, Jörn Müller-Quade, Tobias Nilges: Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens. TCC 2013: 642-661

Rafael Dowsley, Jeroen van de Graaf, Jörn Müller-Quade, Anderson C. A. Nascimento: Oblivious Transfer Based on the McEliece Assumptions. IEICE Transactions 95-A(2): 567-575 (2012)

Nico Döttling, Rafael Dowsley, Jörn Müller-Quade, Anderson C. A. Nascimento: A CCA2 Secure Variant of the McEliece Cryptosystem. IEEE Transactions on Information Theory 58(10): 6672-6680 (2012)

Nico Döttling, Jörn Müller-Quade, Anderson C. A. Nascimento: IND-CCA Secure Cryptography Based on a Variant of the LPN Problem. ASIACRYPT 2012: 485-503

Bernardo Machado David, Anderson C. A. Nascimento, Jörn Müller-Quade: Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions. ICITS 2012: 80-99

Nico Döttling, Daniel Kraschewski, Jörn Müller-Quade: Statistically Secure Linear-Rate Dimension Extension for Oblivious Affine Function Evaluation. ICITS 2012: 111-128

Nico Döttling, Rafael Dowsley, Jörn Müller-Quade, Anderson C. A. Nascimento: A CCA2 Secure Variant of the McEliece Cryptosystem. CoRR abs/1205.5224 (2012)

Nico Döttling, Daniel Kraschewski, Jörn Müller-Quade: David & Goliath Oblivious Affine Function Evaluation - Asymptotically Optimal Building Blocks for Universally Composable Two-Party Computation from a Single Untrusted Stateful Tamper-Proof Hardware Token. IACR Cryptology ePrint Archive 2012: 135 (2012)

Rafael Dowsley, Jörn Müller-Quade, Akira Otsuka, Goichiro Hanaoka, Hideki Imai, Anderson C. A. Nascimento: Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data. IEICE Transactions 94-A(2): 725-734 (2011)

Bernhard Beckert, Dennis Hofheinz, Jörn Müller-Quade, Alexander Pretschner, Gregor Snelting: Software Security in Virtualized Infrastructures - The Smart Meter Example. it - Information Technology 53(3): 142-151 (2011)

Jörn Müller-Quade: KASTEL - An Application-Driven Center of Excellence for IT Security. it - Information Technology 53(5): 250-255 (2011)

Nico Döttling, Daniel Kraschewski, Jörn Müller-Quade: Efficient Reductions for Non-signaling Cryptographic Primitives. ICITS 2011: 120-137

Matthias Huber, Jörn Müller-Quade: Methods to Secure Services in an Untrusted Environment. Software Engineering 2011: 159-170

Nico Döttling, Daniel Kraschewski, Jörn Müller-Quade: Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token. TCC 2011: 164-181

Daniel Kraschewski, Jörn Müller-Quade: Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions. TCC 2011: 364-381

Nico Döttling, Thilo Mie, Jörn Müller-Quade, Tobias Nilges: Basing Obfuscation on Simple Tamper-Proof Hardware Assumptions. IACR Cryptology ePrint Archive 2011: 675 (2011)

Jörn Müller-Quade, Dominique Unruh: Long-Term Security and Universal Composability. J. Cryptology 23(4): 594-671 (2010)

Dominique Unruh, Jörn Müller-Quade: Universally Composable Incoercibility. CRYPTO 2010: 411-428

Clemens Heidinger, Erik Buchmann, Matthias Huber, Klemens Böhm, Jörn Müller-Quade: Privacy-Aware Folksonomies. ECDL 2010: 156-167

Nico Döttling, Dejan E. Lazich, Jörn Müller-Quade, Antonio Sobreira de Almeida: Vulnerabilities of Wireless Key Exchange Based on Channel Reciprocity. WISA 2010: 206-220

Jörn Müller-Quade, Renato Renner: Composability in quantum cryptography. CoRR abs/1006.2215 (2010)

Daniel Kraschewski, Jörn Müller-Quade: Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions (full version). IACR Cryptology ePrint Archive 2010: 654 (2010)

Jörn Müller-Quade, Christian Henrich: Bingo Voting - Sichere Wahlen mit Wahlcomputern. Datenschutz und Datensicherheit 33(2): 102-106 (2009)

Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh: Polynomial runtime in simulatability definitions. Journal of Computer Security 17(5): 703-735 (2009)

Jens-Matthias Bohli, Christian Henrich, Carmen Kempka, Jörn Müller-Quade, Stefan Röhrich: Enhancing electronic voting machines on the example of Bingo voting. IEEE Transactions on Information Forensics and Security 4(4): 745-750 (2009)

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

Christian Henrich, Matthias Huber, Carmen Kempka, Jörn Müller-Quade, Mario Strefler: Brief Announcement: Towards Secure Cloud Computing. SSS 2009: 785-786

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

Dennis Hofheinz, Dominique Unruh, Jörn Müller-Quade: Polynomial Runtime and Composability. IACR Cryptology ePrint Archive 2009: 23 (2009)

Rafael Tonicelli, Rafael Dowsley, Goichiro Hanaoka, Hideki Imai, Jörn Müller-Quade, Akira Otsuka, Anderson C. A. Nascimento: Information-Theoretically Secure Oblivious Polynomial Evaluation in the Commodity-Based Model. IACR Cryptology ePrint Archive 2009: 270 (2009)

Rafael Dowsley, Jörn Müller-Quade, Akira Otsuka, Goichiro Hanaoka, Hideki Imai, Anderson C. A. Nascimento: Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data. IACR Cryptology ePrint Archive 2009: 273 (2009)

Dominique Unruh, Jörn Müller-Quade: Universally Composable Incoercibility. IACR Cryptology ePrint Archive 2009: 520 (2009)

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

Jacques Calmet, Willi Geiselmann, Jörn Müller-Quade (Eds.): Mathematical Methods in Computer Science, MMICS 2008, Karlsruhe, Germany, December 17-19, 2008 - Essays in Memory of Thomas Beth. Lecture Notes in Computer Science 5393, Springer 2008, isbn 978-3-540-89993-8

Rafael Dowsley, Jeroen van de Graaf, Jörn Müller-Quade, Anderson C. A. Nascimento: Oblivious Transfer based on the McEliece Assumptions}. IACR Cryptology ePrint Archive 2008: 138 (2008)

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. IACR Cryptology ePrint Archive 2008: 264 (2008)

Rafael Dowsley, Jeroen van de Graaf, Jörn Müller-Quade, Anderson C. A. Nascimento: On the Composability of Statistically Secure Bit Commitments. IACR Cryptology ePrint Archive 2008: 457 (2008)

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. IACR Cryptology ePrint Archive 2008: 468 (2008)

Jörn Müller-Quade, Dominique Unruh: Long-Term Security and Universal Composability. TCC 2007: 41-60

Michael Backes, Jörn Müller-Quade, Dominique Unruh: On the Necessity of Rewinding in Secure Multiparty Computation. TCC 2007: 157-173

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

Jens-Matthias Bohli, Jörn Müller-Quade, Stefan Röhrich: Bingo Voting: Secure and coercion-free voting using a trusted random number generator. IACR Cryptology ePrint Archive 2007: 162 (2007)

Dominik Janzing, Jörn Müller-Quade: Guest editorial. Inform., Forsch. Entwickl. 21(1-2): 1-2 (2006)

Jörn Müller-Quade: Quantum cryptography beyond key exchange. Inform., Forsch. Entwickl. 21(1-2): 39-54 (2006)

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)

Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh: On the (Im-)Possibility of Extending Coin Toss. EUROCRYPT 2006: 504-521

Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh: On the (Im-)Possibility of Extending Coin Toss. IACR Cryptology ePrint Archive 2006: 177 (2006)

Michael Backes, Jörn Müller-Quade, Dominique Unruh: On the Necessity of Rewinding in Secure Multiparty Computation. IACR Cryptology ePrint Archive 2006: 315 (2006)

Jörn Müller-Quade, Dominique Unruh: Long-term Security and Universal Composability. IACR Cryptology ePrint Archive 2006: 422 (2006)

Hideki Imai, Jörn Müller-Quade, Anderson C. A. Nascimento, Pim Tuyls, Andreas Winter: An information theoretical model for quantum secret sharing. Quantum Information & Computation 5(1): 69-80 (2005)

Thomas Beth, Jörn Müller-Quade, Rainer Steinwandt: Cryptanalysis of a practical quantum key distribution with polarization-entangled photons. Quantum Information & Computation 5(3): 181-186 (2005)

Michael Backes, Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh: On fairness in simulatability-based cryptographic systems. FMSE 2005: 13-22

Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh: Polynomial Runtime in Simulatability Definitions. CSFW 2005: 156-169

Jens-Matthias Bohli, Jörn Müller-Quade, Stefan Röhrich: Fairness and Correctness in Case of a Premature Abort. INDOCRYPT 2005: 322-331

Dominik Raub, Rainer Steinwandt, Jörn Müller-Quade: On the Security and Composability of the One Time Pad. SOFSEM 2005: 288-297

Michael Backes, Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh: On Fairness in Simulatability-based Cryptographic Systems. IACR Cryptology ePrint Archive 2005: 294 (2005)

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

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

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

Dennis Hofheinz, Jörn Müller-Quade: Universally Composable Commitments Using Random Oracles. TCC 2004: 58-76

Dennis Hofheinz, Jörn Müller-Quade: A Synchronous Model for Multi-Party Computation and the Incompleteness of Oblivious Transfer. IACR Cryptology ePrint Archive 2004: 16 (2004)

Dominik Raub, Rainer Steinwandt, Jörn Müller-Quade: On the Security and Composability of the One Time Pad. IACR Cryptology ePrint Archive 2004: 113 (2004)

Jörn Müller-Quade, Rainer Steinwandt: On the problem of authentication in a quantum protocol to detect traffic analysis. Quantum Information & Computation 3(1): 48-54 (2003)

Anderson C. A. Nascimento, Akira Otsuka, Hideki Imai, Jörn Müller-Quade: Unconditionally Secure Homomorphic Pre-distributed Commitments. AAECC 2003: 87-97

Dennis Hofheinz, Jörn Müller-Quade, Rainer Steinwandt: Initiator-Resilient Universally Composable Key Exchange. ESORICS 2003: 61-84

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

Dennis Hofheinz, Jörn Müller-Quade, Rainer Steinwandt: On Modeling IND-CCA Security in Cryptographic Protocols. IACR Cryptology ePrint Archive 2003: 24 (2003)

Dennis Hofheinz, Jörn Müller-Quade, Rainer Steinwandt: Initiator-Resilient Universally Composable Key Exchange. IACR Cryptology ePrint Archive 2003: 63 (2003)

Willi Geiselmann, Jörn Müller-Quade, Rainer Steinwandt, Thomas Beth: Über Quantencomputer und Quantenkryptographie. Datenschutz und Datensicherheit 26(8) (2002)

Willi Geiselmann, Jörn Müller-Quade, Rainer Steinwandt: On "A New Representation of Elements of Finite Fields GF (2^m) Yielding Small Complexity Arithmetic Circuits". IEEE Trans. Computers 51(12): 1460-1461 (2002)

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)

Jörn Müller-Quade, Hideki Imai: More Robust Multiparty Protocols with Oblivious Transfer. CoRR cs.CR/0101020 (2001)

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)

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)

Jörn Müller-Quade, Rainer Steinwandt: Gröbner Bases Applied to Finitely Generated Field Extensions. J. Symb. Comput. 30(4): 469-490 (2000)

Jörn Müller-Quade, Hideki Imai: Anonymous Oblivious Transfer. CoRR cs.CR/0011004 (2000)

Jörn Müller-Quade, Rainer Steinwandt: Basic Algorithms for Rational Function Fields. J. Symb. Comput. 27(2): 143-170 (1999)

Jörn Müller-Quade, Thomas Beth: Calculating Generators for Invariant Fields of Linear Algebraic Groups. AAECC 1999: 392-403

Jörn Müller-Quade: Algorithmen zur Dekomposition rationaler Abbildungen. Universität Karlsruhe 1998, pp. I-VIII, 1-131

Jörn Müller-Quade, Martin Rötteler: Deciding Linear Disjointness of Finitely Generated Fields. ISSAC 1998: 153-160