Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Aner Ben-Efraim"'
Publikováno v:
Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security.
Autor:
František Matúš, Aner Ben-Efraim
Publikováno v:
Kybernetika. :934-947
Autor:
Kelong Cong, Nigel P. Smart, Eduardo Soria-Vazquez, Aner Ben-Efraim, Eran Omri, Emmanuela Orsini
Publikováno v:
Advances in Cryptology-EUROCRYPT 2021
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2021
Lecture Notes in Computer Science ISBN: 9783030778828
EUROCRYPT (3)
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2021
Lecture Notes in Computer Science ISBN: 9783030778828
EUROCRYPT (3)
We (MPC) protocol based on garbled circuits which is both actively secure and supports the free-XOR technique, and which has communication complexity O(n) per party. This improves on a protocol of Ben-Efraim, Lindell and Omri which only achieved pass
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dcc1a33e7324f8ef2428e968cbd84765
https://lirias.kuleuven.be/handle/123456789/676596
https://lirias.kuleuven.be/handle/123456789/676596
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Politècnica de Catalunya (UPC)
Linear information and rank inequalities as, for instance, Ingleton inequality, are useful tools in information theory and matroid theory. Even though many such inequalities have been found, it seems that most of them remain undiscovered. Improved re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::22ddc591a91c007ad5a138cf15570d81
Publikováno v:
Applied Cryptography and Network Security ISBN: 9783030215675
ACNS
ACNS
Secure multiparty computation allows a set of mutually distrusting parties to securely compute a function of their private inputs, revealing only the output, even if some of the parties are corrupt. Recent years have seen an enormous amount of work t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5d79767e2f5b725c909a13ac817091c
https://doi.org/10.1007/978-3-030-21568-2_26
https://doi.org/10.1007/978-3-030-21568-2_26
Autor:
Eran Omri, Aner Ben-Efraim
Publikováno v:
Progress in Cryptology – LATINCRYPT 2017 ISBN: 9783030252823
LATINCRYPT
LATINCRYPT
Secure multiparty computation is becoming a necessary component in many real-world systems. The efficiency of secure two-party protocols has improved tremendously in the last decade, making such protocols efficient enough for many real-world applicat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4b888b7c431781c92a9fd05e288806e9
https://doi.org/10.1007/978-3-030-25283-0_16
https://doi.org/10.1007/978-3-030-25283-0_16
Publikováno v:
Advances in Cryptology – ASIACRYPT 2017 ISBN: 9783319706962
ASIACRYPT (2)
ASIACRYPT (2)
In the setting of secure multiparty computation, a set of mutually distrustful parties carry out a joint computation of their inputs, without revealing anything but the output. Over recent years, there has been tremendous progress towards making secu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9635e5b941969f2fa340255c1a8d3705
https://doi.org/10.1007/978-3-319-70697-9_17
https://doi.org/10.1007/978-3-319-70697-9_17
Publikováno v:
ACM Conference on Computer and Communications Security
In the setting of secure multiparty computation, a set of parties with private inputs wish to compute some function of their inputs without revealing anything but their output. Over the last decade, the efficiency of secure two-party computation has
Autor:
Aner Ben-Efraim
We combine some known results and techniques with new ones to show that there exists a non-algebraic, multi-linear matroid. This answers an open question by Matus (Discrete Mathematics 1999), and an open question by Pendavingh and van Zwam (Advances
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fff48e53a0f58a6003ec661c27f727e8
http://arxiv.org/abs/1403.6363
http://arxiv.org/abs/1403.6363
Publikováno v:
Theory of Cryptography ISBN: 9783642542411
TCC
TCC
Multi-linear secret-sharing schemes are the most common secret-sharing schemes. In these schemes the secret is composed of some field elements and the sharing is done by applying some fixed linear mapping on the field elements of the secret and some
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d1c707b7e991a2fdf0ca3e097d2f19f
https://doi.org/10.1007/978-3-642-54242-8_17
https://doi.org/10.1007/978-3-642-54242-8_17