Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Nikolaos Makriyannis"'
Publikováno v:
Advances in Cryptology – EUROCRYPT 2022 ISBN: 9783031069437
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91468fe5e1ac902d95b67de36d478cb5
https://doi.org/10.1007/978-3-031-06944-4_7
https://doi.org/10.1007/978-3-031-06944-4_7
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b2980afb3aae378ae968200d387dc36f
Publikováno v:
CCS
Building on the Gennaro & Goldfeder and Lindell & Nof protocols (CCS '18), we present two threshold ECDSA protocols, for any number of signatories and any threshold, that improve as follows over the state of the art: -- For both protocols, only the l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57ca876ce94767fae011a06ca334eb03
https://doi.org/10.1145/3372297.3423367
https://doi.org/10.1145/3372297.3423367
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c443f299794854f5d2a39ca9fe70d3a1
Publikováno v:
Theory of Cryptography ISBN: 9783030038069
TCC (1)
TCC (1)
A two-party coin-flipping protocol is \(\varepsilon \)-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 \(\varepsilon \). Cleve [STOC ’86] showed that r-r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b022176badaa6ecedf31715703f570cf
https://doi.org/10.1007/978-3-030-03807-6_20
https://doi.org/10.1007/978-3-030-03807-6_20
Autor:
Nikolaos Makriyannis, Vanesa Daza
Publikováno v:
Theory of Cryptography ISBN: 9783319704999
TCC (1)
TCC (1)
Comunicació presentada a la TCC 2017 Theory of Cryptography. Lecture Notes in Computer Science, celebrada a Baltimore (Estats Units d'Amèrica) del 12 al 15 de novembre de 2017. In a sense, a two-party protocol achieves fairness if the output from t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::637023b6810c20d9479b117c75f119ea
https://doi.org/10.1007/978-3-319-70500-2_20
https://doi.org/10.1007/978-3-319-70500-2_20
Publikováno v:
Open Learning: The Journal of Open, Distance and e-Learning. 28:227-238
First-year university students exhibit considerably different levels of proficiency, often lacking the necessary prerequisites to attend certain courses. This is especially true for mathematics courses. While motivation alone plays a role, by far the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1651760bc227401179c4880f00d55237
https://doi.org/10.1080/02680513.2013.872558
https://doi.org/10.1080/02680513.2013.872558
Publikováno v:
Theory of Cryptography ISBN: 9783662464939
TCC (1)
TCC (1)
Fairness is a desirable property in secure computation; informally it means that if one party gets the output of the function, then all parties get the output. Alas, an implication of Cleve’s result (STOC 86) is that when there is no honest majorit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d13e15c52eb72f9d0e631a597fd05d71
https://doi.org/10.1007/978-3-662-46494-6_10
https://doi.org/10.1007/978-3-662-46494-6_10
Autor:
Nikolaos Makriyannis
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319108780
SCN
SCN
Two parties, P 1 and P 2, wish to jointly compute some function f(x,y) where P 1 only knows x, whereas P 2 only knows y. Furthermore, and most importantly, the parties wish to reveal only what the output suggests. Function f is said to be computable
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f1e25b49c36ca71ec2dc82fec2807afb
https://doi.org/10.1007/978-3-319-10879-7_9
https://doi.org/10.1007/978-3-319-10879-7_9
Autor:
Bertrand Meyer, Nikolaos Makriyannis
Publikováno v:
ISIT
Given a code C is an element of F-2(n) and a word c is an element of C, a witness of c is a subset W subset of {, 1 ... , n} of coordinate positions such that c differs from any other codeword c' is an element of C on the indices in W. If any codewor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a04df04527aeedd1c1a66d17030df4d8
https://doi.org/10.1109/isit.2011.6033928
https://doi.org/10.1109/isit.2011.6033928