Kiss, Ágnes ; Schick, Oliver ; Schneider, Thomas (2019)
Web Application for Privacy-Preserving Scheduling using Secure Computation.
16th International Joint Conference on e-Business and Telecommunications. Prague, Czech Republic (26.07.2019 - 28.07.2019)
doi: 10.5220/0007947704560463
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
Event scheduling applications such as Doodle allow for very limited privacy protection. Even if the participants are anonymous, their inputs are revealed to the poll administrator and the application server. There exist privacy-enhanced scheduling services (e.g., Kellermann and Böhme, CSE’09), but they require heavy computation and communication on the client’s side, leak information to the participants or poll administrator, and allow only for a restricted scheduling functionality. In this work, we present a privacy-preserving scheduling system based on secure two-party computation, that allows to schedule meetings between a large number of participants efficiently, without requiring any participant to reveal its availability pattern or other sensitive information to any other participant, server, or even the poll administrator. The protocol allows for various functional extensions and requires the client to perform very little work when securely submitting its inputs. Our protocol is secure against semi-honest non-colluding servers and malicious participants.
Typ des Eintrags: | Konferenzveröffentlichung |
---|---|
Erschienen: | 2019 |
Autor(en): | Kiss, Ágnes ; Schick, Oliver ; Schneider, Thomas |
Art des Eintrags: | Bibliographie |
Titel: | Web Application for Privacy-Preserving Scheduling using Secure Computation |
Sprache: | Englisch |
Publikationsjahr: | Juli 2019 |
Verlag: | SciTePress |
Buchtitel: | Proceedings of the 16th International Joint Conference on e-Business and Telecommunications SECRYPT - Volume 1 |
Veranstaltungstitel: | 16th International Joint Conference on e-Business and Telecommunications |
Veranstaltungsort: | Prague, Czech Republic |
Veranstaltungsdatum: | 26.07.2019 - 28.07.2019 |
DOI: | 10.5220/0007947704560463 |
Kurzbeschreibung (Abstract): | Event scheduling applications such as Doodle allow for very limited privacy protection. Even if the participants are anonymous, their inputs are revealed to the poll administrator and the application server. There exist privacy-enhanced scheduling services (e.g., Kellermann and Böhme, CSE’09), but they require heavy computation and communication on the client’s side, leak information to the participants or poll administrator, and allow only for a restricted scheduling functionality. In this work, we present a privacy-preserving scheduling system based on secure two-party computation, that allows to schedule meetings between a large number of participants efficiently, without requiring any participant to reveal its availability pattern or other sensitive information to any other participant, server, or even the poll administrator. The protocol allows for various functional extensions and requires the client to perform very little work when securely submitting its inputs. Our protocol is secure against semi-honest non-colluding servers and malicious participants. |
Freie Schlagworte: | Engineering, E4 |
Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Praktische Kryptographie und Privatheit DFG-Sonderforschungsbereiche (inkl. Transregio) DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche Profilbereiche Profilbereiche > Cybersicherheit (CYSEC) LOEWE LOEWE > LOEWE-Zentren LOEWE > LOEWE-Zentren > CRISP - Center for Research in Security and Privacy DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1119: CROSSING – Kryptographiebasierte Sicherheitslösungen als Grundlage für Vertrauen in heutigen und zukünftigen IT-Systemen |
Hinterlegungsdatum: | 28 Mai 2019 13:16 |
Letzte Änderung: | 06 Aug 2024 08:46 |
PPN: | |
Export: | |
Suche nach Titel in: | TUfind oder in Google |
![]() |
Frage zum Eintrag |
Optionen (nur für Redakteure)
![]() |
Redaktionelle Details anzeigen |