References of "Fotiadis, Georgios 50034724"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailA Secure Authentication Protocol for Cholesteric Spherical Reflectors using Homomorphic Encryption
Arenas Correa, Monica Patricia UL; Bingol, Muhammed Ali; Demirci, Huseyin UL et al

in Lecture Notes in Computer Science (2022, July)

Sometimes fingerprint-like features are found in a material. The exciting discovery poses new challenges on how to use the features to build an object authentication protocol that could tell customers and ... [more ▼]

Sometimes fingerprint-like features are found in a material. The exciting discovery poses new challenges on how to use the features to build an object authentication protocol that could tell customers and retailers equipped with a mobile device whether a good is authentic or fake. We are exactly in this situation with Cholesteric Spherical Reflectors (CSRs), tiny spheres of liquid crystals with which we can tag or coat objects. They are being proposed as a potential game-changer material in anti-counterfeiting due to their unique optical properties. In addition to the problem of processing images and extracting the minutiæ embedded in a CSR, one major challenge is designing cryptographically secure authentication protocols. The authentication procedure has to handle unstable input data; it has to measure the distance between some reference data stored at enrollment and noisy input provided at authentication. We propose a cryptographic authentication protocol that solves the problem, and that is secure against semi-honest and malicious adversaries. We prove that our design ensures data privacy even if enrolled data are leaked and even if servers and provers are actively curious. We implement and benchmark the protocol in Python using the Microsoft SEAL library through its Python wrapper PySEAL. [less ▲]

Detailed reference viewed: 44 (8 UL)
Full Text
Peer Reviewed
See detailBatching CSIDH Group Actions using AVX-512
Cheng, Hao UL; Fotiadis, Georgios UL; Groszschädl, Johann UL et al

in IACR Transactions on Cryptographic Hardware and Embedded Systems (TCHES) (2021, August), 2021(4), 618-649

Commutative Supersingular Isogeny Diffie-Hellman (or CSIDH for short) is a recently-proposed post-quantum key establishment scheme that belongs to the family of isogeny-based cryptosystems. The CSIDH ... [more ▼]

Commutative Supersingular Isogeny Diffie-Hellman (or CSIDH for short) is a recently-proposed post-quantum key establishment scheme that belongs to the family of isogeny-based cryptosystems. The CSIDH protocol is based on the action of an ideal class group on a set of supersingular elliptic curves and comes with some very attractive features, e.g. the ability to serve as a “drop-in” replacement for the standard elliptic curve Diffie-Hellman protocol. Unfortunately, the execution time of CSIDH is prohibitively high for many real-world applications, mainly due to the enormous computational cost of the underlying group action. Consequently, there is a strong demand for optimizations that increase the efficiency of the class group action evaluation, which is not only important for CSIDH, but also for related cryptosystems like the signature schemes CSI-FiSh and SeaSign. In this paper, we explore how the AVX-512 vector extensions (incl. AVX-512F and AVX-512IFMA) can be utilized to optimize constant-time evaluation of the CSIDH-512 class group action with the goal of, respectively, maximizing throughput and minimizing latency. We introduce different approaches for batching group actions and computing them in SIMD fashion on modern Intel processors. In particular, we present a hybrid batching technique that, when combined with optimized (8 × 1)-way prime-field arithmetic, increases the throughput by a factor of 3.64 compared to a state-of-the-art (non-vectorized) x64 implementation. On the other hand, vectorization in a 2-way fashion aimed to reduce latency makes our AVX-512 implementation of the group action evaluation about 1.54 times faster than the state-of-the-art. To the best of our knowledge, this paper is the first to demonstrate the high potential of using vector instructions to increase the throughput (resp. decrease the latency) of constant-time CSIDH. [less ▲]

Detailed reference viewed: 102 (12 UL)
Full Text
Peer Reviewed
See detailTNFS Resistant Families of Pairing-Friendly Elliptic Curves
Fotiadis, Georgios UL; Konstantinou, Elisavet

in Theoretical Computer Science (2019), 800

Detailed reference viewed: 114 (18 UL)
Full Text
See detailOptimal TNFS-secure pairings on elliptic curves with composite embedding degree
Fotiadis, Georgios UL; Martindale, Chloe

E-print/Working paper (2019)

Detailed reference viewed: 109 (4 UL)
Full Text
See detailOptimal TNFS-secure pairings on elliptic curves with even embedding degree
Fotiadis, Georgios UL; Martindale, Chloe

E-print/Working paper (2018)

Detailed reference viewed: 69 (8 UL)
Full Text
Peer Reviewed
See detailGenerating Pairing-Friendly Elliptic Curve Parameters Using Sparse Families
Fotiadis, Georgios UL; Konstantinou, Elisavet

in Journal of Mathematical Cryptology (2018), 12(2), 83-99

Detailed reference viewed: 109 (6 UL)
Full Text
Peer Reviewed
See detailOrdinary Pairing-Friendly Genus 2 Hyperelliptic Curves with Absolutely Simple Jacobians
Fotiadis, Georgios UL; Konstantinou, Elisavet

in International Conference on Mathematical Aspects of Computer and Information Sciences (2017, December 21)

Detailed reference viewed: 125 (5 UL)
See detailConstructing Suitable Parameters for Pairing-Based Cryptography
Fotiadis, Georgios UL

Doctoral thesis (2017)

Detailed reference viewed: 79 (8 UL)
Peer Reviewed
See detailPairing-Friendly Elliptic Curves Resistant to TNFS Attacks
Fotiadis, Georgios UL; Konstantinou, Elisavet

Scientific Conference (2017)

Detailed reference viewed: 46 (0 UL)
Full Text
Peer Reviewed
See detailMore Sparse Families of Pairing-Friendly Elliptic Curves
Fotiadis, Georgios UL; Konstantinou, Elisavet

in International Conference on Cryptology and Network Security, Heraklion 22-24 October 2014 (2014)

Detailed reference viewed: 97 (2 UL)
Full Text
Peer Reviewed
See detailOn the Efficient Generation of Generalized MNT Elliptic Curves
Fotiadis, Georgios UL; Konstantinou, Elisavet

in 5th International Conference on Algebraic Informatics, Porquerolles 3-6 September 2013 (2013)

Detailed reference viewed: 104 (1 UL)
Full Text
Peer Reviewed
See detailEfficient Certification Path Discovery for MANET
Kambourakis, Georgios; Konstantinou, Elisavet; Douma, Anastasia et al

in EURASIP Journal on Wireless Communications and Networking (2010), 2010

Detailed reference viewed: 92 (1 UL)