I am a research assistant and PhD student under the supervision of Prof. Jean-Pierre Hubaux at the Laboratory for Communications and Applications (LCA1) and Bryan Ford at the Decentralized and Distributed Systems Laboratory (DeDiS), at the Ecole Polytechnique Fédérale de Lausanne (EPFL). I earned my MSc and BSc in Computer Science with a specialisation in IT Security from EPFL in 2016.
In 2015, I did a master thesis internship in the NEC research laboratory in Heidelberg, Germany, where I have been involved in the design and implementation of a system enabling proofs of retrievability on deduplicate data.
I am currently working on privacy-preserving data sharing by relying on homomorphic encryption, differential privacy, distributed systems and blockchain technologies.
UnLynx: A Decentralized System for Privacy-ConscioLes données en-ligne ne sont pas accessibles
UnLynx: A Decentralized System for Privacy-Conscious Data Sharing
Current solutions for privacy-preserving data sharing among multiple parties either depend on a centralized authority that must be trusted and provides only weakest-link security (e.g., the entity that manages private/secret cryptographic keys), or leverage on decentralized but impractical approaches (e.g., secure multi-party computation). When the data to be shared are of a sensitive nature and the number of data providers is high, these solutions are not appropriate. Therefore, we present UnLynx, a new decentralized system for efficient privacypreserving data sharing. We consider m servers that constitute a collective authority whose goal is to verifiably compute on data sent from n data providers. UnLynx guarantees the confidentiality, unlinkability between data providers and their data, privacy of the end result and the correctness of computations by the servers. Furthermore, to support differentially private queries, UnLynx can collectively add noise under encryption. All of this is achieved through a combination of a set of new distributed and secure protocols that are based on homomorphic cryptography, verifiable shuffling and zero-knowledge proofs. UnLynx is highly parallelizable and modular by design as it enables multiple security/privacy vs. runtime tradeoffs. Our evaluation shows that UnLynx can execute a secure survey on 400,000 personal data records containing 5 encrypted attributes, distributed over 20 independent databases, for a total of 2,000,000 ciphertexts, in 24 minutes.
- Export as: BibTeX | MARC | MARCXML | DC | EndNote | NLM | RefWorks | RIS
- View as: MARC | MARCXML | DC
- Add to your basket: