default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikolaos Makriyannis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Gilad Asharov, Amos Beimel, Nikolaos Makriyannis
, Eran Omri:
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. SIAM J. Comput. 53(5): 1381-1408 (2024)- 2023
- [i17]Nikolaos Makriyannis, Oren Yomtov:
Practical Key-Extraction Attacks in Leading MPC Wallets. IACR Cryptol. ePrint Arch. 2023: 1234 (2023) - 2022
- [j3]Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky:
On the Round Complexity of Randomized Byzantine Agreement. J. Cryptol. 35(2): 10 (2022) - [j2]Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. SIAM J. Comput. 51(4): 1126-1171 (2022) - [j1]Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
On the complexity of fair coin flipping. Theor. Comput. Sci. 914: 23-38 (2022) - [c10]Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia:
Highly Efficient OT-Based Multiplication Protocols. EUROCRYPT (1) 2022: 180-209 - [i16]Constantin Blokh, Nikolaos Makriyannis, Udi Peled:
Efficient Asymmetric Threshold ECDSA for MPC-based Cold Storage. IACR Cryptol. ePrint Arch. 2022: 1296 (2022) - [i15]Nikolaos Makriyannis:
On the Classic Protocol for MPC Schnorr Signatures. IACR Cryptol. ePrint Arch. 2022: 1332 (2022) - 2021
- [i14]Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. CoRR abs/2105.00743 (2021) - [i13]Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
On the Complexity of Fair Coin Flipping. CoRR abs/2105.00780 (2021) - [i12]Ran Canetti, Rosario Gennaro, Steven Goldfeder, Nikolaos Makriyannis, Udi Peled:
UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts. IACR Cryptol. ePrint Arch. 2021: 60 (2021) - [i11]Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia:
Highly Efficient OT-Based Multiplication Protocols. IACR Cryptol. ePrint Arch. 2021: 1373 (2021) - 2020
- [c9]Ran Canetti, Rosario Gennaro, Steven Goldfeder, Nikolaos Makriyannis, Udi Peled:
UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts. CCS 2020: 1769-1787 - [i10]Ran Canetti, Nikolaos Makriyannis, Udi Peled:
UC Non-Interactive, Proactive, Threshold ECDSA. IACR Cryptol. ePrint Arch. 2020: 492 (2020)
2010 – 2019
- 2019
- [c8]Shai Halevi, Yuval Ishai, Eyal Kushilevitz, Nikolaos Makriyannis, Tal Rabin:
On Fully Secure MPC with Solitary Output. TCC (1) 2019: 312-340 - [c7]Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky:
On the Round Complexity of Randomized Byzantine Agreement. DISC 2019: 12:1-12:17 - [i9]Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky:
On the Round Complexity of Randomized Byzantine Agreement. CoRR abs/1907.11329 (2019) - [i8]Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky:
On the Round Complexity of Randomized Byzantine Agreement. IACR Cryptol. ePrint Arch. 2019: 868 (2019) - [i7]Shai Halevi, Yuval Ishai, Eyal Kushilevitz, Nikolaos Makriyannis, Tal Rabin:
On Fully Secure MPC with Solitary Output. IACR Cryptol. ePrint Arch. 2019: 1032 (2019) - 2018
- [c6]Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. FOCS 2018: 838-849 - [c5]Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
On the Complexity of Fair Coin Flipping. TCC (1) 2018: 539-562 - [i6]Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
On the Complexity of Fair Coin Flipping. Electron. Colloquium Comput. Complex. TR18 (2018) - [i5]Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
On the Complexity of Fair Coin Flipping. IACR Cryptol. ePrint Arch. 2018: 901 (2018) - 2017
- [c4]Vanesa Daza, Nikolaos Makriyannis:
Designing Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions. TCC (1) 2017: 581-611 - [i4]Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling. Electron. Colloquium Comput. Complex. TR17 (2017) - [i3]Vanesa Daza, Nikolaos Makriyannis:
Designing Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions. IACR Cryptol. ePrint Arch. 2017: 98 (2017) - 2016
- [b1]Nikolaos Makriyannis:
Fairness in two-party computation : characterizing fair functions. Pompeu Fabra University, Spain, 2016 - 2015
- [c3]Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri:
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. TCC (1) 2015: 199-228 - 2014
- [c2]Nikolaos Makriyannis:
On the Classification of Finite Boolean Functions up to Fairness. SCN 2014: 135-154 - [i2]Nikolaos Makriyannis:
On the Classification of Finite Boolean Functions up to Fairness. IACR Cryptol. ePrint Arch. 2014: 516 (2014) - [i1]Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri:
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. IACR Cryptol. ePrint Arch. 2014: 1000 (2014) - 2011
- [c1]Nikolaos Makriyannis, Bertrand Meyer:
Some constructions of maximal witness codes. ISIT 2011: 2105-2109
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
