Folgen
Nico Döttling
Nico Döttling
Faculty at the Helmholtz Center for Information Security (CISPA)
Bestätigte E-Mail-Adresse bei cispa.de - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Identity-based encryption from the Diffie-Hellman assumption
N Döttling, S Garg
Advances in Cryptology–CRYPTO 2017: 37th Annual International Cryptology …, 2017
1622017
Trapdoor hash functions and their applications
N Döttling, S Garg, Y Ishai, G Malavolta, T Mour, R Ostrovsky
Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology …, 2019
812019
Two-message statistically sender-private OT from LWE
Z Brakerski, N Döttling
Theory of Cryptography: 16th International Conference, TCC 2018, Panaji …, 2018
802018
Laconic oblivious transfer and its applications
C Cho, N Döttling, S Garg, D Gupta, P Miao, A Polychroniadou
Advances in Cryptology–CRYPTO 2017: 37th Annual International Cryptology …, 2017
742017
Leveraging linear decryption: Rate-1 fully-homomorphic encryption and time-lock puzzles
Z Brakerski, N Döttling, S Garg, G Malavolta
Theory of Cryptography: 17th International Conference, TCC 2019, Nuremberg …, 2019
702019
Linear secret sharing schemes from error correcting codes and universal hash functions
R Cramer, IB Damgård, N Döttling, S Fehr, G Spini
Advances in Cryptology-EUROCRYPT 2015: 34th Annual International Conference …, 2015
702015
Unconditional and composable security using a single stateful tamper-proof hardware token
N Döttling, D Kraschewski, J Müller-Quade
Theory of Cryptography: 8th Theory of Cryptography Conference, TCC 2011 …, 2011
692011
Lossy codes and a new variant of the learning-with-errors problem
N Döttling, J Müller-Quade
Advances in Cryptology–EUROCRYPT 2013: 32nd Annual International Conference …, 2013
632013
IND-CCA secure cryptography based on a variant of the LPN problem
N Döttling, J Müller-Quade, ACA Nascimento
Advances in Cryptology–ASIACRYPT 2012: 18th International Conference on the …, 2012
612012
From selective IBE to full IBE and selective HIBE
N Döttling, S Garg
Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore …, 2017
592017
Factoring and pairings are not necessary for io: Circular-secure lwe suffices
Z Brakerski, N Döttling, S Garg, G Malavolta
Cryptology ePrint Archive, 2020
562020
New constructions of identity-based and key-dependent message secure encryption schemes
N Döttling, S Garg, M Hajiabadi, D Masny
Public-Key Cryptography–PKC 2018: 21st IACR International Conference on …, 2018
562018
Candidate iO from homomorphic encryption schemes
Z Brakerski, N Döttling, S Garg, G Malavolta
Advances in Cryptology–EUROCRYPT 2020: 39th Annual International Conference …, 2020
552020
Cryptanalysis of indistinguishability obfuscations of circuits over GGH13
D Apon, N Döttling, S Garg, P Mukherjee
Cryptology ePrint Archive, 2016
552016
A CCA2 secure variant of the McEliece cryptosystem
N Dottling, R Dowsley, J Muller-Quade, ACA Nascimento
IEEE Transactions on Information Theory 58 (10), 6672-6680, 2012
522012
Ring signatures: logarithmic-size, no setup—from standard assumptions
M Backes, N Döttling, L Hanzlik, K Kluczniak, J Schneider
Advances in Cryptology–EUROCRYPT 2019: 38th Annual International Conference …, 2019
472019
Two-round oblivious transfer from CDH or LPN
N Döttling, S Garg, M Hajiabadi, D Masny, D Wichs
Advances in Cryptology–EUROCRYPT 2020: 39th Annual International Conference …, 2020
452020
TinyOLE: Efficient actively secure two-party computation from oblivious linear function evaluation
N Döttling, S Ghosh, JB Nielsen, T Nilges, R Trifiletti
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017
422017
Rate-1, linear time and additively homomorphic UC commitments
I Cascudo, I Damgård, B David, N Döttling, JB Nielsen
Advances in Cryptology–CRYPTO 2016: 36th Annual International Cryptology …, 2016
422016
Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens.
N Döttling, T Mie, J Müller-Quade, T Nilges
TCC 7785, 642-661, 2013
362013
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20