Daniel Demmler
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Daniel Demmler has a total of 50 co-authors. Here are the top co-authors by number of shared publications:
- Thomas Schneider
Technical University of Darmstadt, Darmstadt, Germany
7 shared publications Ahmad-Reza Sadeghi
TU Darmstadt, Darmstadt, Germany
1 shared publication- Arthur Meyre
Zama, Paris, France
1 shared publication - Christian Burkert
University of Hamburg
1 shared publication Christian Weinert
Technische Universitat Darmstadt, Germany
1 shared publication- Christian Weinert
University of London
1 shared publication
Latest Publications
- Open Access
- 30 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-11
DealSecAgg: Efficient Dealer-Assisted Secure Aggregation for Federated Learning
Federated learning eliminates the necessity of transferring private training data and instead relies on the aggregation of model updates. Several publications on privacy attacks show how these individual model updates are vulnerable to the extraction of sensitive information. State-of-the-art secure aggregation protocols provide privacy for participating clients, yet, they are restrained by high computation and communication overhead. We propose the efficient secure aggregation protocol DealSecAgg. The cryptographic scheme is based on a lightweight single-masking approach and allows the aggregation of the global model under encryption. DealSecAgg utilizes at least one additional dealer party to outsource the aggregation of masks and to reduce the computational complexity for mobile clients. At the same time, our protocol is scalable and resilient against client dropouts. We provide a security proof and experimental results regarding the performance of DealSecAgg. The experimental evidence on the CIFAR-10 data set confirms that using our protocol, model utility remains unchanged compared to plain federated learning. Furthermore, the results show how our work outperforms other state-of-the-art masking strategies both in the number of communication rounds per training step and in computational costs, which grows linearly in the amount of active clients. By employing our protocol, runtimes can be reduced by up to 87.8% compared to related work.
- 30 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessDealSecAgg: Efficient Dealer-Assisted Secure Aggregation for Federated Learning
Federated learning eliminates the necessity of transferring private training data and instead relies on the aggregation of model updates. Several publications on privacy attacks show how these individual model updates are vulnerable to the extraction of sensitive information. State-of-the-art secure aggregation protocols provide privacy for participating clients, yet, they are restrained by high computation and communication overhead. We propose the efficient secure aggregation protocol DealSecAgg. The cryptographic scheme is based on a lightweight single-masking approach and allows the aggregation of the global model under encryption. DealSecAgg utilizes at least one additional dealer party to outsource the aggregation of masks and to reduce the computational complexity for mobile clients. At the same time, our protocol is scalable and resilient against client dropouts. We provide a security proof and experimental results regarding the performance of DealSecAgg. The experimental evidence on the CIFAR-10 data set confirms that using our protocol, model utility remains unchanged compared to plain federated learning. Furthermore, the results show how our work outperforms other state-of-the-art masking strategies both in the number of communication rounds per training step and in computational costs, which grows linearly in the amount of active clients. By employing our protocol, runtimes can be reduced by up to 87.8% compared to related work.
- Open Access
- 26 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 35-46
Noah's Ark: Efficient Threshold-FHE Using Noise Flooding
We outline a secure and efficient methodology to do threshold distributed decryption for LWE based Fully Homomorphic Encryption schemes. Due to the smaller parameters used in some FHE schemes, such as Torus-FHE (TFHE), the standard technique of "noise flooding'' seems not to apply. We show that noise flooding can also be used with schemes with such small parameters, by utilizing a switch to a scheme with slightly higher parameters and then utilizing the efficient bootstrapping operations which TFHE offers. Our protocol is proved secure via a simulation argument, making its integration in bigger protocols easier to manage.
- 26 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 35-46
Open AccessNoah's Ark: Efficient Threshold-FHE Using Noise Flooding
We outline a secure and efficient methodology to do threshold distributed decryption for LWE based Fully Homomorphic Encryption schemes. Due to the smaller parameters used in some FHE schemes, such as Torus-FHE (TFHE), the standard technique of "noise flooding'' seems not to apply. We show that noise flooding can also be used with schemes with such small parameters, by utilizing a switch to a scheme with slightly higher parameters and then utilizing the efficient bootstrapping operations which TFHE offers. Our protocol is proved secure via a simulation argument, making its integration in bigger protocols easier to manage.
- 18 June 2022
- Published by Springer Nature
- p. 376-395
Probing for Passwords – Privacy Implications of SSIDs in Probe Requests
- 18 June 2022
- Published by Springer Nature
- p. 376-395
Probing for Passwords – Privacy Implications of SSIDs in Probe Requests
- 1 April 2022
- Published by Walter de Gruyter GmbH in it - Information Technology
- Vol. 64 (1-2) , 49-53
Towards practical privacy-preserving protocols
Protecting users’ privacy in digital systems becomes more complex and challenging over time, as the amount of stored and exchanged data grows steadily and systems become increasingly involved and connected. Two techniques that try to approach this issue are the privacy-preserving protocols secure multi-party computation (MPC) and private information retrieval (PIR), which aim to enable practical computation while simultaneously keeping sensitive data private. In the dissertation [Daniel Demmler. “Towards Practical Privacy-Preserving Protocols”. Diss. Darmstadt: Technische Universität, 2018. url: http://tuprints.ulb.tu-darmstadt.de/8605/], summarized in this article, we present results showing how real-world applications can be executed in a privacy-preserving way. This is not only desired by users of such applications, but since 2018 also based on a strong legal foundation with the GDPR in the European Union, that enforces privacy protection of user data by design.
- 1 April 2022
- Published by Walter de Gruyter GmbH in it - Information Technology
- Vol. 64 (1-2) , 49-53
Towards practical privacy-preserving protocols
Protecting users’ privacy in digital systems becomes more complex and challenging over time, as the amount of stored and exchanged data grows steadily and systems become increasingly involved and connected. Two techniques that try to approach this issue are the privacy-preserving protocols secure multi-party computation (MPC) and private information retrieval (PIR), which aim to enable practical computation while simultaneously keeping sensitive data private. In the dissertation [Daniel Demmler. “Towards Practical Privacy-Preserving Protocols”. Diss. Darmstadt: Technische Universität, 2018. url: http://tuprints.ulb.tu-darmstadt.de/8605/], summarized in this article, we present results showing how real-world applications can be executed in a privacy-preserving way. This is not only desired by users of such applications, but since 2018 also based on a strong legal foundation with the GDPR in the European Union, that enforces privacy protection of user data by design.
- Open Access
- 1 January 2021
- Published by INSTICC
- p. 444-451
Improved Circuit Compilation for Hybrid MPC via Compiler Intermediate Representation
- 1 January 2021
- Published by INSTICC
- p. 444-451
Open AccessImproved Circuit Compilation for Hybrid MPC via Compiler Intermediate Representation
- Open Access
- 10 November 2018
- Published by Springer Nature
- p. 71-92
Privacy-Preserving Whole-Genome Variant Queries
- 10 November 2018
- Published by Springer Nature
- p. 71-92
Open AccessPrivacy-Preserving Whole-Genome Variant Queries
- Open Access
- 29 August 2018
- Published by Privacy Enhancing Technologies Symposium Advisory Board in Proceedings on Privacy Enhancing Technologies
- Vol. 2018 (4) , 159-178
PIR-PSI: Scaling Private Contact Discovery
An important initialization step in many social-networking applications is contact discovery, which allows a user of the service to identify which of its existing social contacts also use the service. Naïve approaches to contact discovery reveal a user’s entire set of social/professional contacts to the service, presenting a significant tension between functionality and privacy. In this work, we present a system forprivatecontact discovery, in which the client learnsonlythe intersection of its own contact list and a server’s user database, and the server learns only the (approximate) size of the client’s list. The protocol is specifically tailored to the case of a small client set and large user database. Our protocol has provable security guarantees and combines new ideas with state-of-the-art techniques from private information retrieval and private set intersection.We report on a highly optimized prototype implementation of our system, which is practical on real-world set sizes. For example, contact discovery between a client with 1024 contacts and a server with 67 million user entries takes 1.36 sec (when using server multi-threading) and uses only 4.28 MiB of communication.
- 29 August 2018
- Published by Privacy Enhancing Technologies Symposium Advisory Board in Proceedings on Privacy Enhancing Technologies
- Vol. 2018 (4) , 159-178
Open AccessPIR-PSI: Scaling Private Contact Discovery
An important initialization step in many social-networking applications is contact discovery, which allows a user of the service to identify which of its existing social contacts also use the service. Naïve approaches to contact discovery reveal a user’s entire set of social/professional contacts to the service, presenting a significant tension between functionality and privacy. In this work, we present a system forprivatecontact discovery, in which the client learnsonlythe intersection of its own contact list and a server’s user database, and the server learns only the (approximate) size of the client’s list. The protocol is specifically tailored to the case of a small client set and large user database. Our protocol has provable security guarantees and combines new ideas with state-of-the-art techniques from private information retrieval and private set intersection.We report on a highly optimized prototype implementation of our system, which is practical on real-world set sizes. For example, contact discovery between a client with 1024 contacts and a server with 67 million user entries takes 1.36 sec (when using server multi-threading) and uses only 4.28 MiB of communication.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 931-936
CogniCrypt: Supporting developers in using cryptography
Previous research suggests that developers often struggle using low-level cryptographic APIs and, as a result, produce insecure code. When asked, developers desire, among other things, more tool support to help them use such APIs. In this paper, we present CogniCrypt, a tool that supports developers with the use of cryptographic APIs. CogniCrypt assists the developer in two ways. First, for a number of common cryptographic tasks, CogniCrypt generates code that implements the respective task in a secure manner. Currently, CogniCrypt supports tasks such as data encryption, communication over secure channels, and long-term archiving. Second, CogniCrypt continuously runs static analyses in the background to ensure a secure integration of the generated code into the developer's workspace. This video demo showcases the main features of CogniCrypt: youtube.com/watch?v=JUq5mRHfAWY.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 931-936
CogniCrypt: Supporting developers in using cryptography
Previous research suggests that developers often struggle using low-level cryptographic APIs and, as a result, produce insecure code. When asked, developers desire, among other things, more tool support to help them use such APIs. In this paper, we present CogniCrypt, a tool that supports developers with the use of cryptographic APIs. CogniCrypt assists the developer in two ways. First, for a number of common cryptographic tasks, CogniCrypt generates code that implements the respective task in a secure manner. Currently, CogniCrypt supports tasks such as data encryption, communication over secure channels, and long-term archiving. Second, CogniCrypt continuously runs static analyses in the background to ensure a secure integration of the generated code into the developer's workspace. This video demo showcases the main features of CogniCrypt: youtube.com/watch?v=JUq5mRHfAWY.
- 26 June 2017
- Published by Springer Nature
- p. 599-619
OnionPIR: Effective Protection of Sensitive Metadata in Online Communication Networks
- 26 June 2017
- Published by Springer Nature
- p. 599-619
OnionPIR: Effective Protection of Sensitive Metadata in Online Communication Networks