CHENG, H., FOTIADIS, G., GROSZSCHÄDL, J., & RYAN, P. Y. A. (2023). IoTDisco: Strong yet Lightweight End-to-End Security for the Internet of Constrained Things. In S. Bouzefrane, S. Banerjee, F. Mourlin, S. Boumerdassi, ... E. Renault (Eds.), Mobile, Secure, and Programmable Networking: 9th International Conference, MSPN 2023, Paris, France, October 26–27, 2023, Revised Selected Papers (pp. 1-16). Cham, Switzerland: Springer Verlag. doi:10.1007/978-3-031-52426-4_1 Peer reviewed |
Damodaran, A. S. S., Fotiadis, G., & Ryan, P. Y. A. (30 June 2023). Preparing for a Quantum-Resistant Era [Poster presentation]. ICT Spring 2023, Luxembourg City, Luxembourg. |
Arenas Correa, M. P., Bingol, M. A., Demirci, H., Fotiadis, G., & Lenzini, G. (06 October 2022). A Secure Authentication Protocol for Cholesteric Spherical Reflectors using Homomorphic Encryption. Lecture Notes in Computer Science, 13503, 23. doi:10.1007/978-3-031-17433-9_18 Peer reviewed |
Cheng, H., Fotiadis, G., Groszschädl, J., & Ryan, P. Y. A. (February 2022). Highly Vectorized SIKE for AVX-512. IACR Transactions on Cryptographic Hardware and Embedded Systems (TCHES), 2022 (2), 41-68. doi:10.46586/tches.v2022.i2.41-68 Peer reviewed |
Cheng, H., Fotiadis, G., Groszschädl, J., Ryan, P. Y. A., & Roenne, P. (August 2021). Batching CSIDH Group Actions using AVX-512. IACR Transactions on Cryptographic Hardware and Embedded Systems (TCHES), 2021 (4), 618-649. doi:10.46586/tches.v2021.i4.618-649 Peer reviewed |
Fotiadis, G., & Konstantinou, E. (15 October 2019). TNFS Resistant Families of Pairing-Friendly Elliptic Curves. Theoretical Computer Science, 800, 73-89. doi:10.1016/j.tcs.2019.10.017 Peer Reviewed verified by ORBi |
Fotiadis, G., & Martindale, C. (2019). Optimal TNFS-secure pairings on elliptic curves with composite embedding degree. ORBilu-University of Luxembourg. https://orbilu.uni.lu/handle/10993/41494. |
Fotiadis, G., & Martindale, C. (2018). Optimal TNFS-secure pairings on elliptic curves with even embedding degree. ORBilu-University of Luxembourg. https://orbilu.uni.lu/handle/10993/39266. |
Fotiadis, G., & Konstantinou, E. (20 February 2018). Generating Pairing-Friendly Elliptic Curve Parameters Using Sparse Families. Journal of Mathematical Cryptology, 12 (2), 83-99. doi:10.1515/jmc-2017-0024 Peer Reviewed verified by ORBi |
Fotiadis, G., & Konstantinou, E. (2017). Ordinary Pairing-Friendly Genus 2 Hyperelliptic Curves with Absolutely Simple Jacobians. In International Conference on Mathematical Aspects of Computer and Information Sciences (pp. 409-424). Springer. Peer reviewed |
Fotiadis, G. (2017). Constructing Suitable Parameters for Pairing-Based Cryptography [Doctoral thesis, University of the Aegean]. ORBilu-University of Luxembourg. https://orbilu.uni.lu/handle/10993/39269 |
Fotiadis, G., & Konstantinou, E. (2017). Pairing-Friendly Elliptic Curves Resistant to TNFS Attacks [Paper presentation]. 7th International Conference on Algebraic Informatics, Kalamata, Greece. |
Fotiadis, G., & Konstantinou, E. (2014). More Sparse Families of Pairing-Friendly Elliptic Curves. In International Conference on Cryptology and Network Security, Heraklion 22-24 October 2014. Springer. Peer reviewed |
Fotiadis, G., & Konstantinou, E. (2013). On the Efficient Generation of Generalized MNT Elliptic Curves. In 5th International Conference on Algebraic Informatics, Porquerolles 3-6 September 2013 (pp. 147-159). Berlin, Unknown/unspecified: Springer. Peer reviewed |
Kambourakis, G., Konstantinou, E., Douma, A., Anagnostopoulos, M., & Fotiadis, G. (17 May 2010). Efficient Certification Path Discovery for MANET. EURASIP Journal on Wireless Communications and Networking, 2010. doi:10.1155/2010/243985 Peer Reviewed verified by ORBi |