Aikaterini (Katerina) Mitrokotsa

Dr. Aikaterini (Katerina) Mitrokotsa


Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2004 in Computer Networks
Verified
Journal Article
Closed access
CDChristos Douligeris
Christos Douligeris
AMAikaterini (Katerina) Mitrokotsa
Aikaterini (Katerina) Mitrokotsa

29 July 2009 in Information Systems Frontiers
Verified
Journal Article
Open access
PDF file
AMAikaterini (Katerina) Mitrokotsa
Aikaterini (Katerina) Mitrokotsa
MRMelanie R. Rieback
Melanie R. Rieback
ATAndrew S. Tanenbaum
Andrew S. Tanenbaum
RFID (Radio Frequency Identification) systems are one of the most pervasive computing technologies with technical potential and profitable opportunities in a diverse area of applications. Among their advantages is included their low cost and their broad applicability. However, they also present a number of inherent vulnerabilities. This paper develops a structural methodology for risks that RFID networks face by developing a classification of RFID attacks, presenting their important features, and discussing possible countermeasures. The goal of the paper is to categorize the existing weaknesses of RFID communication so that a better understanding of RFID attacks can be achieved and subsequently more efficient and effective algorithms, techniques and procedures to combat these attacks may be developed.

1 January 2011 in International Journal of Medical Informatics
Verified
Journal Article
Closed access
PPPedro Peris-Lopez
Pedro Peris-Lopez
AOAgustin Orfila
Agustin Orfila
AMAikaterini (Katerina) Mitrokotsa
Aikaterini (Katerina) Mitrokotsa
JLJan C.A. van der Lubbe
Jan C.A. van der Lubbe

1 January 2013 in Ad Hoc Networks
Verified
Journal Article
Closed access
AMAikaterini (Katerina) Mitrokotsa
Aikaterini (Katerina) Mitrokotsa
CDChristos Dimitrakakis
Christos Dimitrakakis

1 January 2013 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
IBIoana Boureanu
Ioana Boureanu
AMAikaterini (Katerina) Mitrokotsa
Aikaterini (Katerina) Mitrokotsa
SVSerge Vaudenay
Serge Vaudenay

3 June 2015 in Journal of Computer Security
Verified
Journal Article
Closed access
PDF file
IBIoana Boureanu
Ioana Boureanu
AMAikaterini (Katerina) Mitrokotsa
Aikaterini (Katerina) Mitrokotsa
SVSerge Vaudenay
Serge Vaudenay
From contactless payments to remote car unlocking, many applications are vulnerable to relay attacks. Distance bounding protocols are the main practical countermeasure against these attacks. In this paper, we present a formal analysis of SKI, which recently emerged as the first family of lightweight and provably secure distance bounding protocols. More precisely, we explicate a general formalism for distance-bounding protocols, which lead to this practical and provably secure class of protocols (and it could lead to others). We prove that SKI and its variants are provably secure, even under the real-life setting of noisy communications, against the main types of relay attacks: distance-fraud and generalised versions of mafia- and terrorist-fraud. To attain resistance to terrorist-fraud, we reinforce the idea of using secret sharing, combined with the new notion of a leakage scheme. In view of resistance to generalised mafia-frauds (and terrorist-frauds), we present the notion of circular-keying for pseudorandom functions (PRFs); this notion models the employment of a PRF, with possible linear reuse of the key. We also identify the need of PRF masking to fix common mistakes in existing security proofs/claims. Finally, we enhance our design to guarantee resistance to terrorist-fraud in the presence of noise.