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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Nadhem J. AlFardan

dblp:82/9056 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2013
—ORCID · none

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

Security and privacy · 4 · 3 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
Cryptographic primitives and cryptanalysis · 51% Cryptographic protocols and secure computation · 29% Hardware security and side channels · 16%
Computer networks
1 paper
Internet architecture and protocols · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › symmetric-key cryptanalysis
plaintext recovery attack		 0.222013
Lucky Thirteen: Breaking the TLS and DTLS Record Protocols · IEEE Symposium on Security and Privacy 2013
Plaintext-Recovery Attacks Against Datagram TLS · NDSS 2012
Internet architecture and protocols › network security
TLS		 0.212013
On the Security of RC4 in TLS · USENIX Security Symposium 2013
Cryptographic primitives and cryptanalysis › stream cipher cryptanalysis
RC4		 0.212013
On the Security of RC4 in TLS · USENIX Security Symposium 2013
Cryptographic protocols and secure computation › secure message transmission
secure channel protocols		 0.212013
Lucky Thirteen: Breaking the TLS and DTLS Record Protocols · IEEE Symposium on Security and Privacy 2013
Cryptographic primitives and cryptanalysis
stream cipher cryptanalysis		 0.212013
On the Security of RC4 in TLS · USENIX Security Symposium 2013
Hardware security and side channels › side-channel attack
timing side channel		 0.212013
Lucky Thirteen: Breaking the TLS and DTLS Record Protocols · IEEE Symposium on Security and Privacy 2013
Network security
traffic analysis		 0.012013
Lucky Thirteen: Breaking the TLS and DTLS Record Protocols · IEEE Symposium on Security and Privacy 2013

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

cryptanalysis · 0.5timing analysis · 0.2distinguishing attack · 0.2
YearPublicationVenuePosition
2013 Lucky Thirteen: Breaking the TLS and DTLS Record Protocols
abstract
The Transport Layer Security (TLS) protocol aims to provide confidentiality and integrity of data in transit across untrusted networks. TLS has become the de facto secure protocol of choice for Internet and mobile applications. DTLS is a variant of TLS that is growing in importance. In this paper, we present distinguishing and plaintext recovery attacks against TLS and DTLS. The attacks are based on a delicate timing analysis of decryption processing in the two protocols. We include experimental results demonstrating the feasibility of the attacks in realistic network environments for several different implementations of TLS and DTLS, including the leading OpenSSL implementations. We provide countermeasures for the attacks. Finally, we discuss the wider implications of our attacks for the cryptographic design used by TLS and DTLS.
Nadhem J. AlFardan, Kenneth G. Paterson
 IEEE Symposium on Security and Privacy1
2013 On the Security of RC4 in TLS
Nadhem J. AlFardan, Daniel J. Bernstein, Kenneth G. Paterson, Bertram Poettering, Jacob C. N. Schuldt
 USENIX Security Symposium1
2012 Plaintext-Recovery Attacks Against Datagram TLS
Kenneth G. Paterson, Nadhem J. AlFardan
 NDSS2
2010 An Analysis of DepenDNS
Nadhem J. AlFardan, Kenneth G. Paterson
 ISC1