Daniel Kraschewski

According to our database, Daniel Kraschewski authored at least 15 papers between 2010 and 2018.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2018

Reusable Non-Interactive Secure Computation.

Melissa Chase, Yevgeniy Dodis, Yuval Ishai, Daniel Kraschewski, Tianren Liu, Rafail Ostrovsky, Vinod Vaikuntanathan

IACR Cryptol. ePrint Arch., 2018

2016

All Complete Functionalities are Reversible.

Daniel Kraschewski, Dakshita Khurana, Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai

IACR Cryptol. ePrint Arch., 2016

From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions.

Nico Döttling, Daniel Kraschewski, Jörn Müller-Quade, Tobias Nilges

IACR Cryptol. ePrint Arch., 2016

2014

A Full Characterization of Completeness for Two-party Randomized Function Evaluation.

Daniel Kraschewski, Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai

IACR Cryptol. ePrint Arch., 2014

General Statistically Secure Computation with Bounded-Resettable Hardware Tokens.

Nico Döttling, Daniel Kraschewski, Jörn Müller-Quade, Tobias Nilges

IACR Cryptol. ePrint Arch., 2014

2013

Complete Primitives for Information-Theoretically Secure Two-Party Computation.

Daniel Kraschewski

PhD thesis, 2013

Completeness Theorems for All Finite Stateless 2-Party Primitives.

Daniel Kraschewski

IACR Cryptol. ePrint Arch., 2013

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.

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

IACR Cryptol. ePrint Arch., 2012

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

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

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

2011

On definitions of selective opening security.

Florian Böhl, Dennis Hofheinz, Daniel Kraschewski

IACR Cryptol. ePrint Arch., 2011

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

Daniel Kraschewski, Jörn Müller-Quade

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

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

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

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

Efficient Reductions for Non-signaling Cryptographic Primitives.

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

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

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

Dirk Achenbach, David Förster, Christian Henrich, Daniel Kraschewski, Jörn Müller-Quade

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

2010

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

Daniel Kraschewski, Jörn Müller-Quade

IACR Cryptol. ePrint Arch., 2010