Nico Döttling

Orcid: 0000-0002-5914-7635

According to our database1, Nico Döttling authored at least 88 papers between 2010 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Separating Pseudorandom Codes from Local Oracles.
IACR Cryptol. ePrint Arch., 2025

The Quantum Decoherence Model: Everlasting Composable Secure Computation and More.
IACR Cryptol. ePrint Arch., 2025

Minicrypt PIR for Big Batches.
IACR Cryptol. ePrint Arch., 2025

Everlasting Anonymous Rate-Limited Tokens.
IACR Cryptol. ePrint Arch., 2025

Laconic Cryptography with Preprocessing.
IACR Cryptol. ePrint Arch., 2025

Black-Box Non-interactive Zero Knowledge from Vector Trapdoor Hash.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Simple and General Counterexamples for Private-Coin Evasive LWE.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Rate-1 Statistical Non-interactive Zero-Knowledge.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Pseudorandom Obfuscation and Applications.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Private Laconic Oblivious Transfer with Preprocessing.
IACR Cryptol. ePrint Arch., 2024

Space-Lock Puzzles and Verifiable Space-Hard Functions from Root-Finding in Sparse Polynomials.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

Rate-1 Fully Local Somewhere Extractable Hashing from DDH.
Proceedings of the Public-Key Cryptography - PKC 2024, 2024

On the Black-Box Complexity of Correlation Intractability.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Two-Round Maliciously-Secure Oblivious Transfer with Optimal Rate.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

Signature-Based Witness Encryption with Compact Ciphertext.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

Practical Lattice-Based Distributed Signatures for a Small Number of Signers.
Proceedings of the Applied Cryptography and Network Security, 2024

2023
Laconic Function Evaluation for Turing Machines.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

McFly: Verifiable Encryption to the Future Made Practical.
Proceedings of the Financial Cryptography and Data Security, 2023

Efficient Laconic Cryptography from Learning with Errors.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

A Framework for Statistically Sender Private OT with Optimal Rate.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Post Quantum Fuzzy Stealth Signatures and Applications.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
IBE with Incompressible Master Secret and Small Identity Secrets.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Rate-1 Incompressible Encryption from Standard Assumptions.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Two-Round Oblivious Linear Evaluation from Learning with Errors.
Proceedings of the Public-Key Cryptography - PKC 2022, 2022

Interaction-Preserving Compilers for Secure Computation.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Algebraic Restriction Codes and Their Applications.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Factoring and Pairings Are Not Necessary for IO: Circular-Secure LWE Suffices.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Batch-OT with Optimal Rate.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Maliciously Circuit-Private FHE from Information-Theoretic Principles.
Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

Universal Ring Signatures in the Standard Model.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021
On the Impossibility of Short Algebraic Signatures.
IACR Cryptol. ePrint Arch., 2021

On the Impossibility of Purely Algebraic Signatures.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Rate-1 Quantum Fully Homomorphic Encryption.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Laconic Private Set Intersection and Applications.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Universal Proxy Re-Encryption.
Proceedings of the Public-Key Cryptography - PKC 2021, 2021

Multiparty Cardinality Testing for Threshold Private Intersection.
Proceedings of the Public-Key Cryptography - PKC 2021, 2021

2020
Multiparty Cardinality Testing for Threshold Private Set Intersection.
IACR Cryptol. ePrint Arch., 2020

Adversarial Examples and Metrics.
CoRR, 2020

Lossiness and Entropic Hardness for Ring-LWE.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Constant Ciphertext-Rate Non-committing Encryption from Standard Assumptions.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Tight Verifiable Delay Functions.
Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Two-Round Oblivious Transfer from CDH or LPN.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Candidate iO from Homomorphic Encryption Schemes.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Hardness of LWE on General Entropic Distributions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Verifiable Timed Signatures Made Practical.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

A Combinatorial Approach to Quantum Random Functions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

Minting Mechanism for Proof of Stake Blockchains.
Proceedings of the Applied Cryptography and Network Security, 2020

2019
Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Laconic Conditional Disclosure of Secrets and Applications.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Incremental Proofs of Sequential Work.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Continuous Non-Malleable Codes in the 8-Split-State Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Ring Signatures: Logarithmic-Size, No Setup - from Standard Assumptions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Trapdoor Hash Functions and Their Applications.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Rate-1 Trapdoor Functions from the Diffie-Hellman Problem.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

Efficient UC Commitment Extension with Homomorphism for Free (and Applications).
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018
Minting Mechanisms for Blockchain - or - Moving from Cryptoassets to Cryptocurrencies.
IACR Cryptol. ePrint Arch., 2018

Two-Message Statistical Sender-Private OT from LWE.
IACR Cryptol. ePrint Arch., 2018

Two-Message Statistically Sender-Private OT from LWE.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

Obfuscation from Low Noise Multilinear Maps.
Proceedings of the Progress in Cryptology - INDOCRYPT 2018, 2018

2017
Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model.
Electron. Colloquium Comput. Complex., 2017

From Selective IBE to Full IBE and Selective HIBE.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model.
Proceedings of the Information Theoretic Security - 10th International Conference, 2017

Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Concurrently Composable Security with Shielded Super-Polynomial Simulators.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Identity-Based Encryption from the Diffie-Hellman Assumption.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Laconic Oblivious Transfer and Its Applications.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016
Low Noise LPN: Key dependent message secure public key encryption an sample amplification.
IET Inf. Secur., 2016

Secure Multiparty Interactive Communication with Unknown Noise Rate.
CoRR, 2016

Two-Message, Oblivious Evaluation of Cryptographic Functionalities.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Rate-1, Linear Time and Additively Homomorphic UC Commitments.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015
General Statistically Secure Computation with Bounded-Resettable Hardware Tokens.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions.
Proceedings of the Provable Security, 2015

Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification.
Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Efficient Pseudorandom Functions via On-the-Fly Adaptation.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
Cryptography based on the Hardness of Decoding.
PhD thesis, 2014

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

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

2012
A CCA2 Secure Variant of the McEliece Cryptosystem.
IEEE Trans. Inf. Theory, 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 Cryptol. ePrint Arch., 2012

Statistically Secure Linear-Rate Dimension Extension for Oblivious Affine Function Evaluation.
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
Basing Obfuscation on Simple Tamper-Proof Hardware Assumptions.
IACR Cryptol. ePrint Arch., 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

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

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


  Loading...