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

Stefanie Gerdes

dblp:91/8332 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2014
—ORCID · none

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

Computer networks · 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.

Computer networks
1 paper
Internet of things and sensor networks · 100%
Network and information security
1 paper
Authentication and access control · 77% Cryptographic protocols and secure computation · 23%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
iot security
0.212014
Delegated Authenticated Authorization for Constrained Environments · ICNP 2014
Internet of things and sensor networks
resource-constrained devices
0.212014
Delegated Authenticated Authorization for Constrained Environments · ICNP 2014
Authentication and access control › authorization
delegated authorization
0.212014
Delegated Authenticated Authorization for Constrained Environments · ICNP 2014
Cryptographic protocols and secure computation › secure channel
secure channel establishment
0.112014
Delegated Authenticated Authorization for Constrained Environments · ICNP 2014

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

symmetric cryptography · 0.4
YearPublicationVenuePosition
2014 Delegated Authenticated Authorization for Constrained Environments
abstract
Smart objects are small devices with limited system resources, typically made to fulfill a single simple task. By connecting smart objects and thus forming an Internet of Things, the devices can interact with each other and their users and support a new range of applications. Due to the limitations of smart objects, common security mechanisms are not easily applicable. Small message sizes and the lack of processing power severely limit the devices' ability to perform cryptographic operations. This paper introduces a protocol for delegating client authentication and authorization in a constrained environment. The protocol describes how to establish a secure channel based on symmetric cryptography between resource-constrained nodes in a cross-domain setting. A resource-constrained node can use this protocol to delegate authentication of communication peers and management of authorization information to a trusted host with less severe limitations regarding processing power and memory.
Stefanie Gerdes, Olaf Bergmann, Carsten Bormann
ICNP1
2014 REST-based access to SMIv2-structured information on constrained devices
abstract
Recently, the IETF has generated a number of standards that are intended to be foundational for large networks of constrained devices, also known as the Internet of Things. Among these are a Web transfer protocol realizing the REST (Representational State Transfer) principles, the Constrained Application Protocol (CoAP), and the Concise Binary Object Representation (CBOR). As with the existing Internet, the Internet of Things will need network management. Management of networks has long been governed by the Structure of Management Information V2 (SMIv2), encoded in ASN.1 Basic Encoding Rules (BER) and the Simple Network Management Protocol (SNMP). Supporting multiple protocols and data encoding formats on a very constrained device is wasteful of its capabilities. We examine how CoAP and CBOR could be used for providing REST-based access to SMIv2-structured information on constrained devices in a way that facilitates interoperation with implementations of the existing protocols.
Olaf Bergmann, Carsten Bormann, Stefanie Gerdes
NOMS3
2010 Building a Test Environment for Emulating Link Characteristics of Disruptive Networks
abstract
The rapid evolution of broadband wireless Internet access in the recent years has been accompanied by a plethora of devices and applications that allow mobile users to work remotely or stay in touch with their friends as they go. With the increasing demand for ubiquitous access and the notion of being "always connected", the limitations of today's Internet technologies have become obvious, and various research activities are carried on to re-design aspects of the existing Internet architecture to eventually come to a Future Internet where applications do not suffer from transport protocols that are not able to cope with intermittent connectivity, high delay, and even substantial packet loss. While many clean-slate approaches can use network simulation to validate new protocols, the evaluation of enhancements to existing environments is more difficult. Especially for broadband wireless access involving a complex architecture like the Internet Multimedia Subsystem (IMS) the actual network characteristics cannot be modeled easily. To avoid oversimplification of simulation models, we have developed a tool set to measure some characteristics of a real network path and parameterize a link emulator based on the recorded data. The emulator uses the capabilities of the Linux packet scheduler and its queueing disciplines (qdiscs) to facilitate the evaluation of applications and protocols when facing these network conditions. Our approach enables reproducible tests of application behavior in a lab environment, without the uncertainties of changing conditions in the real world. The emulator was used in a research project to improve existing applications that are run on mobile devices while traveling. To dimension the emulator hardware, we have backed on a preliminary study on the prevalent application protocols being used in the target environment. The results presented here indicate that the Linux packet scheduler can be used to create a simple yet powerful emulation engine for changing network conditions.
Stefanie Gerdes, Olaf Bergmann
WCNC1