Chandran, Gowri R. ; Lehwalder, Philipp-Florens ; Rometsch, Leandro ; Schneider, Thomas (2023)
Poster: Secure and Differentially Private kth Ranked Element.
CCS '23: ACM SIGSAC Conference on Computer and Communications Security. Copenhagen, Denmark (26.11.2023 - 30.11.2023)
doi: 10.1145/3576915.3624392
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
The problem of finding the kth Ranked Element (KRE) is of particular interest in collaborative studies for financial and medical agencies alike. Many of the applications of KRE deal with sensitive information that needs to be protected. The protocol by Chandran et al. (SECRYPT'22) considers a model where multiple parties hold datasets with many elements and wish to compute the kth element of their joint dataset. In their model, all participating parties interact with a central party in a star network topology. However, they leak some intermediate information to the central party. In this work we use differential privacy techniques to hide this leakage. We use the Laplace mechanism for introducing differentially private noise and use sigmoid scaling to improve the accuracy of the protocol. We show that our modifications have only a small impact on the accuracy. We also give experimental performance results and compare our work to the previous works on KRE.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2023 |
| Autor(en): | Chandran, Gowri R. ; Lehwalder, Philipp-Florens ; Rometsch, Leandro ; Schneider, Thomas |
| Art des Eintrags: | Bibliographie |
| Titel: | Poster: Secure and Differentially Private kth Ranked Element |
| Sprache: | Englisch |
| Publikationsjahr: | 21 November 2023 |
| Verlag: | ACM |
| Buchtitel: | CCS '23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security |
| Veranstaltungstitel: | CCS '23: ACM SIGSAC Conference on Computer and Communications Security |
| Veranstaltungsort: | Copenhagen, Denmark |
| Veranstaltungsdatum: | 26.11.2023 - 30.11.2023 |
| DOI: | 10.1145/3576915.3624392 |
| Kurzbeschreibung (Abstract): | The problem of finding the kth Ranked Element (KRE) is of particular interest in collaborative studies for financial and medical agencies alike. Many of the applications of KRE deal with sensitive information that needs to be protected. The protocol by Chandran et al. (SECRYPT'22) considers a model where multiple parties hold datasets with many elements and wish to compute the kth element of their joint dataset. In their model, all participating parties interact with a central party in a star network topology. However, they leak some intermediate information to the central party. In this work we use differential privacy techniques to hide this leakage. We use the Laplace mechanism for introducing differentially private noise and use sigmoid scaling to improve the accuracy of the protocol. We show that our modifications have only a small impact on the accuracy. We also give experimental performance results and compare our work to the previous works on KRE. |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Praktische Kryptographie und Privatheit DFG-Sonderforschungsbereiche (inkl. Transregio) DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1119: CROSSING – Kryptographiebasierte Sicherheitslösungen als Grundlage für Vertrauen in heutigen und zukünftigen IT-Systemen |
| Hinterlegungsdatum: | 29 Jul 2024 12:36 |
| Letzte Änderung: | 29 Jul 2024 12:36 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum