Nico Döttling

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Identity-based Encryption from the Diffie-Hellman Assumption.
J. ACM, 2021

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

Laconic Private Set Intersection and Applications.
IACR Cryptol. ePrint Arch., 2021

Algebraic Restriction Codes and their Applications.
IACR Cryptol. ePrint Arch., 2021

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

2020
Verifiable Timed Signatures Made Practical.
IACR Cryptol. ePrint Arch., 2020

A Combinatorial Approach to Quantum Random Functions.
IACR Cryptol. ePrint Arch., 2020

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

Two-Round Oblivious Linear Evaluation from Learning with Errors.
IACR Cryptol. ePrint Arch., 2020

Factoring and Pairings are not Necessary for iO: Circular-Secure LWE Suffices.
IACR Cryptol. ePrint Arch., 2020

Candidate iO from Homomorphic Encryption Schemes.
IACR Cryptol. ePrint Arch., 2020

Lossiness and Entropic Hardness for Ring-LWE.
IACR Cryptol. ePrint Arch., 2020

Hardness of LWE on General Entropic Distributions.
IACR Cryptol. ePrint Arch., 2020

Constant Ciphertext-Rate Non-Committing Encryption from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2020

Adversarial Examples and Metrics.
CoRR, 2020

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

2019
Incremental Proofs of Sequential Work.
IACR Cryptol. ePrint Arch., 2019

Tight Verifiable Delay Functions.
IACR Cryptol. ePrint Arch., 2019

Trapdoor Hash Functions and Their Applications.
IACR Cryptol. ePrint Arch., 2019

Two-Round Oblivious Transfer from CDH or LPN.
IACR Cryptol. ePrint Arch., 2019

Rate-1 Trapdoor Functions from the Diffie-Hellman Problem.
IACR Cryptol. ePrint Arch., 2019

Laconic Conditional Disclosure of Secrets and Applications.
IACR Cryptol. ePrint Arch., 2019

Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles.
IACR Cryptol. ePrint Arch., 2019

Ring Signatures: Logarithmic-Size, No Setup - from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2019

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

2018
Universal Proxy Re-Encryption.
IACR Cryptol. ePrint Arch., 2018

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

Efficient UC Commitment Extension with Homomorphism for Free (and Applications).
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

2017
TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation.
IACR Cryptol. ePrint Arch., 2017

New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes.
IACR Cryptol. ePrint Arch., 2017

From Selective IBE to Full IBE and Selective HIBE.
IACR Cryptol. ePrint Arch., 2017

Two-Message, Oblivious Evaluation of Cryptographic Functionalities.
IACR Cryptol. ePrint Arch., 2017

Laconic Oblivious Transfer and its Applications.
IACR Cryptol. ePrint Arch., 2017

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

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

From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions.
IACR Cryptol. ePrint Arch., 2016

Obfuscation from Low Noise Multilinear Maps.
IACR Cryptol. ePrint Arch., 2016

Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model.
IACR Cryptol. ePrint Arch., 2016

Rate-1, Linear Time and Additively Homomorphic UC Commitments.
IACR Cryptol. ePrint Arch., 2016

Concurrently Composable Security With Shielded Super-polynomial Simulators.
IACR Cryptol. ePrint Arch., 2016

Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13.
IACR Cryptol. ePrint Arch., 2016

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

2015
Efficient Pseudorandom Functions via On-the-Fly Adaptation.
IACR Cryptol. ePrint Arch., 2015

Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification.
IACR Cryptol. ePrint Arch., 2015

Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions.
IACR Cryptol. ePrint Arch., 2015

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

General Statistically Secure Computation with Bounded-Resettable Hardware Tokens.
IACR Cryptol. ePrint Arch., 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...