Nikos Leonardos

Orcid: 0000-0003-3909-7914

According to our database1, Nikos Leonardos authored at least 22 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The Bitcoin Backbone Protocol: Analysis and Applications.
J. ACM, August, 2024

2023
Optimal circle search despite the presence of faulty robots.
Inf. Process. Lett., August, 2023

Byzantine fault tolerant symmetric-persistent circle evacuation.
Theor. Comput. Sci., May, 2023

Ordering Transactions with Bounded Unfairness: Definitions, Complexity and Constructions.
IACR Cryptol. ePrint Arch., 2023

Byzantine Fault-Tolerant Protocols for (n, f)-Evacuation from a Circle.
Proceedings of the Algorithmics of Wireless Networks - 19th International Symposium, 2023

2022
Minotaur: Multi-Resource Blockchain Consensus.
IACR Cryptol. ePrint Arch., 2022

Lower bounds for uniform read-once threshold formulae in the randomized decision tree model.
CoRR, 2022

2021
Mining in Logarithmic Space.
IACR Cryptol. ePrint Arch., 2021

2020
Full Analysis of Nakamoto Consensus in Bounded-Delay Networks.
IACR Cryptol. ePrint Arch., 2020

2019
Compact Storage of Superblocks for NIPoPoW Applications.
IACR Cryptol. ePrint Arch., 2019

Oceanic Games: Centralization Risks and Incentives in Blockchain Mining.
Proceedings of the 1st International Conference on Mathematical Research for Blockchain Economy, 2019

2018
Bootstrapping the Blockchain, with Applications to Consensus and Fast PKI Setup.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

2016
Hellinger volume and number-on-the-forehead communication complexity.
J. Comput. Syst. Sci., 2016

Bootstrapping the Blockchain - Directly.
IACR Cryptol. ePrint Arch., 2016

The Bitcoin Backbone Protocol with Chains of Variable Difficulty.
IACR Cryptol. ePrint Arch., 2016

Stable Matching with Evolving Preferences.
Proceedings of the Approximation, 2016

2015
Improved periodic data retrieval in asynchronous rings with a faulty host.
Theor. Comput. Sci., 2015

Optimal Rate Private Information Retrieval from Homomorphic Encryption.
Proc. Priv. Enhancing Technol., 2015

Communication Optimal Tardos-Based Asymmetric Fingerprinting.
Proceedings of the Topics in Cryptology, 2015

2014
Near Optimal Rate Homomorphic Encryption for Branching Programs.
IACR Cryptol. ePrint Arch., 2014

2012
An improved lower bound for the randomized decision tree complexity of recursive majority.
Electron. Colloquium Comput. Complex., 2012

2010
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions.
Comput. Complex., 2010


  Loading...