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

Markus Brandt

dblp:207/6893 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
1since 2021 · last 2021
—ORCID · none

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

Security and privacy · 2 · 2 first-author · 1 since 2021Computer networks · 1 · 1 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
2 papers
Authentication and access control · 64% Cryptographic protocols and secure computation · 32% Network security · 4%
Computer networks
1 paper
Network measurement and analytics · 100%

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

TopicWeightPapersLastEvidence papers
Authentication and access control
certificate authority
0.822021
Evaluating Resilience of Domains in PKI · CCS 2021
Domain Validation++ For MitM-Resilient PKI · CCS 2018
Authentication and access control › certificate authority
domain validation
0.822021
Evaluating Resilience of Domains in PKI · CCS 2021
Domain Validation++ For MitM-Resilient PKI · CCS 2018
Cryptographic protocols and secure computation › key management
public key infrastructure
0.822021
Evaluating Resilience of Domains in PKI · CCS 2021
Domain Validation++ For MitM-Resilient PKI · CCS 2018
Network measurement and analytics
security measurement
0.112021
Evaluating Resilience of Domains in PKI · CCS 2021
Network security › protocol security › DNS security
DNS cache poisoning
0.112018
Domain Validation++ For MitM-Resilient PKI · CCS 2018

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

man-in-the-middle attack · 0.3
YearPublicationVenuePosition
2021 Evaluating Resilience of Domains in PKI
abstract
Domain Validation of PKI, allows to verify ownership over domains and poses the basis for cryptography. A number of recent attacks led to efforts to enhance the security of domain validation by improving the resilience of the vantage points used by the certificate authorities.
Markus Brandt, Haya Schulmann, Michael Waidner
CCS1
2018 Domain Validation++ For MitM-Resilient PKI
abstract
The security of Internet-based applications fundamentally relies on the trustworthiness of Certificate Authorities (CAs). We practically demonstrate for the first time that even a weak off-path attacker can effectively subvert the trustworthiness of popular commercially used CAs. Our attack targets CAs which use Domain Validation (DV) for authenticating domain ownership; collectively these CAs control 99% of the certificates market. The attack utilises DNS Cache poisoning and tricks the CA into issuing fraudulent certificates for domains the attacker does not legitimately own -- namely certificates binding the attacker's public key to a victim domain. We discuss short and long term defences, but argue that they fall short of securing DV. To mitigate the threats we propose Domain Validation++ (DV++). DV++ replaces the need in cryptography through assumptions in distributed systems. While retaining the benefits of DV (automation, efficiency and low costs) DV++ is secure even against Man-in-the-Middle (MitM) attackers. Deployment of DV++ is simple and does not require changing the existing infrastructure nor systems of the CAs. We demonstrate security of DV++ under realistic assumptions and provide open source access to DV++ implementation.
Markus Brandt, Tianxiang Dai, Amit Klein 0001, Haya Schulmann, Michael Waidner
CCS1
2018 Internet As a Source of Randomness
abstract
Pseudorandom Generators (PRGs) play an important role in security of systems and cryptographic mechanisms. Yet, there is a long history of vulnerabilities in practical PRGs.
Markus Brandt, Haya Schulmann, Michael Waidner
HotNets1