Nikos Leonardos

Office: A7.
Phone: (210) 727 5170.
Email:


Research

Matthias Fitzi, Xuechao Wang, Sreeram Kannan, Aggelos Kiayias, Nikos Leonardos, Pramod Viswanath, Gerui Wang, Aggelos Kiayias, Nikos Leonardos, Dionysis Zindros, "Minotaur: Multi-Resource Blockchain Consensus." CCS 2022.

Aggelos Kiayias, Nikos Leonardos, Dionysis Zindros, "Mining in Logarithmic Space." CCS 2021.

Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou. "Byzantine Fault Tolerant Symmetric-Persistent Circle Evacuation." ALGOSENSORS 2021

Konstantinos Georgiou, Evangelos Kranakis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou, "Optimal Cycle Search Despite the Presence of Faulty Robots." ALGOSENSORS 2019.

Nikos Leonardos, Stefanos Leonardos, Georgios Piliouras, "Oceanic Games: Centralization Risks and Incentives in Blockchain Mining." MARBLE 2019 (Best Paper Award).

Juan Garay, Aggelos Kiayias, Nikos Leonardos, Giorgos Panagiotakos, "Bootstrapping the Blockchain—Directly." PKC 2018.

Juan Garay, Aggelos Kiayias, Nikos Leonardos, "The Bitcoin Backbone Protocol with Chains of Variable Difficulty." CRYPTO 2017.

Varun Kanade, Nikos Leonardos, Frédéric Magniez, "Stable Matching with Evolving Preferences." Random-Approx 2016.

Juan Garay, Aggelos Kiayias, Nikos Leonardos, "The Bitcoin Backbone Protocol: Analysis and Applications." Eurocrypt 2015.

Aggelos Kiayias, Nikos Leonardos, Helger Lipmaa, Kateryna Pavlyk, Qiang Tang "Optimal Rate Private Information Retrieval from Homomorphic Encryption." (Also at ePrint) PETS 2015.

Aggelos Kiayias, Nikos Leonardos, Helger Lipmaa, Kateryna Pavlyk, Qiang Tang "Communication-Optimal Tardos-based Asymmetric Fingerprinting." CT-RSA 2015.

Evangelos Bampas, Nikos Leonardos, Euripides Markou, Aris Pagourtzis, Matoula Petrolia, "Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host." SIROCCO 2014, TCS 2015.

Nikos Leonardos, "An improved lower bound for the randomized decision tree complexity of recursive majority." ICALP 2013.

Troy Lee, Nikos Leonardos, Michael Saks, Fengming Wang, "Hellinger volume and number-on-the-forehead communication complexity." JCSS 2016.

Nikos Leonardos, Michael Saks, "Lower bounds on the randomized communication complexity of read-once functions." CCC 2009, Computational Complexity 2010.

Links

Arxiv: Combinatorics, General Mathematics, Computational Complexity, Discrete Mathematics.
DBLP.

HTML 4.01 Strict