Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Makriyannis, Nikolaos"'
A two-party coin-flipping protocol is $\epsilon$-fair if no efficient adversary can bias the output of the honest party (who always outputs a bit, even if the other party aborts) by more than $\epsilon$. Cleve [STOC '86] showed that $r$-round $o(1/r)
Externí odkaz:
http://arxiv.org/abs/2105.00780
In his seminal work, Cleve [STOC '86] has proved that any $r$-round coin-flipping protocol can be efficiently biased by $\Theta(1/r)$. This lower bound was met for the two-party case by Moran, Naor, and Segev [Journal of Cryptology '16], and the thre
Externí odkaz:
http://arxiv.org/abs/2105.00743
Publikováno v:
Journal of Cryptology 35, 10 (2022)
We prove lower bounds on the round complexity of randomized Byzantine agreement (BA) protocols, bounding the halting probability of such protocols after one and two rounds. In particular, we prove that: (1) BA protocols resilient against $n/3$ [resp.
Externí odkaz:
http://arxiv.org/abs/1907.11329
Publikováno v:
In Theoretical Computer Science 7 May 2022 914:23-38
Publikováno v:
SIAM Journal on Computing; 2024, Vol. 53 Issue 5, p1381-1408, 28p
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:
SIAM Journal on Computing; 2022, Vol. 51 Issue 4, p1126-1171, 46p
Autor:
Daza, Vanesa1 (AUTHOR), Makriyannis, Nikolaos1 (AUTHOR), Rovira Riera, Carme2 (AUTHOR) carme.rovira@upf.edu
Publikováno v:
Open Learning. Nov2013, Vol. 28 Issue 3, p227-238. 12p.
Autor:
Makriyannis, Nikolaos
Publikováno v:
TDX (Tesis Doctorals en Xarxa)
TDR. Tesis Doctorales en Red
instname
TDR. Tesis Doctorales en Red
instname
Secure two-party computation is a classic problem in cryptography. It involves two parties computing a function of their private inputs, and only revealing what the output suggests. Additional security requirements may include fairness, which states
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6863b52372f643749519d098bf043738
http://hdl.handle.net/10803/395171
http://hdl.handle.net/10803/395171
Publikováno v:
Theory of Cryptography 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I; 2015, p199-228, 30p