% Encoding: UTF-8
@COMMENT{BibTeX export based on data in FAU CRIS: https://cris.fau.de/}
@COMMENT{For any questions please write to cris-support@fau.de}
@book{faucris.119663544,
author = {Döttling, Nico and et al.},
author_hint = {Cramer R., Damgård I., Döttling N., Fehr S., Spini G.},
doi = {10.1007/978-3-662-46803-6_11},
faupublication = {no},
isbn = {9783662468029},
keywords = {Linear Secret Sharing Schemes; Linear Time Sharing; Robust Secret Sharing},
pages = {313-336},
peerreviewed = {unknown},
publisher = {Springer Verlag},
support_note = {Author relations incomplete. You may find additional data in field 'author_hint'},
title = {{Linear} secret sharing schemes from error correcting codes and universal hash functions},
volume = {9057},
year = {2015}
}
@book{faucris.120829324,
author = {Döttling, Nico and et al.},
author_hint = {Döttling N., Garg S.},
doi = {10.1007/978-3-319-63688-7_18},
faupublication = {no},
isbn = {9783319636870},
pages = {537-569},
peerreviewed = {unknown},
publisher = {Springer Verlag},
support_note = {Author relations incomplete. You may find additional data in field 'author_hint'},
title = {{Identity}-based encryption from the diffie-hellman assumption},
year = {2017}
}
@book{faucris.120827784,
author = {Döttling, Nico and et al.},
author_hint = {Broadnax B., Döttling N., Hartung G., Müller-Quade J., Nagel M.},
doi = {10.1007/978-3-319-56620-7_13},
faupublication = {no},
isbn = {9783319566191},
pages = {351-381},
peerreviewed = {unknown},
publisher = {Springer Verlag},
support_note = {Author relations incomplete. You may find additional data in field 'author_hint'},
title = {{Concurrently} composable security with shielded super-polynomial simulators},
year = {2017}
}
@book{faucris.113832664,
author = {Döttling, Nico and et al.},
author_hint = {Döttling N., Kraschewski D., Müller-Quade J., Nilges T.},
doi = {10.1007/978-3-319-26059-4_2},
faupublication = {no},
keywords = {Protocol compilers; Tamper-proof hardware; Universal composability},
pages = {23-42},
publisher = {Springer Verlag},
support_note = {Author relations incomplete. You may find additional data in field 'author_hint'},
title = {{From} stateful hardware to resettable hardware using symmetric assumptions},
volume = {9451},
year = {2015}
}
@book{faucris.109759364,
author = {Döttling, Nico and et al.},
author_hint = {Döttling N., Müller-Quade J., Nascimento A.},
doi = {10.1007/978-3-642-34961-4_30},
faupublication = {no},
isbn = {9783642349607},
keywords = {All-but-one decryption; IND-CCA2 security; Learning parity with noise},
pages = {485-503},
peerreviewed = {unknown},
support_note = {Author relations incomplete. You may find additional data in field 'author_hint'},
title = {{IND}-{CCA} secure cryptography based on a variant of the {LPN} problem},
year = {2012}
}
@book{faucris.120830204,
author = {Döttling, Nico and et al.},
author_hint = {Döttling N., Mie T., Müller-Quade J., Nilges T.},
doi = {10.1007/978-3-642-36594-2_36},
faupublication = {no},
isbn = {9783642365935},
keywords = {Resettably secure computation; Tamper-Proof hardware; Universal Composability},
pages = {642-661},
peerreviewed = {unknown},
support_note = {Author relations incomplete. You may find additional data in field 'author_hint'},
title = {{Implementing} resettable {UC}-functionalities with untrusted tamper-proof hardware-tokens},
year = {2013}
}
@book{faucris.107789264,
abstract = {Pseudorandom functions (PRFs) are one of the most fundamental building blocks in cryptography with numerous applications such as message authentication codes and private key encryption. In this work, we propose a new framework to construct PRFs with the overall goal to build efficient PRFs from standard assumptions with an almost tight proof of security. The main idea of our framework is to start from a PRF for any small domain (i.e. poly-sized domain) and turn it into an l-bounded pseudorandom function, i.e., into a PRF whose outputs are pseudorandom for the first l distinct queries to F. In the second step, we apply a novel technique which we call on-the-fly adaptation that turns any bounded PRF into a fully-fledged (large domain) PRF. Both steps of our framework have a tight security reduction, meaning that any successful attacker can be turned into an efficient algorithm for the underlying hard computational problem without any significant increase in the running time or loss of success probability. Instantiating our framework with specific number theoretic assumptions, we construct a PRF based on k-LIN (and thus DDH) that is faster than all known constructions, which reduces almost tightly to the underlying problem, and which has shorter keys.Instantiating our framework with general assumptions, we construct a PRF with very flat circuits whose security tightly reduces to the security of some small domain PRF.},
author = {Döttling, Nico and Schröder, Dominique},
doi = {10.1007/978-3-662-47989-6_16},
faupublication = {no},
isbn = {9783662479889},
keywords = {DDH; Efficient reductions; K-LIN; LWE; Pseudorandom functions},
pages = {329-350},
peerreviewed = {Yes},
publisher = {Springer Verlag},
series = {Advances in Cryptology - CRYPTO 2015},
title = {{Efficient} pseudorandom functions via on-the-fly adaptation},
volume = {9215},
year = {2015}
}
@article{faucris.106594664,
author = {Döttling, Nico},
doi = {10.1049/iet-ifs.2015.0495},
faupublication = {no},
journal = {IET Information Security},
pages = {372-385},
peerreviewed = {Yes},
title = {{Low} {Noise} {LPN}: {Key} dependent message secure public key encryption an sample amplification},
volume = {10},
year = {2016}
}
@book{faucris.120653764,
author = {Döttling, Nico and et al.},
author_hint = {Cascudo I., Damgård I., David B., Döttling N., Nielsen J.},
doi = {10.1007/978-3-662-53015-3_7},
faupublication = {no},
isbn = {9783662530146},
pages = {179-207},
publisher = {Springer Verlag},
support_note = {Author relations incomplete. You may find additional data in field 'author_hint'},
title = {{Rate}-1, linear time and additively homomorphic {UC} commitments},
volume = {9816},
year = {2016}
}
@article{faucris.113831344,
author = {Döttling, Nico and et al.},
author_hint = {Dottling N., Dowsley R., Muller-Quade J., Nascimento A.},
doi = {10.1109/TIT.2012.2203582},
faupublication = {no},
journal = {IEEE Transactions on Information Theory},
keywords = {CCA2 security; McEliece assumptions; public-key encryption; standard model},
pages = {6672-6680},
peerreviewed = {Yes},
support_note = {Author relations incomplete. You may find additional data in field 'author_hint'},
title = {{A} {CCA2} secure variant of the mceliece cryptosystem},
volume = {58},
year = {2012}
}
@book{faucris.119664204,
author = {Döttling, Nico and et al.},
author_hint = {Döttling N., Kraschewski D., Müller-Quade J.},
doi = {10.1007/978-3-642-19571-6_11},
faupublication = {no},
isbn = {9783642195709},
keywords = {Information-Theoretical Security; Secure Two-Party Computation; Tamper-Proof Hardware; Universal Composability},
pages = {164-181},
support_note = {Author relations incomplete. You may find additional data in field 'author_hint'},
title = {{Unconditional} and composable security using a single stateful tamper-proof hardware token},
year = {2011}
}
@book{faucris.107802244,
abstract = {We study the problem of two round oblivious evaluation of cryptographic functionalities. In this setting, one party P holds a private key sk for a provably secure instance of a cryptographic functionality F and the second party P wishes to evaluate F on a value x. Although it has been known for 22 years that general functionalities cannot be computed securely in the presence of malicious adversaries with only two rounds of communication, we show the existence of a round optimal protocol that obliviously evaluates cryptographic functionalities. Our protocol is provably secure against malicious receivers under standard assumptions and does not rely on heuristic (setup) assumptions. Our main technical contribution is a novel nonblack-box technique, which makes nonblack-box use of the security reduction of F. Specifically, our proof of malicious receiver security uses the code of the reduction, which reduces the security of F to some hard problem, in order to break that problem directly. Instantiating our framework, we obtain the first two-round oblivious pseudorandom function that is secure in the standard model. This question was left open since the invention of OPRFs in 1997.},
address = {Heidelberg},
author = {Döttling, Nico and Fleischhacker, Nils and Krupp, Johannes and Schröder, Dominique},
doi = {10.1007/978-3-662-53015-3_22},
faupublication = {no},
isbn = {9783662530146},
keywords = {two-party computation, blind signature, oblivious pseudorandom functions},
pages = {619-648},
peerreviewed = {Yes},
publisher = {Springer Verlag},
series = {Advances in Cryptology – CRYPTO 2016. CRYPTO 2016.},
title = {{Two}-message, oblivious evaluation of cryptographic functionalities},
volume = {9816},
year = {2016}
}
@inproceedings{faucris.119662224,
author = {Döttling, Nico and et al.},
author_hint = {Apon D., Döttling N., Garg S., Mukherjee P.},
booktitle = {44th International Colloquium on Automata, Languages, and Programming, ICALP 2017},
doi = {10.4230/LIPIcs.ICALP.2017.38},
faupublication = {no},
isbn = {9783959770415},
keywords = {Cryptanalysis; Multilinear maps; Obfuscation},
peerreviewed = {unknown},
publisher = {Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing},
support_note = {Author relations incomplete. You may find additional data in field 'author_hint'},
title = {{Cryptanalysis} of indistinguishability obfuscations of circuits over {GGH13}},
volume = {80},
year = {2017}
}
@book{faucris.120832844,
author = {Döttling, Nico and et al.},
author_hint = {Döttling N., Lazich D., Müller-Quade J., de Almeida A.},
doi = {10.1007/978-3-642-17955-6_15},
faupublication = {no},
isbn = {9783642179549},
keywords = {antenna reradiation; channel reciprocity; joint randomness; physical layer; side-channel attacks; Wireless key exchange},
pages = {206-220},
publisher = {Springer Verlag},
support_note = {Author relations incomplete. You may find additional data in field 'author_hint'},
title = {{Vulnerabilities} of {Wireless} {Key} {Exchange} {Based} on {Channel} {Reciprocity}},
year = {2011}
}
@book{faucris.120831524,
author = {Döttling, Nico and et al.},
author_hint = {Döttling N., Kraschewski D., Müller-Quade J.},
doi = {10.1007/978-3-642-32284-6_7},
faupublication = {no},
isbn = {9783642322839},
keywords = {garbled arithmetic circuits; information-theoretic reductions; oblivious transfer; secure function evaluation; universal composability},
pages = {111-128},
support_note = {Author relations incomplete. You may find additional data in field 'author_hint'},
title = {{Statistically} secure linear-rate dimension extension for oblivious affine function evaluation},
year = {2012}
}
@book{faucris.119662444,
author = {Döttling, Nico and et al.},
author_hint = {Döttling N., Kraschewski D., Müller-Quade J.},
doi = {10.1007/978-3-642-20728-0_12},
faupublication = {no},
isbn = {9783642207273},
keywords = {Efficient Reductions; Non-local Boxes; One-Time Memories; Statistical Security},
pages = {120-137},
peerreviewed = {unknown},
support_note = {Author relations incomplete. You may find additional data in field 'author_hint'},
title = {{Efficient} reductions for non-signaling cryptographic primitives},
year = {2011}
}
@book{faucris.119663764,
author = {Döttling, Nico and et al.},
author_hint = {Döttling N., Müller-Quade J.},
doi = {10.1007/978-3-642-38348-9_2},
faupublication = {no},
isbn = {9783642383472},
keywords = {Learning-With-Errors; Uniform Interval Error-Distribution; Worst-Case Reduction},
pages = {18-34},
peerreviewed = {unknown},
support_note = {Author relations incomplete. You may find additional data in field 'author_hint'},
title = {{Lossy} codes and a new variant of the learning-with-errors problem},
year = {2013}
}
@book{faucris.110290004,
author = {Döttling, Nico and et al.},
author_hint = {Cho C., Döttling N., Garg S., Gupta D., Miao P., Polychroniadou A.},
doi = {10.1007/978-3-319-63715-0_2},
faupublication = {no},
isbn = {9783319637143},
pages = {33-65},
peerreviewed = {unknown},
publisher = {Springer Verlag},
support_note = {Author relations incomplete. You may find additional data in field 'author_hint'},
title = {{Laconic} {Oblivious} {Transfer} and {Its} {Applications}},
year = {2017}
}
@book{faucris.120828444,
author = {Döttling, Nico and et al.},
author_hint = {Döttling N., Kraschewski D., Müller-Quade J., Nilges T.},
faupublication = {no},
isbn = {9783662464939},
pages = {319-344},
peerreviewed = {unknown},
publisher = {Springer Verlag},
support_note = {Author relations incomplete. You may find additional data in field 'author_hint'},
title = {{General} statistically secure computation with bounded-resettable hardware tokens},
url = {https://www.scopus.com/record/display.uri?eid=2-s2.0-84924689911&origin=inward},
volume = {9014},
year = {2015}
}