Nikos Leonardos

ScholarGPS® ID: 24122806116938

Affiliation

National and Kapodistrian University of Athens, Athens, Greece

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Metrics Summary

Publication Count

Predicted Citations

1,510

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
The Bitcoin Backbone Protocol: Analysis and Applications (journal article) Garay, Juan A. \| Kiayias, Aggelos \| Leonardos, Nikos Journal of the ACM (2024). 10.1145/3653445 Cited by (1) \| Cite \| Source
Ordering Transactions with Bounded Unfairness: Definitions, Complexity and Constructions (book chapter) In Advances in Cryptology – EUROCRYPT 2024 Kiayias, Aggelos \| Leonardos, Nikos \| Shen, Yu Springer Nature Switzerland (2024) 10.1007/978-3-031-58734-4_2 Cite \| Source
Optimal circle search despite the presence of faulty robots (journal article) Georgiou, Konstantinos \| Kranakis, Evangelos \| Leonardos, Nikos \| Pagourtzis, Aris \| Papaioannou, Ioannis Information Processing Letters, volume 182 (2023). 10.1016/j.ipl.2023.106391 Cited by (1) \| Cite \| Source
Byzantine fault tolerant symmetric-persistent circle evacuation (journal article) Leonardos, Nikos \| Pagourtzis, Aris \| Papaioannou, Ioannis Theoretical Computer Science, volume 956 (2023). 10.1016/j.tcs.2023.113839 Cited by (1) \| Cite \| Source
Minotaur (conference) Fitzi, Matthias \| Wang, Xuechao \| Kannan, Sreeram \| Kiayias, Aggelos \| Leonardos, Nikos \| Viswanath, Pramod \| Wang, Gerui CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security (2022) Los Angeles CA USA 10.1145/3548606.3559356 Cited by (2) \| Cite \| Source
Mining in Logarithmic Space (conference) Kiayias, Aggelos \| Leonardos, Nikos \| Zindros, Dionysis CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security (2021) Virtual Event Republic of Korea 10.1145/3460120.3484784 Cited by (8) \| Cite \| Source
Byzantine Fault Tolerant Symmetric-Persistent Circle Evacuation (book chapter) In Algorithms for Sensor Systems Leonardos, Nikos \| Pagourtzis, Aris \| Papaioannou, Ioannis Springer International Publishing (2021) 10.1007/978-3-030-89240-1_8 Cite \| Source
Oceanic Games: Centralization Risks and Incentives in Blockchain Mining (book chapter) In Mathematical Research for Blockchain Economy Leonardos, Nikos \| Leonardos, Stefanos \| Piliouras, Georgios Springer International Publishing (2020) 10.1007/978-3-030-37110-4_13 Cited by (19) \| Cite \| Source
Bootstrapping the Blockchain, with Applications to Consensus and Fast PKI Setup (book chapter) In Public-Key Cryptography – PKC 2018 Garay, Juan A. \| Kiayias, Aggelos \| Leonardos, Nikos \| Panagiotakos, Giorgos Springer International Publishing (2018) 10.1007/978-3-319-76581-5_16 Cited by (26) \| Cite \| Source
The Bitcoin Backbone Protocol with Chains of Variable Difficulty (book chapter) In Advances in Cryptology – CRYPTO 2017 Garay, Juan \| Kiayias, Aggelos \| Leonardos, Nikos Springer International Publishing (2017) 10.1007/978-3-319-63688-7_10 Cited by (131) \| Cite \| Source
Hellinger volume and number-on-the-forehead communication complexity (journal article) Lee, Troy \| Leonardos, Nikos \| Saks, Michael \| Wang, Fengming Journal of Computer and System Sciences, volume 82, issue 6, pages 1064-1074 (2016). 10.1016/j.jcss.2016.03.005 Cited by (1) \| Cite \| Source \| Open Access
Stable Matching with Evolving Preferences. (conference) Kanade, Varun \| Leonardos, Nikos \| Magniez, Frédéric International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2016) 10.4230/LIPIcs.APPROX-RANDOM.2016.36 Cited by (2) \| Cite \| Source
Improved periodic data retrieval in asynchronous rings with a faulty host (journal article) Bampas, Evangelos \| Leonardos, Nikos \| Markou, Euripides \| Pagourtzis, Aris \| Petrolia, Matoula Theoretical Computer Science, volume 608 (2015). 10.1016/j.tcs.2015.09.019 Cited by (5) \| Cite \| Source
Optimal Rate Private Information Retrieval from Homomorphic Encryption (journal article) Kiayias, Aggelos \| Leonardos, Nikos \| Lipmaa, Helger \| Pavlyk, Kateryna \| Tang, Qiang Proceedings on Privacy Enhancing Technologies, volume 2015, issue 2, pages 222-243 (2015). 10.1515/popets-2015-0016 Cited by (25) \| Cite \| Source \| Open Access
The Bitcoin Backbone Protocol: Analysis and Applications (book chapter) In Advances in Cryptology - EUROCRYPT 2015 Garay, Juan \| Kiayias, Aggelos \| Leonardos, Nikos Springer Berlin Heidelberg (2015) 10.1007/978-3-662-46803-6_10 Cited by (847) \| Cite \| Source
Communication Optimal Tardos-Based Asymmetric Fingerprinting (book chapter) In Topics in Cryptology –- CT-RSA 2015 Kiayias, Aggelos \| Leonardos, Nikos \| Lipmaa, Helger \| Pavlyk, Kateryna \| Tang, Qiang Springer International Publishing (2015) 10.1007/978-3-319-16715-2_25 Cited by (6) \| Cite \| Source
Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host (book chapter) In Structural Information and Communication Complexity Bampas, Evangelos \| Leonardos, Nikos \| Markou, Euripides \| Pagourtzis, Aris \| Petrolia, Matoula Springer International Publishing (2014) 10.1007/978-3-319-09620-9_27 Cited by (3) \| Cite \| Source
An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority, (book chapter) In Automata, Languages, and Programming Leonardos, Nikos Springer Berlin Heidelberg (2013) 10.1007/978-3-642-39206-1_59 Cited by (2) \| Cite \| Source
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions (journal article) Leonardos, Nikos \| Saks, Michael computational complexity, volume 19, issue 2, pages 153-181 (2010). 10.1007/s00037-010-0292-2 Cited by (11) \| Cite \| Source
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions (conference) Leonardos, Nikos \| Saks, Michael 2009 24th Annual IEEE Conference on Computational Complexity (CCC) (2009) Paris, France 10.1109/CCC.2009.32 Cited by (1) \| Cite \| Source