Motivation. Cryptography is a crucial tool for securing information systems. Cryptographic building blocks ensure the secrecy and integrity of information, and help to protect the privacy of users. Still, most actually deployed cryptographic schemes are not known to have any rigorously proven security guarantees. This has led to a number of far-reaching security issues in widely deployed software systems.

Goal. My goal is to provide practical cryptographic building blocks that come with rigorously proven security guarantees. These building blocks should be efficient enough for the use in large-scale modern information systems, and their security should be defined and formally analyzed in a mathematically rigorous manner.

Technical interests. I am interested in the foundations of theoretical cryptography, and in general ways to derive constructions and security guarantees in a modular fashion. On the one hand, I am particularly interested in the design and analysis of cryptographic schemes in the public-key setting. This covers common tools like public-key encryption and digital signatures, specifically in realistic modern scenarios (such as settings with a huge number of users). On the other hand, I am fascinated by the possibilities of new cryptographic building blocks such as indistinguishability obfuscation.

Statistics: DBLP, Google Scholar.

2023

• Masayuki Abe, Dennis Hofheinz, Ryo Nishimaki, Miyako Ohkubo, Jiaxin Pan: Compact Structure-Preserving Signatures with Almost Tight Security. J. Cryptol. 36(4):37. pdf
• Dennis Hofheinz, Julia Kastner, Karen Klein: The Power of Undirected Rewindings for Adaptive Security. Proc. CRYPTO (2) 2023, Lecture Notes in Computer Science 14082, pp. 725-758, Springer 2023. pdf
• Suvradip Chakraborty, Dennis Hofheinz, Ueli Maurer, Guilherme Rito: Deniable Authentication When Signing Keys Leak. Proc. EUROCRYPT (3) 2023, Lecture Notes in Computer Science 14006, pp. 69-100, Springer 2023. pdf
• Antonio Faonio, Dennis Hofheinz, Luigi Russo: Almost Tightly-Secure Re-randomizable and Replayable CCA-Secure Public Key Encryption. Proc. Public Key Cryptography (2) 2023, Lecture Notes in Computer Science 13941, pp. 275-305, Springer 2023. pdf

2022

• Nicholas Brandt, Dennis Hofheinz, Julia Kastner, Akin Ünal: The Price of Verifiability: Lower Bounds for Verifiable Random Functions. Proc. TCC (2) 2022, Lecture Notes in Computer Science 13748, pp. 747-776, Springer 2022. pdf
• Dennis Hofheinz, Eike Kiltz: Scalable Cryptography. Algorithms for Big Data, Lecture Notes in Computer Science 13201, pp. 169-178, Springer 2022. pdf

2021

• Christiane Kuhn, Dennis Hofheinz, Andy Rupp, Thorsten Strufe: Onion Routing with Replies. Proc. ASIACRYPT (2) 2021, Lecture Notes in Computer Science 13091, pp. 573-604, Springer 2021. pdf
• Julia Hesse, Dennis Hofheinz, Lisa Kohl, Roman Langrehr: Towards Tight Adaptive Security of Non-interactive Key Exchange. Proc. TCC (3) 2021, Lecture Notes in Computer Science 13044, pp. 286-316, Springer 2021. pdf
• Nico Döttling, Dominik Hartmann, Dennis Hofheinz, Eike Kiltz, Sven Schäge, Bogdan Ursu: On the Impossibility of Purely Algebraic Signatures. Proc. TCC (3) 2021, Lecture Notes in Computer Science 13044, pp. 317-349, Springer 2021. pdf

2020

• Maximiliane Frölich, Dennis Hofheinz, Michael A. R. Meier: Reading mixtures of uniform sequence-defined macromolecules to increase data storage capacity. Communications Chemistry 3(184):1-10, Springer Nature 2020. pdf
• Thomas Agrikola, Dennis Hofheinz, Julia Kastner: On Instantiating the Algebraic Group Model from Falsifiable Assumptions. Proc. EUROCRYPT (2) 2020, Lecture Notes in Computer Science 12106, pp. 96-126, Springer 2020. pdf
• Thomas Agrikola, Geoffroy Couteau, Dennis Hofheinz: The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO. Proc. Public Key Cryptography (1) 2020, Lecture Notes in Computer Science 12110, pp. 187-219, Springer 2020. pdf
• Martin R. Albrecht, Pooya Farshim, Shuai Han, Dennis Hofheinz, Enrique Larraia, Kenneth G. Paterson: Multilinear Maps from Obfuscation. J. Cryptol. 33(3):1080-1113. pdf

