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

Nikos Mavrogiannopoulos

dblp:80/10527 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2012
0009-0002-0316-4214ORCID · corroborated

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

Security and privacy · 3 · 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
1 paper
Cryptographic protocols and secure computation · 46% Network security · 46% Cryptographic primitives and cryptanalysis · 7%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › key exchange
diffie-hellman key exchange
0.112012
A cross-protocol attack on the TLS protocol · CCS 2012
Cryptographic protocols and secure computation
key exchange
0.112012
A cross-protocol attack on the TLS protocol · CCS 2012
Network security › protocol security
protocol attacks
0.112012
A cross-protocol attack on the TLS protocol · CCS 2012
Network security › secure communication › secure communication protocol
TLS
0.112012
A cross-protocol attack on the TLS protocol · CCS 2012
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography
0.012012
A cross-protocol attack on the TLS protocol · CCS 2012

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

protocol analysis · 0.1
YearPublicationVenuePosition
2012 Security implications in Kerberos by the introduction of smart cards
abstract
Public key Kerberos (PKINIT) is a standardized authentication and key establishment protocol which is used by the Windows active directory subsystem. In this paper we show that card-based public key Kerberos is flawed. In particular, access to a user's card enables an adversary to impersonate that user even after the adversary's access to the card is revoked. The attack neither exploits physical properties of the card, nor extracts any of its secrets.
Nikos Mavrogiannopoulos, Andreas Pashalidis, Bart Preneel
AsiaCCS1
2012 A cross-protocol attack on the TLS protocol
abstract
This paper describes a cross-protocol attack on all versions of TLS; it can be seen as an extension of the Wagner and Schneier attack on SSL 3.0. The attack presents valid explicit elliptic curve Diffie-Hellman parameters signed by a server to a client that incorrectly interprets these parameters as valid plain Diffie-Hellman parameters. Our attack enables an adversary to successfully impersonate a server to a random client after obtaining 240 signed elliptic curve keys from the original server. While attacking a specific client is improbable due to the high number of signed keys required during the lifetime of one TLS handshake, it is not completely unrealistic for a setting where the server has high computational power and the attacker contents itself with recovering one out of many session keys. We remark that popular open-source server implementations are not susceptible to this attack, since they typically do not support the explicit curve option. Finally we propose a fix that renders the protocol immune to this family of cross-protocol attacks.
Nikos Mavrogiannopoulos, Frederik Vercauteren, Vesselin Velichkov, Bart Preneel
CCS1
2011 A taxonomy of self-modifying code for obfuscation
Nikos Mavrogiannopoulos, Nessim Kisserli, Bart Preneel
Comput. Secur.1