Jörn Müller-Quade

According to our database1, Jörn Müller-Quade authored at least 100 papers between 1998 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
On the Composability of Statistically Secure Random Oblivious Transfer.
Entropy, 2020

2019
Your Money or Your Life - Modeling and Analyzing the Security of Electronic Payment in the UC Framework.
IACR Cryptology ePrint Archive, 2019

Editorial.
Automatisierungstechnik, 2019

2018
On the (Im-)Possibility of Extending Coin Toss.
J. Cryptology, 2018

Fortified Universal Composability: Taking Advantage of Simple Secure Hardware Modules.
IACR Cryptology ePrint Archive, 2018

Sicherheit auf festem Fundament.
Datenschutz und Datensicherheit, 2018

Karlsruher Thesen zur Digitalen Souveränität Europas.
Datenschutz und Datensicherheit, 2018

Reusing Tamper-Proof Hardware in UC-Secure Protocols.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

Towards Efficient Software Protection Obeying Kerckhoffs's Principle using Tamper-proof Hardware.
Proceedings of the 15th International Joint Conference on e-Business and Telecommunications, 2018

Encrypted Multisensor Information Filtering.
Proceedings of the 21st International Conference on Information Fusion, 2018

2017
A Novel Cryptographic Framework for Cloud File Systems and CryFS, a Provably-Secure Construction.
IACR Cryptology ePrint Archive, 2017

Non-Malleability vs. CCA-Security: The Case of Commitments.
IACR Cryptology ePrint Archive, 2017

Sicherheit relativ definieren.
Datenschutz und Datensicherheit, 2017

2016
Universally Composable (Non-Interactive) Two-Party Computation from Untrusted Reusable Hardware Tokens.
IACR Cryptology ePrint Archive, 2016

From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions.
IACR Cryptology ePrint Archive, 2016

Concurrently Composable Security With Shielded Super-polynomial Simulators.
IACR Cryptology ePrint Archive, 2016

Oblivious Voting: Hiding Votes from the Voting Machine in Bingo Voting.
Proceedings of the 13th International Joint Conference on e-Business and Telecommunications (ICETE 2016), 2016

Towards Realising Oblivious Voting.
Proceedings of the E-Business and Telecommunications - 13th International Joint Conference, 2016

ZeTA-Zero-Trust Authentication: Relying on Innate Human Ability, Not Technology.
Proceedings of the IEEE European Symposium on Security and Privacy, 2016

A Formal Treatment of Privacy in Video Data.
Proceedings of the Computer Security - ESORICS 2016, 2016

2015
Information-theoretically secure oblivious polynomial evaluation in the commodity-based model.
Int. J. Inf. Sec., 2015

Weakening the Isolation Assumption of Tamper-proof Hardware Tokens.
IACR Cryptology ePrint Archive, 2015

Universally Composable Firewall Architectures using Trusted Hardware.
IACR Cryptology ePrint Archive, 2015

Daten verschlüsselt speichern und verarbeiten in der Cloud.
Datenschutz und Datensicherheit, 2015

Synchronous Universally Composable Computer Networks.
Proceedings of the Cryptography and Information Security in the Balkans, 2015

Closing the Gap: A Universal Privacy Framework for Outsourced Data.
Proceedings of the Cryptography and Information Security in the Balkans, 2015

2014
General Statistically Secure Computation with Bounded-Resettable Hardware Tokens.
IACR Cryptology ePrint Archive, 2014

Wireless Key Exchange Using Frequency Impairments.
Proceedings of the Information Security Applications - 15th International Workshop, 2014

A Provably Privacy Preserving Video Surveillance Architecture for an Assisted Living Community.
Proceedings of the 44. Jahrestagung der Gesellschaft für Informatik, Informatik 2014, Big Data, 2014

2013
Polynomial Runtime and Composability.
J. Cryptology, 2013

Das Kryptologikum.
Datenschutz und Datensicherheit, 2013

Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Structural Composition Attacks on Anonymized Data.
Proceedings of the Sicherheit 2014: Sicherheit, 2013

Symmetric Searchable Encryption for Exact Pattern Matching using Directed Acyclic Word Graphs.
Proceedings of the SECRYPT 2013, 2013

Lossy Codes and a New Variant of the Learning-With-Errors Problem.
Proceedings of the Advances in Cryptology, 2013

Defining Privacy Based on Distributions of Privacy Breaches.
Proceedings of the Number Theory and Cryptography, 2013

2012
A CCA2 Secure Variant of the McEliece Cryptosystem.
IEEE Trans. Information Theory, 2012

Oblivious Transfer Based on the McEliece Assumptions.
IEICE Transactions, 2012

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

Statistically Secure Linear-Rate Dimension Extension for Oblivious Affine Function Evaluation.
Proceedings of the Information Theoretic Security - 6th International Conference, 2012

Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions.
Proceedings of the Information Theoretic Security - 6th International Conference, 2012

IND-CCA Secure Cryptography Based on a Variant of the LPN Problem.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011
KASTEL - An Application-Driven Center of Excellence for IT Security.
it - Information Technology, 2011

Software Security in Virtualized Infrastructures - The Smart Meter Example.
it - Information Technology, 2011

Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data.
IEICE Transactions, 2011

Basing Obfuscation on Simple Tamper-Proof Hardware Assumptions.
IACR Cryptology ePrint Archive, 2011

Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Methods to Secure Services in an Untrusted Environment.
Proceedings of the Software Engineering 2011: Fachtagung des GI-Fachbereichs Softwaretechnik, 2011