2019

• Dennis Hofheinz, Bogdan Ursu: Dual-Mode NIZKs from Obfuscation. Proc. ASIACRYPT (1) 2019, Lecture Notes in Computer Science 11921, pp. 311-341, Springer 2019. pdf
• Geoffroy Couteau, Dennis Hofheinz: Designated-Verifier Pseudorandom Generators, and Their Applications. Proc. EUROCRYPT (2) 2019, Lecture Notes in Computer Science 11477, pp. 562-592, Springer 2019. pdf
• Dennis Hofheinz, Ngoc Khanh Nguyen: On Tightly Secure Primitives in the Multi-instance Setting. Proc. Public Key Cryptography (1) 2019, Lecture Notes in Computer Science 11442, pp. 581-611, Springer 2019. pdf
• Dennis Hofheinz, Akshay Kamath, Venkata Koppula, Brent Waters: Adaptively Secure Constrained Pseudorandom Functions. Proc. Financial Cryptography 2019, Lecture Notes in Computer Science 11598, pp. 357-376, Springer 2019. pdf

2018

• Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh: On the (Im-)Possibility of Extending Coin Toss. J. Cryptol. 31(4):1120-1163. pdf
• Dennis Hofheinz, Dingding Jia, Jiaxin Pan: Identity-Based Encryption Tightly Secure Under Chosen-Ciphertext Attacks. Proc. ASIACRYPT (2) 2018, Lecture Notes in Computer Science 11273, pp. 190-220, Springer 2018. pdf
• Julia Hesse, Dennis Hofheinz, Lisa Kohl: On Tightly Secure Non-Interactive Key Exchange. Proc. CRYPTO (2) 2018, Lecture Notes in Computer Science 10992, pp. 65-94, Springer 2018. pdf
• Andreas Boukis, Kevin Reiter, Maximiliane Frölich, Dennis Hofheinz, Michael A. R. Meier: Multicomponent reactions provide key molecules for secret communication. Nature Communications 9(1439), Springer Nature 2018. pdf
• Romain Gay, Dennis Hofheinz, Lisa Kohl, Jiaxin Pan: More Efficient (Almost) Tightly Secure Structure-Preserving Signatures. Proc. EUROCRYPT (2) 2018, Lecture Notes in Computer Science 10821, pp. 230-258, Springer 2018. pdf
• Pooya Farshim, Julia Hesse, Dennis Hofheinz, Enrique Larraia: Graded Encoding Schemes from Obfuscation. Proc. Public Key Cryptography (2) 2018, Lecture Notes in Computer Science 10770, pp. 371-400, Springer 2018. pdf
• Thomas Agrikola, Dennis Hofheinz: Interactively Secure Groups from Obfuscation. Proc. Public Key Cryptography (2) 2018, Lecture Notes in Computer Science 10770, pp. 341-370, Springer 2018. pdf

2017

• Dennis Hofheinz, Kathrin Hövelmanns, Eike Kiltz: A Modular Analysis of the Fujisaki-Okamoto Transformation. Proc. TCC (1) 2017, Lecture Notes in Computer Science 10677, pp. 341-371, Springer 2017. pdf
• Masayuki Abe, Dennis Hofheinz, Ryo Nishimaki, Miyako Ohkubo, Jiaxin Pan: Compact Structure-Preserving Signatures with Almost Tight Security. Proc. CRYPTO (2) 2017, Lecture Notes in Computer Science 10402, pp. 548-580, Springer 2017. pdf
• Romain Gay, Dennis Hofheinz, Lisa Kohl: Kurosawa-Desmedt Meets Tight Security. Proc. CRYPTO (3) 2017, Lecture Notes in Computer Science 10403, pp. 133-160, Springer 2017. pdf
• Dennis Hofheinz: Adaptive Partitioning. Proc. EUROCRYPT (3) 2017, Lecture Notes in Computer Science 10212, pp. 489-518. pdf

