Nico Döttling

Research Homepage

I am a faculty at the Helmholtz Center for Information Security (CISPA) in Saarbrücken, here's a link to the site of my research group. The focus of my research is public key encryption and secure two-party computation.

From 2017 to 2018 I was assistant professor at the Friedrich-Alexander-University Erlangen Nürnberg. Prior to that, I was a postdoc in the group of Sanjam Garg at UC Berkeley, supported by a DAAD fellowship from 2016 to 2017 and a postdoc in the crypto group of Aarhus University, working with Ivan Damgård and Jesper Buus Nielsen form 2014 to 2016. I finished my PhD in 2014 at the Karlsruhe Institute of Technology under the supervision of Jörn Müller-Quade. I am the 2014 winner of the biennial Erika and Dr. Wolfgang Eichelberger Dissertation Award.

You can contact me via

nico dot doettling at gmail dot com

I do not answer to generic, unpersonalized job applications

Program Committees

  • CRYPTO 2017, 2019, 2022

  • EUROCRYPT 2016, 2018

  • ASIACRYPT 2015, 2016, 2017, 2018, 2022

  • TCC 2015, 2016b, 2019, 2020

  • PKC 2017, 2018, 2019, 2022

  • ProvSec 2014, 2016

  • ICITS 2016

  • ACNS 2021/2022

Projects

  • ERC Starting Grant Project Next Generation Laconic Cryptography/LACONIC (PI, 2022-2026)

  • German Cybersecurity Agency Project Encrypted Computing Compass (PI, 2022)

  • Helmholtz Pilot Project Trusted Federated Data Analytics (Co-PI, 2020-2023)

Thesis

My PhD thesis, available here, is about the construction of advanced cryptographic primitives from coding problems.

Picture by CISPA/Tobias Ebelshäuser

