@inproceedings{Kaiser2014Adding,

title = {Adding Privacy to Multicast DNS Service Discovery},

author = {Daniel Kaiser and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2014/08/Kaiser2014Adding.pdf},

year  = {2014},

date = {2014-09-24},

urldate = {1000-01-01},

booktitle = {Proceedings of IEEE TrustCom 2014 (IEEE EFINS 2014 workshop)},

abstract = {Multicast DNS Service Discovery (mDNS-SD), made fashionable through Apple’s \emph{Bonjour}, is a prevalent technique allowing service distribution and discovery in local networks without configuration (Zeroconf). Possible application areas are device synchronization, instant messaging, VoIP, file and screen sharing. It is very convenient for users, because they can connect to and offer services when they enter a network without any manual configuration. However, it requires the public exposure of the offering and requesting identities along with information about the offered and requested services, even when services do not need to be public. Some of the information published by the announcements can be very revealing, including complete lists of family members. In this paper we discuss the privacy problems arising when using mDNS-SD and present our privacy extension, which allows hiding all information published while still not requiring any network configuration except for an initial pairing. A key feature of our solution is the ease of upgrading existing systems, a must for widespread deployment and acceptance. To show the feasibility of our mDNS-SD privacy extension, we developed an implementation based on the open-source \emph{Avahi} daemon.},

keywords = {DNS-SD, Multicast, Peer-to-Peer, Privacy, Service Discovery, Social Networks, Trust, Zeroconf},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Belle2008I,

title = {I Seek for Knowledge: Exploiting Social Properties in Mobile Ad-Hoc Networks},

author = {Sebastian Kay Belle and Muhammad Arshad Islam and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2008/belle08iseek.pdf},

year  = {2008},

date = {2008-11-24},

urldate = {1000-01-01},

booktitle = {In Proceedings of 1st IFIP Wireless Days 2008},

pages = {1-5},

abstract = {New social networks are born each day, at a formal conference, at informal social gathering, at family reunions etc. Internet has already been playing an important role to let people socialize through online social websites. For many users, its still not the optimal way of interaction as one has to be very active updating their activities on the online profiles. With the easy access to mobile devices, modern technologies have now started to adopt to more human of socializing. As these mobile devices accompany their users almost all the time, they can record and observe their users behavior as well as gather information about their social circle. Therefore, they can help users to get information from contacts, that they potentially not even know. In this paper we put our efforts towards the initial design of such an architecture, we call \emph{Mergenet}, that will sniff for information around the user's surrounding, leveraging useful answers on their demand.

},

keywords = {Opportunistic Networks, Privacy, Social Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Belle2008Consistent,

title = {Consistent Deniable Lying: Privacy in Mobile Social Networks},

author = {Sebastian Kay Belle and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2008/belle08consistent.pdf},

year  = {2008},

date = {2008-05-19},

urldate = {1000-01-01},

booktitle = {Pervasive 2008 Workshop on Security and Privacy Issues in Mobile Phone Use (SPMU 2008)},

address = {Sydney, Australia},

abstract = {Social networking is moving to mobile phones. This not only means continuous access, but also allows to link virtual and physical neighbourhood in novel ways. To make such systems useful, personal data such as lists of friends and interests need to be shared with more and frequently unknown people, posing a risk to your privacy. In this paper, we present our approach to social networking, Consistent Deniable Lying (CDL). Using easy-to-understand mechanisms and tuned to this environment, it enables you to meet new friends with joint interests while limiting exposure of your private data. Not only can it be generalised to include “friends of friends” (transitivity) into interest search, it allows you to plausibly refute any allegations of your claimed interests. Unlike prior work, we focus on the application to similarity finding and include the novel aspects of transitivity and deniability, which are key to success in social networks.},

keywords = {Opportunistic Networks, Peer-to-Peer, Privacy, Security, Social Networks},

pubstate = {published},

tppubtype = {inproceedings}

}