2016

• Dennis Hofheinz, Tibor Jager, Dakshita Khurana, Amit Sahai, Brent Waters, Mark Zhandry: How to Generate and Use Universal Samplers. Proc. ASIACRYPT (2) 2016, Lecture Notes in Computer Science 10032, pp. 715-744. pdf
• Dennis Hofheinz, Vanishree Rao, Daniel Wichs: Standard Security Does Not Imply Indistinguishability Under Selective Opening. Proc. TCC (B2) 2016, Lecture Notes in Computer Science 9986, pp. 121-145. pdf
• Dennis Hofheinz, Tibor Jager, Andy Rupp: Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts. Proc. TCC (B2) 2016, Lecture Notes in Computer Science 9986, pp. 146-168. pdf
• Romain Gay, Dennis Hofheinz, Eike Kiltz, Hoeteck Wee: Tightly CCA-Secure Encryption Without Pairings. Proc. EUROCRYPT (1) 2016, Lecture Notes in Computer Science 9665, pp. 1-27, Springer 2016. Awarded best paper. pdf
• Dennis Hofheinz, Tibor Jager: Verifiable Random Functions from Standard Assumptions. Proc. TCC (A1) 2016, Lecture Notes in Computer Science 9562, pp. 336-362, Springer 2016. pdf
• Dennis Hofheinz: Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography. Proc. TCC (A1) 2016, Lecture Notes in Computer Science 9562, pp. 251-281, Springer 2016. pdf
• Julia Hesse, Dennis Hofheinz, Andy Rupp: Reconfigurable Cryptography: A Flexible Approach to Long-Term Security. Proc. TCC (A1) 2016, Lecture Notes in Computer Science 9562, pp. 416-445, Springer 2016. pdf
• Martin R. Albrecht, Pooya Farshim, Dennis Hofheinz, Enrique Larraia, Kenneth G. Paterson: Multilinear Maps from Obfuscation. Proc. TCC (A1) 2016, Lecture Notes in Computer Science 9562, pp. 446-473, Springer 2016. pdf
• Dennis Hofheinz, Tibor Jager: Tightly secure signatures and public-key encryption. Des. Codes Cryptogr. 80(1):29-61. pdf

2015

• Dennis Hofheinz, Christian Matt, Ueli Maurer: Idealizing Identity-Based Encryption. Proc. ASIACRYPT (1) 2015, Lecture Notes in Computer Science 9452, pp. 495-520, Springer 2015. pdf
• Dennis Hofheinz, Victor Shoup: GNUC: A New Universal Composability Framework. J. Cryptol. 28(3):423-508. pdf
• Florian Böhl, Dennis Hofheinz, Tibor Jager, Jessica Koch, Christoph Striecks: Confined Guessing: New Signatures From Standard Assumptions. J. Cryptol. 28(1):176-208. pdf
• Mihir Bellare, Dennis Hofheinz, Eike Kiltz: Subtleties in the Definition of IND-CCA: When and How Should Challenge Decryption Be Disallowed? J. Cryptol. 28(1):29-48. pdf
• Dennis Hofheinz, Jessica Koch, Christoph Striecks: Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting. Proc. Public Key Cryptography 2015, Lecture Notes in Computer Science 9020, pp. 799-822, Springer 2015. pdf
• Christoph Bader, Dennis Hofheinz, Tibor Jager, Eike Kiltz, Yong Li: Tightly-Secure Authenticated Key Exchange. Proc. TCC (1) 2015, Lecture Notes in Computer Science 9014, pp. 629-658, Springer 2015. pdf

2014

