J. Müller-Quade

发表

Decomposing a matrix into circulant and diagonal factors

M. Rötteler, T. Beth, Michael Schmid, 2000 .

Algorithmic design of diffractive optical systems for information processing

T. Beth, Michael Schmid, J. Müller-Quade, 1998 .

Oblivious Transfer Based on the McEliece Assumptions

Anderson C. A. Nascimento, J. V. D. Graaf, J. Müller-Quade, 2012 .

New Journal of Physics Composability in quantum cryptography

R. Renner, J. Müller-Quade, 2009 .

Quantum pseudosignatures

J. Müller-Quade, J. Müller-Quade, 2002 .

Gröbner Bases and Applications: An application of Gröbner Bases to the Decomposition of Rational Mappings

Thomas Beth, Jörn Müller-Quade, Rainer Steinwandt, 1998 .

Challenges and Opportunities of Cloud Computing : Trade-off Decisions in Cloud Computing Architecture

Alexander Pretschner, Samuel Kounev, Matthias Huber, 2010 .

A Paradox of Quantum Universal Composability

J. Müller-Quade, D. Hofheinz, D. Hofheinz, 2003 .

Development of Secure Software with Security By Design

M. Backes, J. Müller-Quade, 2014 .

Cryptanalysis of a practical quantum key distribution with polarization-entangled photons

T. Beth, R. Steinwandt, J. Müller-Quade, 2004, Quantum Inf. Comput..

ConTra Corona: Contact Tracing against the Coronavirus by Bridging the Centralized - Decentralized Divide for Stronger Privacy

Jörn Müller-Quade, Thorsten Strufe, Alexander Koch, 2020, IACR Cryptol. ePrint Arch..

Cheater Identification via Graph Theory in the Dishonest Majority Setting

J. Müller-Quade, N. Brandt, Sven Maier, 2021 .

Constructing Secure Multi-Party Computation with Identifiable Abort

Jörn Müller-Quade, Tobias Müller, Sven Maier, 2020, IACR Cryptol. ePrint Arch..

A New Security Notion for PKC in the Standard Model: Weaker, Simpler, and Still Realizing Secure Channels

Jörn Müller-Quade, Rebecca Schwerdt, Roland Gröll, 2021, IACR Cryptol. ePrint Arch..

On the (Im-)Possibility of Extending Coin Toss

Jörn Müller-Quade, Dennis Hofheinz, Dominique Unruh, 2006, Journal of Cryptology.

A CCA2 Secure Variant of the McEliece Cryptosystem

Nico Döttling, Anderson C. A. Nascimento, Rafael Dowsley, 2012, IEEE Transactions on Information Theory.

A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model

Anderson C. A. Nascimento, Rafael Dowsley, Jörn Müller-Quade, 2009, CT-RSA.

Initiator-Resilient Universally Composable Key Exchange

Jörn Müller-Quade, Dennis Hofheinz, Rainer Steinwandt, 2003, ESORICS.

On Modeling IND-CCA Security in Cryptographic Protocols

Jörn Müller-Quade, Dennis Hofheinz, Rainer Steinwandt, 2003, IACR Cryptol. ePrint Arch..

Long-Term Security and Universal Composability

Jörn Müller-Quade, Dominique Unruh, J. Müller-Quade, 2007, Journal of Cryptology.

On the Composability of Statistically Secure Bit Commitments

Anderson C. A. Nascimento, Rafael Dowsley, Jörn Müller-Quade, 2013, IACR Cryptol. ePrint Arch..

On Possibility of Universally Composable Commitments Based on Noisy Channels

Anderson C. A. Nascimento, Rafael Dowsley, Jörn Müller-Quade, 2008, Anais do VIII Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais (SBSeg 2008).

Analytical beam shaping with application to laser-diode arrays

Frank Wyrowski, Thomas Beth, Jörn Müller-Quade, 1997 .

ZeTA-Zero-Trust Authentication: Relying on Innate Human Ability, Not Technology

Joseph Maguire, Melanie Volkamer, Jörn Müller-Quade, 2016, 2016 IEEE European Symposium on Security and Privacy (EuroS&P).

