Kurt Rothermel

Follower

Following

Public Views

Interests

Uploads

Papers by Kurt Rothermel

Towards a Generic Trust Model – Comparison of Various Trust Update Algorithms

Lecture Notes in Computer Science, 2005

Presentation by Petri Yllö 1.11.2006 Agenda • Background, motivation and goals • Trust definition... more

Download

Strong pseudonymous communication for peer-to-peer reputation systems

Proceedings of the 2005 ACM symposium on Applied computing, 2005

In this paper we present a novel approach to enable untraceable communication between pseudonyms.... more In this paper we present a novel approach to enable untraceable communication between pseudonyms. Our work provides strong sender and recipient anonymity by eliminating the need to know of each other's address. We use a variation of Chaum mixes to achieve unlinkability between sender and recipient and introduce a concept called extended destination routing (EDR) which relies on routing headers constructed in multiple layers of encryption and published in a distributed hash table (DHT). In order to communicate, a sender requests from the DHT the recipient's routing header, which is extended and used for routing the message via a mix cascade to this recipient. This work was performed in the context of the UniTEC reputation system and describes the functionality of its anonymous communication layer, which is completely independent of the other UniTEC layers. Although trust and reputation systems in general are typical application areas for our contribution, the presented concepts are suitable for various other application areas as well. We have implemented a prototype of UniTEC and present the first results from an ongoing evaluation in our network emulation testbed.

Download

Maintaining update-linearizability for replicated information in MANETs

COMmunication System softWAre and MiddlewaRE, 2006

In the process of observing changes in our surroundings, the chronological ordering of these obse... more In the process of observing changes in our surroundings, the chronological ordering of these observations plays a crucial role. The same holds for many applications that employ sensors to gather information about their physical environment in order to adapt to changes. In this paper, we present a data replication algorithm for mobile ad hoc and sensor networks that guarantees chronological

Kurt Rothermel

Uploads

Papers by Kurt Rothermel

Log In