• Eduarda S. V. Freire, Julia Hesse, Dennis Hofheinz: Universally Composable Non-Interactive Key Exchange. Proc. SCN 2014, Lecture Notes in Computer Science 8642, pp. 1-20, Springer 2014. pdf
• Gottfried Herold, Julia Hesse, Dennis Hofheinz, Carla Ràfols, Andy Rupp: Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations. Proc. CRYPTO (1) 2014, Lecture Notes in Computer Science 8616, pp. 261-279, Springer 2014. pdf
• Florian Böhl, Gareth T. Davies, Dennis Hofheinz: Encryption Schemes Secure under Related-Key and Key-Dependent Message Attacks. Proc. Public Key Cryptography 2014, Lecture Notes in Computer Science 8383, pp. 483-500, Springer 2014. pdf
• Dennis Hofheinz, Andy Rupp: Standard versus Selective Opening Security: Separation and Equivalence Results. Proc. TCC 2014, Lecture Notes in Computer Science 8349, pp. 591-615, Springer 2014. pdf
• Dennis Hofheinz, Christoph Striecks: A Generic View on Trace-and-Revoke Broadcast Encryption Schemes. Proc. CT-RSA 2014, Lecture Notes in Computer Science 8366, pp. 48-63, Springer 2014. pdf

2013

• Eduarda S. V. Freire, Dennis Hofheinz, Kenneth G. Paterson, Christoph Striecks: Programmable Hash Functions in the Multilinear Setting. Proc. CRYPTO (1) 2013, Lecture Notes in Computer Science 8042, pp. 513-530, Springer 2013. pdf
• Dennis Hofheinz, Dominique Unruh, Jörn Müller-Quade: Polynomial Runtime and Composability. J. Cryptol. 26(3):375-441. pdf
• Dennis Hofheinz: Circular Chosen-Ciphertext Security with Compact Ciphertexts. Proc. EUROCRYPT 2013, Lecture Notes in Computer Science 7881, pp. 520-536, Springer 2013. pdf
• Florian Böhl, Dennis Hofheinz, Tibor Jager, Jessica Koch, Jae Hong Seo, Christoph Striecks: Practical Signatures from Standard Assumptions. Proc. EUROCRYPT 2013, Lecture Notes in Computer Science 7881, pp. 461-485, Springer 2013. pdf
• Eduarda S. V. Freire, Dennis Hofheinz, Eike Kiltz, Kenneth G. Paterson: Non-Interactive Key Exchange. Proc. Public Key Cryptography 2013, Lecture Notes in Computer Science 7778, pp. 254-271, Springer 2013. pdf
• Dennis Hofheinz, Eike Kiltz, Victor Shoup: Practical Chosen Ciphertext Secure Encryption from Factoring. J. Cryptol. 26(1):102-118. pdf

2012

• David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert: Bonsai Trees, or How to Delegate a Lattice Basis. J. Cryptol. 25(4):601-639. pdf
• Dennis Hofheinz, Tibor Jager: Tightly Secure Signatures and Public-Key Encryption. Proc. CRYPTO 2012, Lecture Notes in Computer Science 7417, pp. 590-607, Springer 2012. pdf
• Dennis Hofheinz, Eike Kiltz: Programmable Hash Functions and Their Applications. J. Cryptol. 25(3):484-527. pdf
• Dennis Hofheinz, Tibor Jager, Edward Knapp: Waters Signatures with Optimal Security Reduction. Proc. Public Key Cryptography 2012, Lecture Notes in Computer Science 7293, pp. 66-83, Springer 2012. pdf
• Florian Böhl, Dennis Hofheinz, Daniel Kraschewski: On Definitions of Selective Opening Security. Proc. Public Key Cryptography 2012, Lecture Notes in Computer Science 7293, pp. 522-539, Springer 2012. Awarded best paper. pdf
• Dennis Hofheinz: All-But-Many Lossy Trapdoor Functions. Proc. EUROCRYPT 2012, Lecture Notes in Computer Science 7237, pp. 209-227, Springer 2012. pdf

2011

• Dennis Hofheinz, Tibor Jager, Eike Kiltz: Short Signatures from Weaker Assumptions. Proc. ASIACRYPT 2011, Lecture Notes in Computer Science 7073, pp. 647-666, Springer 2011. pdf
• Dennis Hofheinz: Possibility and Impossibility Results for Selective Decommitments. J. Cryptol. 24(3):470-516. pdf
• Bernhard Beckert, Dennis Hofheinz, Jörn Müller-Quade, Alexander Pretschner, Gregor Snelting: Software Security in Virtualized Infrastructures - The Smart Meter Example. it Inf. Technol. 53(3):142-151. pdf