Encrypted Multisensor Information Filtering

Uwe D. Hanebeck, Jörn Müller-Quade, Benjamin Noack, 2018, 2018 21st International Conference on Information Fusion (FUSION).

Calculating Generators for Invariant Fields of Linear Algebraic Groups

Thomas Beth, Jörn Müller-Quade, T. Beth, 1999, AAECC.

Quantum cryptography beyond key exchange

Jörn Müller-Quade, J. Müller-Quade, 2006, Informatik - Forschung und Entwicklung.

Reusing Tamper-Proof Hardware in UC-Secure Protocols

Jörn Müller-Quade, Tobias Nilges, Jeremias Mechler, 2018, Public Key Cryptography.

Universally Composable (Non-Interactive) Two-Party Computation from Untrusted Reusable Hardware Tokens

Jörn Müller-Quade, Tobias Nilges, Jeremias Mechler, 2016, IACR Cryptol. ePrint Arch..

Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token

Nico Döttling, Jörn Müller-Quade, Daniel Kraschewski, 2011, TCC.

Bingo Voting: Secure and Coercion-Free Voting Using a Trusted Random Number Generator

Jörn Müller-Quade, Jens-Matthias Bohli, Stefan Röhrich, 2007, VOTE-ID.

An information theoretical model for quantum secret sharing

Hideki Imai, Anderson C. A. Nascimento, Jörn Müller-Quade, 2005, Quantum Inf. Comput..

On "A New Representation of Elements of Finite Fields GF (2m) Yielding Small Complexity Arithmetic Circuits"

Jörn Müller-Quade, Rainer Steinwandt, Willi Geiselmann, 2002, IEEE Trans. Computers.

Composability in quantum cryptography pdf

Jörn Müller-Quade, Renato Renner, R. Renner, 2009, ArXiv.

Statistically Secure Linear-Rate Dimension Extension for Oblivious Affine Function Evaluation

Nico Döttling, Jörn Müller-Quade, Daniel Kraschewski, 2012, ICITS.

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

Nico Döttling, Jörn Müller-Quade, Daniel Kraschewski, 2012, IACR Cryptol. ePrint Arch..

Basic Algorithms for Rational Function Fields

Jörn Müller-Quade, Rainer Steinwandt, R. Steinwandt, 1999, J. Symb. Comput..

ETHTID: Deployable Threshold Information Disclosure on Ethereum

Hannes Hartenstein, Jörn Müller-Quade, Oliver Stengele, 2021, 2021 Third International Conference on Blockchain Computing and Applications (BCCA).

Towards secure cloud computing through a separation of duties

Matthias Huber, Carmen Kempka, Jörn Müller-Quade, 2011, GI-Jahrestagung.

Towards Realising Oblivious Voting

Jörn Müller-Quade, Anne Borcherding, Dirk Achenbach, 2016, ICETE.

Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens

Nico Döttling, Jörn Müller-Quade, Tobias Nilges, 2013, TCC.

Basing Obfuscation on Simple Tamper-Proof Hardware Assumptions

Nico Döttling, Jörn Müller-Quade, Tobias Nilges, 2011, IACR Cryptol. ePrint Arch..

On the Necessity of Rewinding in Secure Multiparty Computation

Michael Backes, Jörn Müller-Quade, Dominique Unruh, 2007, TCC.

On fairness in simulatability-based cryptographic systems

Michael Backes, Jörn Müller-Quade, Dennis Hofheinz, 2005, FMSE '05.

Software Security in Virtualized Infrastructures — The Smart Meter Example

Bernhard Beckert, Alexander Pretschner, Jörn Müller-Quade, 2011, it Inf. Technol..

Oblivious Transfer Based on the McEliece Assumptions

Anderson C. A. Nascimento, Rafael Dowsley, Jörn Müller-Quade, 2008, ICITS.

Bit String Commitment Reductions with a Non-zero Rate

Hideki Imai, Anderson C. A. Nascimento, Jörn Müller-Quade, 2004, CT-RSA.

Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions

