Schick, Oliver (2017)
Web application for privacy-preserving scheduling.
Technische Universität Darmstadt
Bachelorarbeit, Bibliographie

Kurzbeschreibung (Abstract)

Arranging a meeting between multiple parties is a highly recurring task, that is becoming more and more time consuming, the more people and organisations get involved. Without any means of automatization, the arranging of a meeting between a larger amount of parties is very difficult to handle and thus, the need for automatic tool support arises. However, using these tools also raises some concerns regarding the privacy of the participants, as private information may be inferred from the availability patterns the participants publish when partaking in the poll. In this work we will introduce a protocol that allows to schedule meetings even between large amounts of participants, without requiring any participant to reveal his or her availability pattern to any other party. The protocol requires an evaluation function to be defined in order to find the scheduled time and allows for a large set of possible evaluation functions to be used, i.e. every function that can be represented by a Boolean circuit can be used as evaluation function in our protocol. Our protocol needs two servers to compute the evaluation function using a secure two-party computation protocol in order to keep the availability patterns of the participants secret. Therefore, we have to assume that the servers do not collude in order to gain knowledge about the inputs of the participants. Furthermore, if the secure two-party computation protocol used when implementing our protocol does not provide security in the presence of malicious adversaries, we have to assume that the servers are semi-honest.

Frage zum Eintrag

Redaktionelle Details anzeigen