Ακαδημαϊκό Προσωπικό

Κωνσταντίνου Ελισάβετ

Προσωπικά Στοιχεία
Κωνσταντίνου Ελισάβετ

Αναπληρώτρια Καθηγήτρια


ekonstantinou [at] aegean [dot] gr

22730 82268

Δευτέρα 10:00-12:00

Προσωπική Ιστοσελίδα

Αναφορές (Google Scholar)

Copyright Notice: Το υλικό αυτό παρουσιάζεται για έγκαιρη διάδοση επιστημονικής και τεχνικής εργασίας. Τα πνευματικά δικαιώματα και όλα τα σχετικά δικαιώματα παραμένουν στους συγγραφείς ή σε άλλους κατόχους πνευματικών δικαιωμάτων. Όσοι αντιγράφουν αυτές τις πληροφορίες αναμένεται να τηρούν τους όρους και τους περιορισμούς που επιβάλλει το πνευματικό δικαίωμα κάθε συγγραφέα. Στις περισσότερες περιπτώσεις, τα έργα αυτά δεν μπορούν να αναδημοσιευτούν ή να αναπαραχθούν μαζικά χωρίς τη ρητή άδεια του κατόχου των πνευματικών δικαιωμάτων.


Επιστημονικά Περιοδικά

[1]
G. Fotiadis, E. Konstantinou, TNFS Resistant Families of Pairing-Friendly Elliptic Curves, Journal of Theoretical Computer Science, 2018, Elsevier, (to_appear)
[2]
G. Fotiadis, E. Konstantinou, Generating Pairing-Friendly Elliptic Curve Parameters Using Sparse Families, Journal of Mathematical Cryptology, Vol. 12, No. 2, pp. 83-99, 2018, Walter de Gruyter GmbH, Berlin/Boston, https://doi.org/10.1515/jmc-2017-0024

[1]
H. H. Chan, E. Konstantinou, A. Kontogeorgis, C. H. Tan, What is your “birthday elliptic curves”?, Finite Fields and Applications, Vol. 18, No. 6, 2012, Elsevier, indexed in SCI-E

[1]
E. Makri, E. Konstantinou, Constant Round Group Key Agreement Protocols: A Comparative Study, Computers and Security, Vol. 30, No. 8, pp. 643-678, 2011, Elsevier, indexed in SCI-E
[2]
E. Konstantinou, A. Kontogeorgis, Ramanujan Invariants for Discriminants Congruent to 5 mod 24, International Journal of Number Theory, Vol. 8, No. 1, 2011, World Scientific
[3]
E. Konstantinou, A. Kontogeorgis, Some Remarks on the Construction of Class Field Polynomials, Advances in Mathematics of Communications, Vol. 5, No. 1, pp. 109-118, 2011, indexed in SCI-E
[4]
E. Konstantinou, Efficient Cluster-based Group Key Agreement Protocols for Wireless Ad Hoc Networks, Journal of Networks and Computer Applications, Vol. 34, No. 1, pp. 384-393, 2011, Elsevier, indexed in SCI-E
E. Klaoudatou, E. Konstantinou, G. Kambourakis, S. Gritzalis, A Survey on Cluster-based Group Key Agreement Protocols for WSNs, IEEE Communications Surveys and Tutorials, Vol. 13, No. 3, pp. 429-442, 2011, IEEE Press, http://ieeexplore.ieee.org/xpl/login.jsp..., indexed in SCI-E, IF = 6.311
Περίληψη:
The scope of this survey is to examine and thoroughly evaluate the cluster-based Group Key Agreement (GKA) protocols for Wireless Sensor Networks (WSNs). Towards this goal, we have grouped the WSNs application environments into two major categories (i.e., infrastructure-based and infrastructureless) and have examined: a) which of the cluster-based Group Key Agreement (GKA) protocols that appear in the literature are applicable to each category, and b) to which degree these protocols will impact the systems' performance and energy consumption. In order to answer these questions we have calculated the complexity of each protocol and the energy cost it will add to the system. The evaluation of all discussed protocols is presented in a generalized way and can therefore serve as a reference point for future evaluations and for the design of new, improved GKA protocols.

