Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Avishay Yanai"'
Publikováno v:
Applied Cryptography and Network Security ISBN: 9783031334900
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a61fc5757252b36e258b06c8463e9bb5
https://doi.org/10.1007/978-3-031-33491-7_23
https://doi.org/10.1007/978-3-031-33491-7_23
Publikováno v:
Journal of Cryptology. 35
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ffd6a9adbf15af081dbcbe3d8dc053cb
https://doi.org/10.1007/s00145-022-09434-2
https://doi.org/10.1007/s00145-022-09434-2
Publikováno v:
CCS
We address the problem of multiparty private set intersection against a malicious adversary. First, we show that when one can assume no collusion amongst corrupted parties then there exists an extremely efficient protocol given only symmetric-key pri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::31a358fdd427838dd7be33bd8aee15df
https://doi.org/10.1145/3460120.3484772
https://doi.org/10.1145/3460120.3484772
Publikováno v:
CCS
Dery et al. recently proposed a secure voting protocol for score-based elections, where independent talliers perform the tallying procedure. The protocol offers perfect ballot secrecy: it outputs the identity of the winner(s), but keeps all other inf
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8081cd7ba0553a5b5e03d7536f457370
https://doi.org/10.1145/3460120.3485343
https://doi.org/10.1145/3460120.3485343
Autor:
Avishay Yanai, Carmit Hazay
Publikováno v:
Journal of Cryptology. 32:1144-1199
The random-access memory model of computation allows program constant-time memory lookup and is more applicable in practice today, covering many important algorithms. This is in contrast to the classic setting of secure 2-party computation (2PC) that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07402263ee30489fed1864ae12586397
https://doi.org/10.1007/s00145-019-09321-3
https://doi.org/10.1007/s00145-019-09321-3
Publikováno v:
Theory of Cryptography ISBN: 9783030904524
TCC (2)
TCC (2)
Secure computation enables n mutually distrustful parties to compute a function over their private inputs jointly. In 1988 Ben-Or, Goldwasser, and Wigderson (BGW) demonstrated that any function can be computed with perfect security in the presence of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8bdbbae705eac2b5c4250f02baf4c0ea
https://doi.org/10.1007/978-3-030-90453-1_3
https://doi.org/10.1007/978-3-030-90453-1_3
Publikováno v:
CCS
Anonymous Committed Broadcast is a functionality that extends DC-nets and allows a set of clients to privately commit messages to set of servers, which can then simultaneously open all committed messages in a random ordering. Anonymity holds since no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b29a02be50ef04f07a45d47406db6c82
https://doi.org/10.1145/3372297.3417261
https://doi.org/10.1145/3372297.3417261
Publikováno v:
Advances in Cryptology – EUROCRYPT 2020 ISBN: 9783030457235
EUROCRYPT (2)
EUROCRYPT (2)
We present a 2-party private set intersection (PSI) protocol which provides security against malicious participants, yet is almost as fast as the fastest known semi-honest PSI protocol of Kolesnikov et al. (CCS 2016).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed8229901d0773e1be67e981369fc174
https://doi.org/10.1007/978-3-030-45724-2_25
https://doi.org/10.1007/978-3-030-45724-2_25
Publikováno v:
Artificial Intelligence. 297:103501
In recent years, several studies proposed privacy-preserving algorithms for solving Distributed Constraint Optimization Problems (DCOPs). Those studies were based on existing DCOP solving algorithms, which they strengthened by implementing cryptograp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf66c9e1b7971b6a3d6c42dab06ed4b2
https://doi.org/10.1016/j.artint.2021.103501
https://doi.org/10.1016/j.artint.2021.103501
Publikováno v:
IJCAI
In recent years, several studies proposed privacy-preserving algorithms for solving Distributed Constraint Optimization Problems (DCOPs). All of those studies assumed that agents do not collude. In this study we propose the first privacy-preserving D
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c4b35ba118d5f4fddf9393e13352107d
https://doi.org/10.24963/ijcai.2019/663
https://doi.org/10.24963/ijcai.2019/663