Zobrazeno 1 - 10
of 89
pro vyhledávání: '"Ittai Abraham"'
Publikováno v:
Advances in Cryptology – EUROCRYPT 2023 ISBN: 9783031306167
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10fe9083d22ed7b91fe19c616c9f2a5a
https://doi.org/10.1007/978-3-031-30617-4_9
https://doi.org/10.1007/978-3-031-30617-4_9
Publikováno v:
PODC
The celebrated result of Fischer, Lynch and Paterson is the fundamental lower bound for asynchronous fault tolerant computation: any 1-crash resilient asynchronous agreement protocol must have some (possibly measure zero) probability of not terminati
Publikováno v:
Journal of Cryptology. 35
Publikováno v:
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing.
Autor:
Ittai Abraham, Gilad Asharov
Publikováno v:
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing.
Publikováno v:
PODC
This paper explores the problem good-case latency of Byzantine fault-tolerant broadcast, motivated by the real-world latency and performance of practical state machine replication protocols. The good-case latency measures the time it takes for all no
Publikováno v:
Distributed Computing-27th International Symposium, DISC 2013
We do a game-theoretic analysis of leader election, under the assumption that each agent prefers to have some leader than no leader at all. We show that it is possible to obtain a fair Nash equilibrium, where each agent has an equal probability of be
Autor:
Ofer Neiman, Ittai Abraham
Publikováno v:
STOC
We prove that any graph G=(V,E) with n points and m edges has a spanning tree T such that ∑(u,v)∈ E(G)dT(u,v) = O(m log n log log n). Moreover such a tree can be found in time O(m log n log log n). Our result is obtained using a new petal-decompo
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