Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Seyed Ali Ahmadzadeh

dblp:30/8858 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 3 first-authorSecurity and privacy · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
3 papers
Network security · 58% Digital forensics and information hiding · 21% Authentication and access control · 21%
Computer networks
2 papers
Wireless networking · 84% Physical-layer communications · 16%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network security
covert channel
0.322013
Turbo covert channel: An iterative framework for covert communication over data networks · INFOCOM 2013
Covert channels in multiple access protocols · SIGCOMM 2011
Network security › covert channel
covert timing channel
0.212013
Turbo covert channel: An iterative framework for covert communication over data networks · INFOCOM 2013
Digital forensics and information hiding
undetectability
0.212013
Turbo covert channel: An iterative framework for covert communication over data networks · INFOCOM 2013
Wireless networking › medium access control
carrier sense multiple access
0.112011
Covert channels in multiple access protocols · SIGCOMM 2011
Wireless networking
multiple access protocols
0.112011
Covert channels in multiple access protocols · SIGCOMM 2011
Authentication and access control › authentication
multicast authentication
0.112011
Poster: a geometric approach for multicast authentication in adversarial channels · CCS 2011
Physical-layer communications
modulation and demodulation
0.012013
Turbo covert channel: An iterative framework for covert communication over data networks · INFOCOM 2013
Coding theory
trellis codes
0.012013
Turbo covert channel: An iterative framework for covert communication over data networks · INFOCOM 2013
Authentication and access control › authentication
authentication protocols
0.012011
Poster: a geometric approach for multicast authentication in adversarial channels · CCS 2011

Methods — techniques the papers use, named apart from their topics

trellis structure · 0.5iterative demodulation/decoding · 0.5adaptive modulation · 0.5covert channel design · 0.2geometric approach · 0.1
YearPublicationVenuePosition
2013 Turbo covert channel: An iterative framework for covert communication over data networks
abstract
Inspired by the challenges of designing a robust, and undetectable covert channel, in this paper we introduce a design methodology for timing covert channels that achieve provable polynomial-time undetectability. This means that the covert channel can not be detected by any polynomial-time statistical test that analyzes the samples of the covert traffic and the legitimate traffic. The proposed framework is based on modeling the covert channel as a differential communication channel, and the formulation for modulation/demodulation processes that are derived according to the communication model. The proposed scheme incorporates a trellis structure in modulating the covert message. The trellis structure is also used at the covert receiver to perform iterative demodulation/decoding of the covert message that significantly enhances the channel reliability. In addition, the paper presents an adaptive modulation strategy that improves the channel robustness without compromising the stealthiness of the channel. The combination of the adaptive modulation and the trellis structure gives the covert channel considerable flexibility and low error rate at the covert receiver. In fact, performance analysis of the channel reveals that the proposed covert communication scheme withstands extremely high levels of network noise and adversarial disruption, while it maintains an outstanding undetectability level and covert rate.
Seyed Ali Ahmadzadeh, Gordon B. Agnew
INFOCOM1
2011 Poster: a geometric approach for multicast authentication in adversarial channels
Seyed Ali Ahmadzadeh, Gordon B. Agnew
CCS1
2011 Behavioral Mimicry Covert Communication
Seyed Ali Ahmadzadeh, Gordon B. Agnew
SecureComm1
2011 Covert channels in multiple access protocols
abstract
In this paper, the use of structural behavior of communication protocols in designing new covert channels is investigated. In this way, a new covert transmitter is designed based on a modified CSMA protocol that enables the transmitter to embed a covert message in its overt traffic. The proposed scheme provides high covert rate without compromising the stealthiness of the channel.
Seyed Ali Ahmadzadeh, Gordon B. Agnew
SIGCOMM1
2010 Signal space cooperative communication
abstract
In this paper, a single-hop single-relay system with a direct link between the source and the destination is considered when the relay operates in the half-duplex mode. Motivated by the concept of signal space diversity, this paper introduces signal space cooperation, in which cooperation between the source and the relay is achieved using a novel constellation design. In this approach, the original constellation is expanded so that the expanded constellation consists of all possible combinations of different components of signal points in the original constellation. The expanded constellation enables the relay to extract the required information in order to effectively cooperate in the relay phase, and it helps the destination to efficiently combine received signals during the broadcast phase and the relay phase. The analytical study of the proposed scheme leads to the development of two design criteria for the constellation expansion. Numerical results depict superior performance in comparison with other cooperative schemes, such as the distributed turbo coded cooperative schemes and the trans-modulation scheme.
Seyed Ali Ahmadzadeh, Abolfazl S. Motahari, Amir K. Khandani
IEEE Trans. Wirel. Commun.1