2010

• Javier Herranz, Dennis Hofheinz, Eike Kiltz: Some (in)sufficient conditions for secure hybrid encryption. Inf. Comput. 208(11):1243-1257. pdf
• Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai: Bounded Key-Dependent Message Security. Proc. EUROCRYPT 2010, Lecture Notes in Computer Science 6110, pp. 423-444, Springer 2010. pdf
• Serge Fehr, Dennis Hofheinz, Eike Kiltz, Hoeteck Wee: Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks. Proc. EUROCRYPT 2010, Lecture Notes in Computer Science 6110, pp. 381-402, Springer 2010. pdf
• David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert: Bonsai Trees, or How to Delegate a Lattice Basis. Proc. EUROCRYPT 2010, Lecture Notes in Computer Science 6110, pp. 523-552, Springer 2010. Awarded best paper. pdf
• Ronald Cramer, Dennis Hofheinz, Eike Kiltz: A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems. Proc. TCC 2010, Lecture Notes in Computer Science 5978, pp. 146-164, Springer 2010. pdf
• Dennis Hofheinz, John Malone-Lee, Martijn Stam: Obfuscation for Cryptographic Purposes. J. Cryptol. 23(1):121-168. pdf

2009

• Michael Backes, Dennis Hofheinz, Dominique Unruh: CoSP: a general framework for computational soundness proofs. Proc. CCS 2009, pp. 66-78, ACM 2009. pdf
• Dennis Hofheinz, Eike Kiltz: The Group of Signed Quadratic Residues and Applications. Proc. CRYPTO 2009, Lecture Notes in Computer Science 5677, pp. 637-653, Springer 2009. pdf
• Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh: Polynomial runtime in simulatability definitions. J. Comput. Secur. 17(5):703-735. pdf
• Seung Geol Choi, Javier Herranz, Dennis Hofheinz, Jung Yeon Hwang, Eike Kiltz, Dong Hoon Lee, Moti Yung: The Kurosawa-Desmedt key encapsulation is not chosen-ciphertext secure. Inf. Process. Lett. 109(16):897-901. pdf
• Mihir Bellare, Dennis Hofheinz, Scott Yilek: Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening. Proc. EUROCRYPT 2009, Lecture Notes in Computer Science 5479, pp. 1-35, Springer 2009. pdf
• Dennis Hofheinz, Eike Kiltz: Practical Chosen Ciphertext Secure Encryption from Factoring. Proc. EUROCRYPT 2009, Lecture Notes in Computer Science 5479, pp. 313-332, Springer 2009. Awarded best paper. pdf

2008

• Dennis Hofheinz, Eike Kiltz: Programmable Hash Functions and Their Applications. Proc. CRYPTO 2008, Lecture Notes in Computer Science 5157, pp. 21-38, Springer 2008. pdf
• Ivan Damgård, Dennis Hofheinz, Eike Kiltz, Rune Thorbek: Public-Key Encryption with Non-interactive Opening. Proc. CT-RSA 2008, Lecture Notes in Computer Science 4964, pp. 239-255, Springer 2008. pdf
• Dennis Hofheinz, Dominique Unruh: Towards Key-Dependent Message Security in the Standard Model. Proc. EUROCRYPT 2008, Lecture Notes in Computer Science 4965, pp. 108-126, Springer 2008. pdf
• Michael Backes, Markus Dürmuth, Dennis Hofheinz, Ralf Küsters: Conditional reactive simulatability. Int. J. Inf. Sec. 7(2):155-169. pdf

2007

• Ronald Cramer, Goichiro Hanaoka, Dennis Hofheinz, Hideki Imai, Eike Kiltz, Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan: Bounded CCA2-Secure Encryption. Proc. ASIACRYPT 2007, Lecture Notes in Computer Science 4833, pp. 502-518, Springer 2007. pdf
• Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh: Universally composable zero-knowledge arguments and commitments from signature cards. Tatra Mountains Mathematical Publications 37:93-103. pdf
• Dennis Hofheinz, Eike Kiltz: Secure Hybrid Encryption from Weakened Key Encapsulation. Proc. CRYPTO 2007, Lecture Notes in Computer Science 4622, pp. 553-571, Springer 2007. pdf
• Dennis Hofheinz, John Malone-Lee, Martijn Stam: Obfuscation for Cryptographic Purposes. Proc. TCC 2007, Lecture Notes in Computer Science 4392, pp. 214-232, Springer 2007. pdf

