Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Fabrice Benhamouda"'
Autor:
Alex Nicita, Tal Malkin, Ghada Almashaqbeh, Seungwook Han, Eran Tromer, Fabrice Benhamouda, Abhishek Shah, Tal Rabin, Daniel Jaroslawicz
Publikováno v:
Proceedings on Privacy Enhancing Technologies, Vol 2021, Iss 4, Pp 528-548 (2021)
Existing models for non-interactive MPC cannot provide full privacy for inputs, because they inherently leak the residual function (i.e., the output of the function on the honest parties’ input together with all possible values of the adversarial i
Publikováno v:
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security.
Publikováno v:
Journal of Cryptology. 35
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030778699
EUROCRYPT (1)
EUROCRYPT (1)
We present an algorithm solving the ROS (Random inhomogeneities in a Overdetermined Solvable system of linear equations) problem mod p in polynomial time for \(\ell > \log p\) dimensions. Our algorithm can be combined with Wagner’s attack, and lead
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11b79fcea43a3bbe63cf5f3742ae45ab
https://doi.org/10.1007/978-3-030-77870-5_2
https://doi.org/10.1007/978-3-030-77870-5_2
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030778859
EUROCRYPT (2)
EUROCRYPT (2)
Motivated by the goal of designing versatile and flexible secure computation protocols that at the same time require as little interaction as possible, we present new multiparty reusable Non-Interactive Secure Computation (mrNISC) protocols. This not
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6516b4fe3ab05723ef2a0d24644bbe7a
https://doi.org/10.1007/978-3-030-77886-6_25
https://doi.org/10.1007/978-3-030-77886-6_25
Publikováno v:
Theory of Cryptography ISBN: 9783030904524
TCC (2)
TCC (2)
Secure multiparty computation (MPC) enables n parties, of which up to t may be corrupted, to perform joint computations on their private inputs while revealing only the outputs. Optimizing the asymptotic and concrete costs of MPC protocols has become
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d5a7999df90a076955d5d2154252ebbc
https://doi.org/10.1007/978-3-030-90453-1_5
https://doi.org/10.1007/978-3-030-90453-1_5
Publikováno v:
Proceedings on Privacy Enhancing Technologies, Vol 2021, Iss 1, Pp 188-208 (2021)
We propose Falcon, an end-to-end 3-party protocol for efficient private training and inference of large machine learning models. Falcon presents four main advantages - (i) It is highly expressive with support for high capacity networks such as VGG16
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4fd2f906345c0734e57adc4227762935
Autor:
Hugo Krawczyk, Shai Halevi, Craig Gentry, Tal Rabin, Leonid Reyzin, Sergey Gorbunov, Fabrice Benhamouda, Chengyu Lin
Publikováno v:
Theory of Cryptography ISBN: 9783030643744
TCC (1)
TCC (1)
Blockchains are gaining traction and acceptance, not just for cryptocurrencies, but increasingly as an architecture for distributed computing. In this work we seek solutions that allow a public blockchain to act as a trusted long-term repository of s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07e61faceec5d15474a03e4c5f7390a5
https://doi.org/10.1007/978-3-030-64375-1_10
https://doi.org/10.1007/978-3-030-64375-1_10
Autor:
Huijia Lin, Fabrice Benhamouda
Publikováno v:
Theory of Cryptography ISBN: 9783030643775
TCC (2)
TCC (2)
Reducing interaction in Multiparty Computation (MPC) is a highly desirable goal in cryptography. It is known that 2-round MPC can be based on the minimal assumption of 2-round Oblivious Transfer (OT) [Benhamouda and Lin, Garg and Srinivasan, EC 2018]
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e4045a6d9257a0b1d38da4ce66a67150
https://doi.org/10.1007/978-3-030-64378-2_13
https://doi.org/10.1007/978-3-030-64378-2_13
Publikováno v:
ASIACRYPT 2019-25th International Conference on the Theory and Application of Cryptology and Information Security
ASIACRYPT 2019-25th International Conference on the Theory and Application of Cryptology and Information Security, Dec 2019, Kobe, Japan. pp.386-412, ⟨10.1007/978-3-030-34621-8_14⟩
Lecture Notes in Computer Science ISBN: 9783030346201
ASIACRYPT (2)
[Technical Report] Report 2017/500, IACR Cryptology ePrint Archive. 2017
ASIACRYPT 2019-25th International Conference on the Theory and Application of Cryptology and Information Security, Dec 2019, Kobe, Japan. pp.386-412, ⟨10.1007/978-3-030-34621-8_14⟩
Lecture Notes in Computer Science ISBN: 9783030346201
ASIACRYPT (2)
[Technical Report] Report 2017/500, IACR Cryptology ePrint Archive. 2017
International audience; Due to the vast number of successful related-key attacks against existing block-ciphers, related-key security has become a common design goal for such primitives. In these attacks, the adversary is not only capable of seeing t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::801139fab98c251f5d0a568fc7072d17
https://hal.inria.fr/hal-02375594/document
https://hal.inria.fr/hal-02375594/document