Conference Publications

  • Maliciously Circuit-Private FHE from Information-Theoretic Principles; Nico Döttling, Jesko Dujmovic; ITC 2022

  • Factoring and Pairings are not Necessary for iO: Circular-SEcure LWE Suffices; Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta; ICALP 2022

  • Batch OT with Optimal Rate; Zvika Brakerski, Pedro Branco, Nico Döttling, Sihang Pu; EUROCRYPT 2022

  • Two-Round Oblivious Linear Evaluation from Learning with Errors; Pedro Branco, Nico Döttling, Paulo Mateus; PKC 2022

  • Interaction-Preserving Compilers for Secure Computation; Nico Döttling, Vipul Goyal, Giulio Malavolta, Justin Raizes; ITCS 2022

  • Algebraic Restriction Codes and their Applications; Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski; ITCS 2022

  • Laconic Private Set Intersection and Applications; Navid Alamati, Pedro Branco, Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Sihang Pu; TCC 2021

  • Rate-1 Quantum Full Homomorphic Encryption; Orestis Chardouvelis; Nico Döttling; Giulio Malavolta; TCC 2021

  • On the Impossibility of Purely Algebraic Signatures; Nico Döttling, Dominik Hartmann, Dennis Hofheinz, Eike Kiltz, Sven Schäge, Bogdan Ursu; TCC 2021

  • Universal Proxy Re-Encryption; Nico Döttling, Ryo Nishimaki; PKC 2021

  • Multiparty Cardinality Testing for Threshold Private Set Intersection; Pedro Branco, Nico Döttling, Sihang Pu; PKC 2021

  • Constant-Rate Non-Committing Encryption from Standard Assumptions; Zvika Brakerski, Pedro Branco, Nico Döttling, Sanjam Garg, Giulio Malavolta; TCC 2020

  • Lossiness and Entropic Hardness of Ring LWE; Zvika Brakerski, Nico Döttling; TCC 2020

  • A Combinatorial Approach to Quantum Random Functions; Nico Döttling, Giulio Malavolta, Sihang Pu; ASIACRYPT 2020

  • Tight Verifiable Delay Functions; Nico Döttling, Sanjam Garg, Giulio Malavolta, and Prashant Nalini Vasudevan; SCN 2020

  • Verifiable Timed Signatures Made Practical; Sri Aravinda Krishnan Thyagarajan, Adithya Bhat, Giulio Malavolta, Nico Döttling, Aniket Kate, and Dominique Schröder; CCS 2020

  • Minting Mechanisms for (PoS) Blockchains; Dominic Deuber, Nico Döttling, Bernardo Magri, Giulio Malavolta, and Sri Aravinda Krishnan Thyagarajan; ACNS 2020

  • Hardness of LWE on General Entropic Distribution; Zvika Brakerski, Nico Döttling; EUROCRYPT 2020

  • Two-Round Oblivious Transfer from CDH or LPN; Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny, Daniel Wichs; EUROCRYPT 2020

  • Candidate iO from Homomorphic Encryption Schemes; Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta; EUROCRYPT 2020; Invited to Journal of Cryptology

  • Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles; Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta; TCC 2019

  • Rate-1 Trapdoor Functions from the Diffie-Hellman Problem; Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Kevin Liu, Giulio Malavolta; ASIACRYPT 2019

  • Efficient UC Commitment Extension with Homomorphism for Free (and Applications); Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Rafael Dowsley, Irene Giacomelli; ASIACRYPT 2019

  • Laconic Conditional Disclosure of Secrets and Applications; Nico Döttling, Sanjam Garg, Vipul Goyal, Giulio Malavolta; FOCS 2019

  • Trapdoor Hash Functions and their Applications; Nico Döttling, Sanjam Garg, Yuval Ishai, Giulio Malavolta, Tamer Mour, Rafail Ostrovsky; CRYPTO 2019

  • Ring Signatures: Logarithmic Size, No Setup -- from Standard Assumption; Michael Backes, Nico Döttling, Lucjan Hanzlik, Kamil Kluczniak, Jonas Schneider; EUROCRYPT 2019

  • Continuous Non-Malleable Codes in the 8-Split-State Model; Divesh Aggarwal, Nico Döttling, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto; EUROCRYPT 2019

  • Incremental Proofs of Sequential Work; Nico Döttling, Russell Lai, Giulio Malavolta; EUROCRYPT 2019

  • Obfuscation from Low Noise Multilinear Maps; Nico Döttling, Sanjam Garg, Divya Gupta, Peihan Miao, Pratyay Mukherjee; INDOCRYPT 2018 (eprint)

  • Two-Message Statistical Sender-Private OT from LWE; Zvika Brakerski and Nico Döttling; TCC 2018; Invited to Journal of Cryptology (eprint)

  • New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes; Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny; PKC 2018 (eprint)

  • Linear-Time Non-Malleable Codes in the Bit-Wise Tampering Model; Ronald Cramer, Ivan Damgård, Nico Döttling, Irene Giacomelli, Chaoping Xing; ICITS 2017 (eprint)

  • From Selective IBE to Full IBE and Selective HIBE; Nico Döttling and Sanjam Garg; TCC 2017 (eprint)

  • TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation; Nico Döttling, Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges and Roberto Trifiletti; CCS 2017 (eprint)

  • Identity-Based Encryption from the Diffie-Hellman Assumption; Nico Döttling and Sanjam Garg; CRYPTO 2017 Best Paper Award, Invited to Journal of Cryptology (eprint)

  • Laconic Receiver Oblivious Transfer and Its Applications; Chongwon Cho, Nico Döttling, Sanjam Garg, Divya Gupta, Peihan Miao and Antigoni Polychroniadou; CRYPTO 2017 (eprint)

  • Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13; Daniel Apon, Nico Döttling, Sanjam Garg and Pratyay Mukherjee; ICALP 2017 (eprint)

  • Concurrently composable security with shielded super-polynomial simulators; Brandon Broadnax, Nico Döttling, Gunnar Hartung, Matthias Nagel and Jörn Müller-Quade; EUROCRYPT 2017 (eprint)

  • Two Message Oblivious Evaluation of Cryptographic Functionalities; Nico Döttling, Nils Fleischhacker, Johannes Krupp and Dominique Schröder; CRYPTO 2016 (eprint)

  • Rate-1, Linear Time and Additively Homomorphic UC Commitments; Ignacio Cascudo, Bernardo David, Ivan Damgård, Nico Döttling and Jesper Buus Nielsen; CRYPTO 2016 (eprint)

  • From stateful hardware to resettable hardware using symmetric assumptions; Nico Döttling, Daniel Kraschewski, Jörn Müller-Quade and Tobias Nilges; ProvSec 2015. Best Paper Award (eprint)

  • Efficient Pseudorandom Functions via On-the-Fly Adaptation; Nico Döttling and Dominique Schröder; CRYPTO 2015 (eprint)

  • Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions; Ronald Cramer, Ivan Damgård, Nico Döttling, Serge Fehr and Gabriele Spini; EUROCRYPT 2015 (eprint)

  • General Statistically Secure Computation with Bounded-Resettable Hardware Tokens; Nico Döttling, Daniel Kraschewski, Jörn Müller-Quade and Tobias Nilges; TCC 2015 (eprint)

  • Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification; Nico Döttling; PKC 2015 (eprint)

  • Lossy Codes and a New Variant of the Learning-With-Errors Problem; Nico Döttling and Jörn Müller-Quade; EUROCRYPT 2013

  • Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens; Nico Döttling, Thilo Mie, Jörn Müller-Quade and Tobias Nilges; TCC 2013

  • IND-CCA Secure Cryptography based on a Variant of the LPN Problem; Nico Döttling, Jörn Müller-Quade and Anderson Nascimento; ASIACRYPT 2012

  • Statistically Secure Linear-rate Dimension Extension for Oblivious Affine Function Evaluation; Nico Döttling, Daniel Kraschewski and Jörn Müller-Quade; ICITS 2012

  • Efficient Reductions for Non-Signaling Cryptographic Primitives; Nico Döttling, Daniel Kraschewski and Jörn Müller-Quade; ICITS 2011

  • Unconditional and Composable Security using a single Stateful Tamper-Proof Hardware Token; Nico Döttling, Daniel Kraschewski and Jörn Müller-Quade ; TCC 2011

  • Vulnerabilities of Wireless Key Exchange based on Channel Reciprocity; Nico Döttling, Dejan Lazich, Jörn Müller-Quade and Antonio Almeida; WISA 2010

Journal Publications

  • Identity-based Encryption from the Diffie-Hellman Assumption; Nico Döttling and Sanjam Garg; Journal of the ACM (link)

  • Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification; Nico Döttling; IET Information Security, 2016 (Invited) (eprint)

  • A CCA2 Secure Variant of the McEliece Cryptosystem; Nico Döttling, Rafael Dowsley, Jörn Müller-Quade and Anderson Nascimento; IEEE Transactions on Information Theory, 58(10):6672–6680, 2012. (eprint)

You can also find some of my publications on my Google Scholar profile.

Teaching