2006

• Michael Backes, Markus Dürmuth, Dennis Hofheinz, Ralf Küsters: Conditional Reactive Simulatability. Proc. ESORICS 2006, Lecture Notes in Computer Science 4189, pp. 424-443, Springer 2006. pdf
• Dennis Hofheinz, Dominique Unruh: Simulatable Security and Polynomially Bounded Concurrent Composability. Proc. S&P 2006, pp. 169-183, IEEE Computer Society 2006. pdf
• Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh: On the (Im-)Possibility of Extending Coin Toss. Proc. EUROCRYPT 2006, Lecture Notes in Computer Science 4004, pp. 504-521, Springer 2006. pdf
• Dennis Hofheinz, Jörn Müller-Quade, Rainer Steinwandt: On modeling IND-CCA security in cryptographic protocols. Tatra Mountains Mathematical Publications 33:83-97. pdf
• Anja Groch, Dennis Hofheinz, Rainer Steinwandt: A practical attack on the root problem in braid groups. Proc. AMS/DMV Joint International Meeting 2006, Contemporary Mathematics 418, pp. 121-131, American Mathematical Society 2006. pdf
• Dennis Hofheinz, Dominique Unruh: An attack on a group-based cryptographic scheme. Proc. AMS/DMV Joint International Meeting 2006, Contemporary Mathematics 418, pp. 133-140, American Mathematical Society 2006. pdf

2005

• Michael Backes, Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh: On fairness in simulatability-based cryptographic systems. Proc. FMSE 2005, pp. 13-22, ACM 2005. pdf
• Dennis Hofheinz, Dominique Unruh: On the Notion of Statistical Security in Simulatability Definitions. Proc. ISC 2005, Lecture Notes in Computer Science 3650, pp. 118-133, Springer 2005. pdf
• Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh: Polynomial Runtime in Simulatability Definitions. Proc. CSFW 2005, pp. 156-169, IEEE Computer Society 2005. pdf
• Dennis Hofheinz, Dominique Unruh: Comparing Two Notions of Simulatability. Proc. TCC 2005, Lecture Notes in Computer Science 3378, pp. 86-103, Springer 2005. pdf

2004

• Michael Backes, Dennis Hofheinz: How to Break and Repair a Universally Composable Signature Functionality. Proc. ISC 2004, Lecture Notes in Computer Science 3225, pp. 61-72, Springer 2004. pdf
• Dennis Hofheinz, Jörn Müller-Quade: A synchronous model for multi-party computation and the incompleteness of oblivious transfer. Proc. FCS (LICS/ICALP affiliated workshop) 2004, TUCS general publications 31, pp. 117-130. pdf
• María Isabel González Vasco, Dennis Hofheinz, Consuelo Martínez, Rainer Steinwandt: On the Security of Two Public Key Cryptosystems Using Non-Abelian Groups. Des. Codes Cryptogr. 32(1-3):207-216. pdf
• Dennis Hofheinz, Jörn Müller-Quade: Universally Composable Commitments Using Random Oracles. Proc. TCC 2004, Lecture Notes in Computer Science 2951, pp. 58-76, Springer 2004. pdf

2003

• Dennis Hofheinz, Jörn Müller-Quade, Rainer Steinwandt: Initiator-Resilient Universally Composable Key Exchange. Proc. ESORICS 2003, Lecture Notes in Computer Science 2808, pp. 61-84, Springer 2003. pdf
• Dennis Hofheinz, Rainer Steinwandt: A Practical Attack on Some Braid Group Based Cryptographic Primitives. Proc. Public Key Cryptography 2003, Lecture Notes in Computer Science 2567, pp. 187-198, Springer 2002. pdf

2002

• Dennis Hofheinz, Rainer Steinwandt: A "differential" attack on Polly Cracker. Proc. ISIT 2002, p. 211, IEEE 2002. pdf