@inproceedings{Ringmann2018Requirements,

title = {Requirements for legally compliant software based on the GDPR},

author = {Sandra Domenique Ringmann and Hanno Langweg and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2018/10/ringmann2018requirements.pdf},

year  = {2018},

date = {2018-10-22},

urldate = {1000-01-01},

booktitle = {Cloud and Trusted Computing 2018 (C&TC 2018)},

abstract = {We identify 74 generic, reusable technical requirements based on the GDPR that can be applied to software products which process personal data. The requirements can be traced to corresponding articles and recitals of the GDPR and fulfil the key principles of lawfulness and transparency. Therefore, we present an approach to requirements engineering with regard to developing legally compliant software that satisfies the principles of privacy by design, privacy by default as well as security by design.},

keywords = {Cloud Computing, Data Protection, GDPR, Privacy},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Kaiser2015Multicast-avoiding,

title = {A Multicast-Avoiding Privacy Extension for the Avahi Zeroconf Daemon},

author = {Daniel Kaiser and Andreas Rain and Marcel Waldvogel and Holger Strittmatter},

url = {https://netfuture.ch/wp-content/uploads/2014/12/kaiser2015multicast-avoiding.pdf

https://netfuture.ch/wp-content/uploads/2015/03/mdns-security-poster.pdf},

year  = {2015},

date = {2015-03-10},

urldate = {1000-01-01},

booktitle = {NetSys 2015},

publisher = {Gesellschaft für Informatik},

abstract = {In today’s local networks, a significant amount of traffic is caused by Multicast packets, such as Multicast DNS Service Discovery (mDNS-SD), a widespread technique used for configurationless service distribution and discovery. It suffers from two major problems inherent in multicast: privacy and network load. We present a privacy extension for the Avahi Zeroconf Daemon that tackles both problems while being very efficient.},

keywords = {DNS-SD, Privacy, Security, Zeroconf},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Waldvogel2015Boost,

title = {Boost DNS Privacy, Reliability, and Efficiency with opDNS Safe Query Elimination},

author = {Marcel Waldvogel and Thomas Zink},

url = {https://netfuture.ch/wp-content/uploads/2014/12/waldvogel2015boost.pdf

https://netfuture.ch/wp-content/uploads/2015/03/opdns-poster.pdf},

year  = {2015},

date = {2015-03-10},

urldate = {1000-01-01},

booktitle = {NetSys 2015},

publisher = {Gesellschaft für Informatik},

abstract = {SRV records, DNSSEC, and DANE among others fortify the Domain Name System as the central information hub behind the Internet. Largely hidden from the end user, an increasing number of protocol and trust decisions are contingent on DNS. Neglect or attacks on DNS have much more impact today than ever, now endangering security far beyond denial of service. Opportunistic Persistent DNS (opDNS) addresses these problems by abandoning pessimistic caching and eliminating unnecessary traffic. Today’s DNS infrastructure relies on the hosts forgetting and refreshing DNS records in relatively short time. In conjunction with TLS, opDNS greatly reduces the number of queries and in turn increases privacy, reliability, and efficiency. Even with DNS lookups all but eliminated for frequently visited secure services, changes to the server addresses will be recognized almost immediately, unlike standard DNS. We will show how end systems can take advantage of opDNS without having to wait for support by server operators or application developers, enabling the most effective way of deployment.},

keywords = {DNS, Privacy, Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@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{Kaiser2014Efficient,

title = {Efficient Privacy Preserving Multicast DNS Service Discovery},

author = {Daniel Kaiser and Marcel Waldvogel},

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

year  = {2014},

date = {2014-08-23},

urldate = {1000-01-01},

booktitle = {Workshop on Privacy-Preserving Cyberspace Safety and Security (CSS)},

abstract = {In today’s local networks a significant amount of traffic is caused by Multicast DNS Service Discovery (mDNS-SD), a prevalent technique used for configurationless service distribution and discovery. It allows users to offer and use services like device synchronization, file sharing, and chat, when joining a local network without any manual configuration. While this is very convenient, 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. Another problem is the huge amount of multicast traffic caused, which is especially relevant for large WiFi networks.

In this paper we present a privacy extension that does not publish private information and reduces the number of packets sent while still not requiring any network configuration except for an initial pairing per pair of users. A key feature of our solution is the ease of upgrading existing systems, a must for widespread deployment and acceptance. We developed an implementation based on the open-source Avahi daemon to show the feasibility of our privacy extension. Our solution grants tunable privacy and reduces multicast traffic without affecting user experience.},

keywords = {DNS-SD, Multicast, Privacy, Service Discovery, Zeroconf},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Zink2012Efficient,

title = {Efficient BitTorrent handshake obfuscation},

author = {Thomas Zink and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2015/02/zink2012efficient.pdf},

isbn = {978-1-4503-1148-9},

year  = {2012},

date = {2012-05-08},

urldate = {1000-01-01},

booktitle = {Proceedings of the First Workshop on P2P and Dependability},

publisher = {ACM},

abstract = {During the last decade, large scale media distribution populated peer-to-peer applications. Faced with ever increasing volumes of traffic, legal threats by copyright holders, and QoS demands of customers, network service providers are urged to apply traffic classification and shaping techniques. These highly integrated systems require constant maintenance, introduce legal issues, and violate both the net neutrality and end-to-end principles.



Clients see their freedom and privacy attacked. Users, application programmers, and even commercial service providers laboriously strive to hide their interests and circumvent classification techniques. While changing the network infrastructure is by nature very complex, and it reacts only slowly to new conditions, updating and distributing software between users is easy and practically instantaneous.



We present a new obfuscation extension to the BitTorrent protocol, which allows signature free handshaking. The extension requires no changes to the infrastructure and is fully backwards compatible. With only little change to client software, contemporary classification techniques can be rendered ineffective.},

keywords = {Peer-to-Peer, Privacy, Security, Traffic Engineering},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Belle2009PathForge,

title = {PathForge: Faithful Anonymization of Movement Data},

author = {Sebastian Kay Belle and Marcel Waldvogel},

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

year  = {2009},

date = {2009-08-17},

urldate = {1000-01-01},

booktitle = {Proceedings of the 1st ACM workshop on Networking, systems, and applications for mobile handhelds (MobiHeld '09)},

pages = {63-64},

abstract = {For most mobile networks, providers need the current position of their users to provide efficient service. The resulting motion data is not only an invaluable source for analyzing traffic or flow patterns, but also for tracking an individual's whereabouts, even without their knowledge. Today, many carry at least one mobile networked device with them wherever they go, day and night. The resulting motion data can be used to reveal the most intimate details of our lives, making this information extremely privacy sensitive. In this paper, we present PathForge, a lightweight solution, which not only fulfills the provider's efficiency requirement, but continues to allow flow pattern analysis, yet provides full privacy for users when not actively involved in a call.},

keywords = {Mobile Networks, Privacy, Security},

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}

}