Sherif Khattab

Sherif Khattab

Auto-generated profile, based on publicly available information

Sherif Khattab

Department of Computer Science, Faculty of computers and Information, Cairo University, Egypt

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
1 January 2004
Verified
Conference Paper
Closed access
SKS.M. Khattab
S.M. Khattab
CSC. Sangpachatanaruk
C. Sangpachatanaruk
DMD. Mosse
D. Mosse
RMR. Melhem
R. Melhem
TZT. Znati
T. Znati
Honeypots have been proposed to act as traps for malicious attackers. However, because of their deployment at fixed (thus detectable) locations and on machines other than the ones they are supposed to protect, honeypots can be avoided by sophisticated attacks. We propose roaming honeypots, a mechanism that allows the locations of honeypots to be unpredictable, continuously changing, and disguised within a server pool. A (continuously changing) subset of the servers is active and providing service, while the rest of the server pool is idle and acting as honeypots. We utilize our roaming honeypots scheme to mitigate the effects of service-level DoS attacks, in which many attack machines acquire service from a victim server at a high rate, against back-end servers of private services. The roaming honeypots scheme detects and filters attack traffic from outside a firewall (external attacks), and also mitigates attacks from behind a firewall (internal attacks) by dropping all connections when a server switches from acting as a honeypot into being active. Through ns-2 simulations, we show the effectiveness of our roaming honeypots scheme. In particular, against external attacks, our roaming honeypots scheme provides service response time that is independent of attack load for a fixed number of attack machines.

22 September 2008
Verified
Conference Paper
Open access
PDF file
SKSherif Khattab
Sherif Khattab
DMDaniel Mosse
Daniel Mosse
RMRami Melhem
Rami Melhem

1 January 2006
Verified
Conference Paper
Closed access
SGSameh Gobriel
Sameh Gobriel
SKSherif Khattab
Sherif Khattab
DMDaniel Mosse
Daniel Mosse
JBJose Brustoloni
Jose Brustoloni
RMRami Melhem
Rami Melhem
In wireless sensor networks (WSNs), the users' objective is to extract useful global information by collecting individual sensor readings. Conventionally, this is done using in-network aggregation on a spanning tree from sensors to data sink. However, the spanning tree structure is not robust against communication errors; when a packet is lost, so is a complete subtree of values. Multipath routing can mask some of these errors, but on the other hand, may aggregate individual sensor values multiple times. This may produce erroneous results when dealing with duplicate-sensitive aggregates, such as SUM, COUNT, and AVERAGE. In this paper, we present and analyze two new fault tolerant schemes for duplicate-sensitive aggregation in WSNs: (1) cascaded ridesharing and (2) diffused ridesharing. These schemes use the available path redundancy in the WSN to deliver a correct aggregate result to the data sink. Compared to state-of-the-art, our schemes deliver results with lower root mean square (RMS) error and consume much less energy and bandwidth. RideSharing can consume as much as 50% less resources than hash-based schemes, such as SKETCHES and synopsis diffusion, while achieving lower RMS for reasonable link error rates

1 October 2016 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
MAMustafa M. Al-Sayed
Mustafa M. Al-Sayed
SKSherif Khattab
Sherif Khattab
FOFatma A. Omara
Fatma A. Omara


1 January 2003
Verified
Conference Paper
Closed access
SKS.M. Khattab
S.M. Khattab
CSC. Sangpachatanaruk
C. Sangpachatanaruk
RMR. Melhem
R. Melhem
DMD. L Mosse
D. L Mosse
TZT. Znati
T. Znati
We propose a framework based on proactive server roaming to mitigate the effects of denial-of-service (DoS) attacks. The active server proactively changes its location within a pool of servers to defend against unpredictable and undetectable attacks. Only legitimate clients can follow the active server as it roams. We present algorithms that are secure, distributed, randomized, and adaptive for triggering the roaming and determining the next server to roam to. We propose some modifications to the state recovery process of existing TCP connection-migration schemes to suit roaming. Preliminary experiments in a FreeBSD network show that the overhead of server roaming is small, in terms of response time, in the absence of attacks. Further, during an attack, roaming significantly improves the response time.