Georgios Fotiadis

Orcid: 0000-0001-9699-3817

According to our database1, Georgios Fotiadis authored at least 19 papers between 2010 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Remote secure object authentication: Secure sketches, fuzzy extractors, and security protocols.
Comput. Secur., 2025

2024
A short-list of pairing-friendly curves resistant to the Special TNFS algorithm at the 192-bit security level.
IACR Commun. Cryptol., 2024

RISC-V Instruction Set Extensions for Multi-Precision Integer Arithmetic: A Case Study on Post-Quantum Key Exchange Using CSIDH-512.
Proceedings of the 61st ACM/IEEE Design Automation Conference, 2024

X2065: Lightweight Key Exchange for the Internet of Things.
Proceedings of the 10th ACM Cyber-Physical System Security Workshop, 2024

Special TNFS-Secure Pairings on Ordinary Genus 2 Hyperelliptic Curves.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2024, 2024

2023
IoTDisco: Strong yet Lightweight End-to-End Security for the Internet of Constrained Things.
Proceedings of the Mobile, Secure, and Programmable Networking, 2023

2022
Highly Vectorized SIKE for AVX-512.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2022

A Secure Authentication Protocol for Cholesteric Spherical Reflectors Using Homomorphic Encryption.
Proceedings of the Progress in Cryptology, 2022

2021
Batching CSIDH Group Actions using AVX-512.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2021

Root-of-Trust Abstractions for Symbolic Analysis: Application to Attestation Protocols.
Proceedings of the Security and Trust Management - 17th International Workshop, 2021

2019
TNFS resistant families of pairing-friendly elliptic curves.
Theor. Comput. Sci., 2019

Optimal TNFS-secure pairings on elliptic curves with composite embedding degree.
IACR Cryptol. ePrint Arch., 2019

2018
Generating pairing-friendly elliptic curve parameters using sparse families.
J. Math. Cryptol., 2018

Optimal TNFS-secure pairings on elliptic curves with even embedding degree.
IACR Cryptol. ePrint Arch., 2018

2017
Constructing suitable parameters for pairing-based cryptography
PhD thesis, 2017

Ordinary Pairing-Friendly Genus 2 Hyperelliptic Curves with Absolutely Simple Jacobians.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

2014
More Sparse Families of Pairing-Friendly Elliptic Curves.
Proceedings of the Cryptology and Network Security - 13th International Conference, 2014

2013
On the Efficient Generation of Generalized MNT Elliptic Curves.
Proceedings of the Algebraic Informatics - 5th International Conference, 2013

2010
Efficient Certification Path Discovery for MANET.
EURASIP J. Wirel. Commun. Netw., 2010


  Loading...