Anderson C. A. Nascimento, Jörn Müller-Quade, Bernardo Machado David, 2012, ICITS.

On the Composability of Statistically Secure Random Oblivious Transfer

Anderson C. A. Nascimento, Rafael Dowsley, Jörn Müller-Quade, 2018, Entropy.

From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions

Nico Döttling, Jörn Müller-Quade, Tobias Nilges, 2015, ProvSec.

Synchronous Universally Composable Computer Networks

Jörn Müller-Quade, Dirk Achenbach, Jochen Rill, 2015, BalkanCryptSec.

Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens

Rafael Dowsley, Jörn Müller-Quade, Tobias Nilges, 2015, ICITS.

Information-theoretically secure oblivious polynomial evaluation in the commodity-based model

Goichiro Hanaoka, Rafael Tonicelli, Anderson C. A. Nascimento, 2014, International Journal of Information Security.

Composable Long-Term Security with Rewinding

Robin M. Berger, J. Müller-Quade, Michael Klooß, 2023, IACR Cryptol. ePrint Arch..

Security Against Honorific Adversaries: Efficient MPC with Server-aided Public Verifiability

Andy Rupp, J. Müller-Quade, Yufan Jiang, 2022, IACR Cryptol. ePrint Arch..

Environmentally Friendly Composable Multi-Party Computation in the Plain Model from Standard (Timed) Assumptions

Jörn Müller-Quade, Jeremias Mechler, Brandon Broadnax, 2021, IACR Cryptol. ePrint Arch..

Concurrently Composable Security with Shielded Super-Polynomial Simulators

Nico Döttling, Jörn Müller-Quade, Matthias Nagel, 2017, EUROCRYPT.

IND-CCA Secure Cryptography Based on a Variant of the LPN Problem

Nico Döttling, Anderson C. A. Nascimento, Jörn Müller-Quade, 2012, ASIACRYPT.

Efficient Reductions for Non-signaling Cryptographic Primitives

Nico Döttling, Jörn Müller-Quade, Daniel Kraschewski, 2011, ICITS.

Universally Composable Commitments Using Random Oracles

Jörn Müller-Quade, Dennis Hofheinz, J. Müller-Quade, 2004, TCC.

Fairness and Correctness in Case of a Premature Abort

Jörn Müller-Quade, Jens-Matthias Bohli, Stefan Röhrich, 2005, INDOCRYPT.

Improved Coercion-Resistant Electronic Elections through Deniable Re-Voting

Jörn Müller-Quade, Carmen Kempka, Dirk Achenbach, 2015 .

Software-Sicherheit in virtualisierten Infrastrukturen – Das Beispiel der intelligenten Stromzähler – Software Security in Virtualized Infrastructures – The Smart Meter Example –

A. Pretschner, J. Müller-Quade, D. Hofheinz, 2011 .

A Novel Cryptographic Framework for Cloud File Systems and CryFS, a Provably-Secure Construction

Jörn Müller-Quade, Dirk Achenbach, Jochen Rill, 2017, DBSec.

Enhancing Electronic Voting Machines on the Example of Bingo Voting

Jörn Müller-Quade, Carmen Kempka, Jens-Matthias Bohli, 2009, IEEE Transactions on Information Forensics and Security.

Sender-binding Key Encapsulation

J. Müller-Quade, Rebecca Schwerdt, Wasilij Beskorovajnov, 2023, IACR Cryptol. ePrint Arch..

Universally composable zero-knowledge arguments and commitments from signature cards

Jörn Müller-Quade, Dennis Hofheinz, Dominique Unruh, 2007 .

Universally Composable Firewall Architectures Using Trusted Hardware

Jörn Müller-Quade, Dirk Achenbach, Jochen Rill, 2014, BalkanCryptSec.

Polynomial Runtime and Composability

Jörn Müller-Quade, Dennis Hofheinz, Dominique Unruh, 2013, Journal of Cryptology.

Polynomial runtime in simulatability definitions

Jörn Müller-Quade, Dennis Hofheinz, Dominique Unruh, 2005, 18th IEEE Computer Security Foundations Workshop (CSFW'05).