Efficient Reductions for Non-signaling Cryptographic Primitives.
Proceedings of the Information Theoretic Security - 5th International Conference, 2011

Towards secure cloud computing through a separation of duties.
Proceedings of the Informatik 2011: Informatik schafft Communities, 2011

Social key exchange network - from ad-hoc key exchange to a dense key network.
Proceedings of the Informatik 2011: Informatik schafft Communities, 2011

2010
Long-Term Security and Universal Composability.
J. Cryptology, 2010

Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions (full version).
IACR Cryptology ePrint Archive, 2010

Composability in quantum cryptography
CoRR, 2010

Vulnerabilities of Wireless Key Exchange Based on Channel Reciprocity.
Proceedings of the Information Security Applications - 11th International Workshop, 2010

Privacy-Aware Folksonomies.
Proceedings of the Research and Advanced Technology for Digital Libraries, 2010

2009
Enhancing electronic voting machines on the example of Bingo voting.
IEEE Trans. Information Forensics and Security, 2009

Polynomial runtime in simulatability definitions.
Journal of Computer Security, 2009

Universally Composable Incoercibility.
IACR Cryptology ePrint Archive, 2009

Bingo Voting - Sichere Wahlen mit Wahlcomputern.
Datenschutz und Datensicherheit, 2009

Brief Announcement: Towards Secure Cloud Computing.
Proceedings of the Stabilization, 2009

2008
Secure Computability of Functions in the IT setting with Dishonest Majority and Applications to Long-Term Security.
IACR Cryptology ePrint Archive, 2008

A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model.
IACR Cryptology ePrint Archive, 2008

On the Composability of Statistically Secure Bit Commitments.
IACR Cryptology ePrint Archive, 2008

2007
Bingo Voting: Secure and coercion-free voting using a trusted random number generator.
IACR Cryptology ePrint Archive, 2007

2006
Computing restrictions of ideals in finitely generated k-algebras by means of Buchberger's algorithm.
J. Symb. Comput., 2006

Quantum cryptography beyond key exchange.
Inform., Forsch. Entwickl., 2006

Guest editorial.
Inform., Forsch. Entwickl., 2006

On the Necessity of Rewinding in Secure Multiparty Computation.
IACR Cryptology ePrint Archive, 2006

2005
An information theoretical model for quantum secret sharing.
Quantum Information & Computation, 2005

Cryptanalysis of a practical quantum key distribution with polarization-entangled photons.
Quantum Information & Computation, 2005

On Fairness in Simulatability-based Cryptographic Systems.
IACR Cryptology ePrint Archive, 2005

Fairness and Correctness in Case of a Premature Abort.
Proceedings of the Progress in Cryptology, 2005

Temporary assumptions - quantum and classical.
Proceedings of the IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005

2004
On the Security and Composability of the One Time Pad.
IACR Cryptology ePrint Archive, 2004

A Synchronous Model for Multi-Party Computation and the Incompleteness of Oblivious Transfer.
IACR Cryptology ePrint Archive, 2004

Universally Composable Commitments Using Random Oracles.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Rates for bit commitment and coin tossing from noisy correlation.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Bit String Commitment Reductions with a Non-zero Rate.
Proceedings of the Topics in Cryptology, 2004

Unconditionally Non-interactive Verifiable Secret Sharing Secure against Faulty Majorities in the Commodity Based Model.
Proceedings of the Applied Cryptography and Network Security, 2004

Information Theoretically Secure Oblivious Polynomial Evaluation: Model, Bounds, and Constructions.
Proceedings of the Information Security and Privacy: 9th Australasian Conference, 2004

2003
On the problem of authentication in a quantum protocol to detect traffic analysis.
Quantum Information & Computation, 2003

Initiator-Resilient Universally Composable Key Exchange.
IACR Cryptology ePrint Archive, 2003

On Modeling IND-CCA Security in Cryptographic Protocols.
IACR Cryptology ePrint Archive, 2003

Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations.
Proceedings of the Information Security, 6th International Conference, 2003

Unconditionally Secure Homomorphic Pre-distributed Commitments.
Proceedings of the Applied Algebra, 2003

2002
On "A New Representation of Elements of Finite Fields GF (2m) Yielding Small Complexity Arithmetic Circuits".
IEEE Trans. Computers, 2002

Über Quantencomputer und Quantenkryptographie.
Datenschutz und Datensicherheit, 2002

2001
Quantum Identification Protocol with Technologically Bounded Parties.
Electronic Notes in Discrete Mathematics, 2001

More Robust Multiparty Protocols with Oblivious Transfer
CoRR, 2001

2000
Gröbner Bases Applied to Finitely Generated Field Extensions.
J. Symb. Comput., 2000

Anonymous Oblivious Transfer
CoRR, 2000

Separation of Orbits under Group Actions with an Application to Quantum Systems.
Appl. Algebra Eng. Commun. Comput., 2000

Recognizing Simple Subextensions of Purely Transcendental Field Extensions.
Appl. Algebra Eng. Commun. Comput., 2000

1999
Basic Algorithms for Rational Function Fields.
J. Symb. Comput., 1999

Calculating Generators for Invariant Fields of Linear Algebraic Groups.
Proceedings of the Applied Algebra, 1999

1998
Computing the Intersection of finitely generated fields.
ACM SIGSAM Bulletin, 1998

Deciding Linear Disjointness of Finitely Generated Fields.
Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998

Algorithmen zur Dekomposition rationaler Abbildungen.
PhD thesis, 1998


  Loading...