Jörn Müller-Quade

IACR Cryptol. ePrint Arch., 2012

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

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security - 6th International Conference, 2012

Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions.

[BibT_eX]

[DOI]

Bernardo Machado David

Proceedings of the Information Theoretic Security - 6th International Conference, 2012

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011

KASTEL - An Application-Driven Center of Excellence for IT Security.

[BibT_eX]

[DOI]

it Inf. Technol., 2011

Software Security in Virtualized Infrastructures - The Smart Meter Example.

[BibT_eX]

[DOI]

it Inf. Technol., 2011

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

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

Basing Obfuscation on Simple Tamper-Proof Hardware Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

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

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Methods to Secure Services in an Untrusted Environment.

[BibT_eX]

[DOI]

Matthias Huber

Proceedings of the Software Engineering 2011: Fachtagung des GI-Fachbereichs Softwaretechnik, 2011

Efficient Reductions for Non-signaling Cryptographic Primitives.

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security - 5th International Conference, 2011

Towards secure cloud computing through a separation of duties.

[BibT_eX]

[DOI]

Proceedings of the 41. Jahrestagung der Gesellschaft für Informatik, 2011

Social key exchange network - from ad-hoc key exchange to a dense key network.

[BibT_eX]

[DOI]

Proceedings of the 41. Jahrestagung der Gesellschaft für Informatik, 2011

2010

Long-Term Security and Universal Composability.

[BibT_eX]

[DOI]

J. Cryptol., 2010

Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions (full version).

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Composability in quantum cryptography

[BibT_eX]

[DOI]

Renato Renner

CoRR, 2010

Vulnerabilities of Wireless Key Exchange Based on Channel Reciprocity.

[BibT_eX]

[DOI]

Dejan E. Lazich

Antonio Sobreira de Almeida

Proceedings of the Information Security Applications - 11th International Workshop, 2010

Privacy-Aware Folksonomies.

[BibT_eX]

[DOI]

Proceedings of the Research and Advanced Technology for Digital Libraries, 2010

2009

Enhancing electronic voting machines on the example of Bingo voting.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2009

Polynomial runtime in simulatability definitions.

[BibT_eX]

[DOI]

J. Comput. Secur., 2009

Universally Composable Incoercibility.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Bingo Voting - Sichere Wahlen mit Wahlcomputern.

[BibT_eX]

[DOI]

Christian Henrich

Datenschutz und Datensicherheit, 2009

Brief Announcement: Towards Secure Cloud Computing.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2009

2008

Secure Computability of Functions in the IT setting with Dishonest Majority and Applications to Long-Term Security.

[BibT_eX]

[DOI]

Robin Künzler

Dominik Raub

IACR Cryptol. ePrint Arch., 2008

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

[BibT_eX]

[DOI]

Rafael Dowsley

IACR Cryptol. ePrint Arch., 2008

On the Composability of Statistically Secure Bit Commitments.

[BibT_eX]

[DOI]

Rafael Dowsley

Jeroen van de Graaf

IACR Cryptol. ePrint Arch., 2008

2007

Bingo Voting: Secure and coercion-free voting using a trusted random number generator.

[BibT_eX]

[DOI]

Jens-Matthias Bohli

Stefan Röhrich

IACR Cryptol. ePrint Arch., 2007

2006

Computing restrictions of ideals in finitely generated <i>k</i>-algebras by means of Buchberger's algorithm.

[BibT_eX]

[DOI]

J. Symb. Comput., 2006

Quantum cryptography beyond key exchange.

[BibT_eX]

[DOI]

Inform. Forsch. Entwickl., 2006

Guest editorial.

[BibT_eX]

[DOI]

Dominik Janzing

Inform. Forsch. Entwickl., 2006

On the Necessity of Rewinding in Secure Multiparty Computation.

[BibT_eX]

[DOI]

Michael Backes

IACR Cryptol. ePrint Arch., 2006

2005

An information theoretical model for quantum secret sharing.

[BibT_eX]

[DOI]

Pim Tuyls

Andreas J. Winter

Quantum Inf. Comput., 2005

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

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2005

On Fairness in Simulatability-based Cryptographic Systems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2005

Fairness and Correctness in Case of a Premature Abort.

[BibT_eX]

[DOI]

Jens-Matthias Bohli

Stefan Röhrich

Proceedings of the Progress in Cryptology, 2005

Temporary assumptions - quantum and classical.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Dominik Raub

IACR Cryptol. ePrint Arch., 2004

A Synchronous Model for Multi-Party Computation and the Incompleteness of Oblivious Transfer.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

Universally Composable Commitments Using Random Oracles.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Rates for bit commitment and coin tossing from noisy correlation.

[BibT_eX]

[DOI]

Andreas J. Winter

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Bit String Commitment Reductions with a Non-zero Rate.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2004

Unconditionally Non-interactive Verifiable Secret Sharing Secure against Faulty Majorities in the Commodity Based Model.

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 2004

Information Theoretically Secure Oblivious Polynomial Evaluation: Model, Bounds, and Constructions.

[BibT_eX]

[DOI]

Goichiro Hanaoka

Akira Otsuka

Andreas J. Winter

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.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2003

Initiator-Resilient Universally Composable Key Exchange.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2003

On Modeling IND-CCA Security in Cryptographic Protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2003

Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations.

[BibT_eX]

[DOI]

Proceedings of the Information Security, 6th International Conference, 2003

Unconditionally Secure Homomorphic Pre-distributed Commitments.

[BibT_eX]

[DOI]

Akira Otsuka

Proceedings of the Applied Algebra, 2003

2002

On "A New Representation of Elements of Finite Fields GF (2<sup>m</sup>) Yielding Small Complexity Arithmetic Circuits".

[BibT_eX]

[DOI]

Willi Geiselmann

IEEE Trans. Computers, 2002

Über Quantencomputer und Quantenkryptographie.

[BibT_eX]

Datenschutz und Datensicherheit, 2002

2001

Quantum Identification Protocol with Technologically Bounded Parties.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

More Robust Multiparty Protocols with Oblivious Transfer

[BibT_eX]

[DOI]

CoRR, 2001

2000

Gröbner Bases Applied to Finitely Generated Field Extensions.

[BibT_eX]

[DOI]

J. Symb. Comput., 2000

Anonymous Oblivious Transfer

[BibT_eX]

[DOI]

CoRR, 2000

Separation of Orbits under Group Actions with an Application to Quantum Systems.

[BibT_eX]

[DOI]

Martin Rötteler

Appl. Algebra Eng. Commun. Comput., 2000

Recognizing Simple Subextensions of Purely Transcendental Field Extensions.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2000

1999

Basic Algorithms for Rational Function Fields.

[BibT_eX]

[DOI]

J. Symb. Comput., 1999

Calculating Generators for Invariant Fields of Linear Algebraic Groups.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1999

1998

Computing the Intersection of finitely generated fields.

[BibT_eX]

[DOI]

SIGSAM Bull., 1998

Deciding Linear Disjointness of Finitely Generated Fields.

[BibT_eX]

[DOI]

Martin Rötteler

Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998

Algorithmen zur Dekomposition rationaler Abbildungen.

[BibT_eX]