[1]
E. Konstantinou, A. Kontogeorgis, Ramanujan’s Class Invariants and Their Use in Elliptic Curve Cryptography, Computers and Mathematics with Applications, Vol. 59, No. 8, pp. 2901-2917, 2010, Elsevier, indexed in SCI-E
G. Kambourakis, E. Konstantinou, A. Douma, M. Anagnostopoulos, G. Fotiadis, Efficient Certification Path Discovery for MANET, EURASIP Journal on Wireless Communications and Networking, Vol. 2010, pp. 1-16, 2010, Hindawi Publishing Corporation, http://jwcn.eurasipjournals.com/, indexed in SCI-E, IF = 0.815
Περίληψη:
A Mobile Ad Hoc Network (MANET) is characterized by the lack of any infrastructure, absence of any kind of centralized administration, frequent mobility of nodes, network partitioning, and wireless connections. These properties make traditional wireline security solutions not straightforwardly applicable in MANETs, and of course, constitute the establishment of a Public Key Infrastructure (PKI) in such networks a cumbersome task. After surveying related work, we propose a novel public key management scheme using the well-known web-of-trust or trust graph model. Our scheme is based on a binary tree formation of the network’s nodes. The binary tree structure is proved very effective for building certificate chains between communicating nodes that are multihops away and the cumbersome problem of certificate chain discovery is avoided.We compare our scheme with related work and show that it presents several advantages, especially when a fair balancing between security and performance is desirable. Simulations of the proposed scheme under different scenarios demonstrate that it is effective in terms of tree formation, join and leave occurrences, and certificate chain establishment.
G. Karopoulos, G. Kambourakis, S. Gritzalis, E. Konstantinou, A Framework for Identity Privacy in SIP, Journal of Network and Computer Applications, Vol. 33, No. 1, pp. 16-28, 2010, Elsevier, http://www.sciencedirect.com/science/art..., indexed in SCI-E, IF = 0.660
Περίληψη:
Secure multimedia delivery in modern and future networks is one of the most challenging problems towards the system integration of fourth generation (4G) networks. This integration means that different service and network providers will have to interoperate in order to offer their services to end users. This multidomain environment poses serious threats to the end user who has contract with, and trusts only a limited number of operators and service providers. One such threat is end users’ privacy on which we will focus in this paper. Probably the most promising protocol for multimedia session management is the Session Initiation Protocol (SIP), which is an application layer protocol and thus can operate on top of different lower layer technologies. SIP is quite popular and a lot of research has been conducted; however, it still has some security issues, one of which is related to privacy and more particularly the protection of user identities (IDs). In this paper we comment on the ID privacy issue of SIP and propose a framework called PrivaSIP that can protect either the caller's ID or both the caller's and the callee's IDs in multidomain environments. We present different implementations of our framework based on asymmetric and symmetric cryptography analyzing the pros and cons of each one of them. Furthermore, we provide performance measurements in order to estimate the performance penalty of our framework over standard SIP. The most significant advantage of our method is that it can assure user ID protection even when SIP messages are transmitted through untrusted SIP domains, while our results show that this can be achieved with no perceived delay by the end user.
G. Kambourakis, E. Konstantinou, S. Gritzalis, Revisiting WiMAX MBS Security, Computers and Mathematics with Applications, Vol. 60, No. 2, pp. 217-223, 2010, Elsevier, http://www.sciencedirect.com/science/art..., indexed in SCI-E, IF = 1.472
Περίληψη:
IEEE 802.16 technology also well known as WiMax is poised to deliver the next step in the wireless evolution. This is further fostered by the 802.16e specification which, amongst other things, introduces support for mobility. The Multicast/Broadcast Service (MBS) is also an integral part of 802.16e destined to deliver next generation services to subscribers. In this paper we concentrate on the Multicast and Broadcast Rekeying Algorithm (MBRA) of 802.16e. This algorithm has been recently criticized for various vulnerabilities and security inefficiencies, as its designers are trying to balance wisely between performance and security. After surveying related work, we extensively discuss MBRA security issues and propose the use of a novel asymmetric group key agreement protocol based on the work in Wu et al. (2009) [3]. Our scheme guarantees secure delivery of keys to all the members of a given group and mandates rekeying upon join and leave events. It can prevent insider attacks since only the Base Station possesses a secret encryption key while all other members in the network acquire the transmitted data by using their secret decryption keys. We compare our scheme with related work and demonstrate that although heavier in terms of computing costs, it compensates when scalability and security come to the foreground.
[5]
E. Konstantinou, A. Kontogeorgis, Y. Stamatiou, C. Zaroliagis, On the Efficient Generation of Prime Order Elliptic Curves, Journal of Cryptology, Vol. 23, pp. 477-503, 2010, Springer, indexed in SCI-E

[1]
E. Konstantinou, A. Kontogeorgis, Computing Polynomials of the Ramanujan t_n class invariants, Canadian Mathematical Bulletin, Vol. 52, No. 4, pp. 583-597, 2009, indexed in SCI-E

[1]
I. Chatzigiannakis, E. Konstantinou, V. Liagkou, P. Spirakis, Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks, Electronic Notes in Theoretical Computer Science, Vol. 171, No. 1, pp. 17-31, 2007, Elsevier
[2]
E. Konstantinou, Y. Stamatiou, C. Zaroliagis, Efficient Generation of Secure Elliptic Curves, International Journal of Information Security, Vol. 6, No. 1, pp. 47-63, 2007, Springer, indexed in SCI-E
Επικοινωνία
  • Πρόεδρος: Σκούτας Δημήτριος
  • Προϊσταμένη Γραμματείας: Καραγιάννη Καλλιόπη
  • Γραμματεία Προπτυχιακού: Σχοινάς Αλέξανδρος
  • Γραμματεία Μεταπτυχιακού: Ευγενικού Αργυρώ
  • Email: dicsd [at] aegean [dot] gr
  • Τηλέφωνο: 2273082000
  • Διεύθυνση: Κτήριο Λυμπέρη, Παλαμά 2 & Γοργύρας, Τ.Κ. 83200
  • Ιστοσελίδα: www.icsd.aegean.gr
  • Ωράριο: Δευτέρα - Παρασκευή: 8:00 - 16:00
Στατιστικά Σπουδών
Μέσος Όρος Βαθμού Πτυχίου

7.76

Μέσος χρόνος Απόκτησης Πτυχίου

6.5 έτη

Μαθήματα με εργαστήριο

46

Κύκλοι Σπουδών

6

Μαθήματα Υποχρεωτικά

36

Μαθήματα Κύκλου

8

Σύνολο μαθημάτων για πτυχίο

55

Διπλωματική Εργασία

Υποχρεωτική