Finding Islands on Encrypted Graphs Sifreli Çizgelerde Adalari Bulma

Date

2023-01-01

Author

Acir, Berker
Onur, Ertan
Onur, Cansu Betin

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

31
views

0
downloads

Cloud computing services have found widespread use recently. Offloading computations to public clouds has many benefits albeit harming the privacy of users and data. Homomorphic encryption facilitates cloud computing services that can do computations over encrypted data without requiring decryption and this enables privacy-preserving applications. In this paper, we propose an approach for confidentially finding islands (connected components) in a graph. We present various performance evaluation results and show that privacy-preservation can be achieved with a cost of computation overhead.

Subject Keywords

connected components, graph algorithm, homomorphic encryption, privacy preservation

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85173505496&origin=inward
https://hdl.handle.net/11511/107394

DOI

https://doi.org/10.1109/siu59756.2023.10223951

Conference Name

31st IEEE Conference on Signal Processing and Communications Applications, SIU 2023

Collections

Department of Computer Engineering, Conference / Seminar

Citation Formats

B. Acir, E. Onur, and C. B. Onur, “Finding Islands on Encrypted Graphs Sifreli Çizgelerde Adalari Bulma,” presented at the 31st IEEE Conference on Signal Processing and Communications Applications, SIU 2023, İstanbul, Türkiye, 2023, Accessed: 00, 2023. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85173505496&origin=inward.