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

Henrik Brosenne

dblp:10/4858 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 2011
—ORCID · none

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

Theory of computation · 4 · 4 first-authorDatabases, data management, data science and information retrieval · 2 · 2 first-authorComputer networks · 1Human-computer interaction and ubiquitous computing · 1

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.

Computer networks
1 paper
Cellular and mobile networks · 100%
Network and information security
1 paper
Authentication and access control · 100%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks
mobility management
0.112008
Enabling Pervasiveness by Seamless Inter-domain Handover: Performance Study of PANA Pre-authentication · PerCom 2008
Cellular and mobile networks › mobility management › handover
seamless handover
0.112008
Enabling Pervasiveness by Seamless Inter-domain Handover: Performance Study of PANA Pre-authentication · PerCom 2008
Authentication and access control › network authentication
network access authentication
0.112008
Enabling Pervasiveness by Seamless Inter-domain Handover: Performance Study of PANA Pre-authentication · PerCom 2008
Cellular and mobile networks › mobility management › handover
inter-domain handover
0.012008
Enabling Pervasiveness by Seamless Inter-domain Handover: Performance Study of PANA Pre-authentication · PerCom 2008

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

simulation · 0.2
YearPublicationVenuePosition
2011 Security Verification of Trust-Based Authentication Handover in IP Networks
abstract
This paper presents a formal analysis of an authentication handover framework. The framework provides a fast re-authentication mechanism to authenticate a mobile node that moves through different domains without the need to communicate with the home domain. We model the protocol using the high level protocol specification language (HLPSL) and we verify our model using the AVISPA model checking tool. Two main security properties are checked: authenticity and secrecy. We consider different scenarios in order to verify the protocol. Our results show that the protocol fulfills its requirements in almost all tested scenarios.
Saleh Al-shadly, Omar Alfandi, Henrik Brosenne, Dieter Hogrefe
ICCCN3
2008 Enabling Pervasiveness by Seamless Inter-domain Handover: Performance Study of PANA Pre-authentication
abstract
Pervasive wireless networking requires continuous connection to the Internet while moving from one administration domain to another. To enable continuous connection seamless handover has to be ensured. A concept to ensure seamless handover is the make-before-break approach which can be achieved by performing the pre-authentication in the new domain while maintaining connection to current domain. The duration of the authentication is critical for the handover process because if the mobile nodes move very fast the remaining amount of time of connection to the current domain can become very limited. Therefore, it is a vital issue for seamless mobility to study the authentication performance of a pre-authentication framework. In this paper we model an authentication infrastructure and consider a scenario in which a high number of nodes handover to a new administration domain. The simulation of the authentication process shows the relation between authentication performance and traffic intensity. Furthermore we identify some critical points and potential bottlenecks of this pre-authentication approach.
Patryk Chamuczynski, Omar Alfandi, Henrik Brosenne, Constantin Werner, Dieter Hogrefe
PerCom3
2007 On approximation by XOR-OBDDs
Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack
Inf. Process. Lett.1
2006 Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance
Henrik Brosenne, Matthias Homeister, Stephan Waack
Inf. Process. Lett.1
2003 Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs
Henrik Brosenne, Matthias Homeister, Stephan Waack
MFCS1
2001 Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds
Henrik Brosenne, Matthias Homeister, Stephan Waack
MFCS1