Zobrazeno 1 - 10
of 42
pro vyhledávání: '"DÖTTLING, NICO"'
Adversarial examples are a type of attack on machine learning (ML) systems which cause misclassification of inputs. Achieving robustness against adversarial examples is crucial to apply ML in the real world. While most prior work on adversarial examp
Externí odkaz:
http://arxiv.org/abs/2007.06993
Autor:
DÖTTLING, NICO1 nico.doettling@gmail.com, GARG, SANJAM2 sanjamg@berkeley.edu
Publikováno v:
Journal of the ACM. May2021, Vol. 68 Issue 3, p1-46. 46p.
The McEliece public-key encryption scheme has become an interesting alternative to cryptosystems based on number-theoretical problems. Differently from RSA and ElGa- mal, McEliece PKC is not known to be broken by a quantum computer. Moreover, even to
Externí odkaz:
http://arxiv.org/abs/1205.5224
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Advances in Cryptology – EUROCRYPT 2020
We show a new general approach for constructing maliciously-secure two-round oblivious transfer (OT). Specifically, we provide a generic sequence of transformations to upgrade a very basic notion of two-round OT, which we call elementary OT, to UC-se
Autor:
Brakerski, Zvika, Döttling, Nico
Publikováno v:
Advances in Cryptology – EUROCRYPT 2020
The hardness of the Learning with Errors (LWE) problem is by now a cornerstone of the cryptographic landscape. In many of its applications the so called “LWE secret” is not sampled uniformly, but comes from a distribution with some min-entropy. T
Autor:
Döttling, Nico, Dujmovic, Jesko
Fully homomorphic encryption (FHE) allows arbitrary computations on encrypted data. The standard security requirement, IND-CPA security, ensures that the encrypted data remain private. However, it does not guarantee privacy for the computation perfor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a3d3e47d506d862be9f897b8d7b521f
We construct indistinguishability obfuscation (iO) solely under circular-security properties of encryption schemes based on the Learning with Errors (LWE) problem. Circular-security assumptions were used before to construct (non-leveled) fully-homomo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::959fa0b578dea87f0653621b9ab03f4d
Publikováno v:
Advances in Cryptology – EUROCRYPT 2022 ISBN: 9783031070846
dvances in Cryptology-EUROCRYPT 2022-41th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2022
dvances in Cryptology-EUROCRYPT 2022-41th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2022
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c1d8fbb2b17d4a90ab90f52ba82d22b5
https://doi.org/10.1007/978-3-031-07085-3_6
https://doi.org/10.1007/978-3-031-07085-3_6