Finding Islands on Encrypted Graphs Sifreli Çizgelerde Adalari Bulma

Acir B., Onur E., Onur C. B.

31st IEEE Conference on Signal Processing and Communications Applications, SIU 2023, İstanbul, Türkiye, 5 - 08 Temmuz 2023 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Doi Numarası: 10.1109/siu59756.2023.10223951
  • Basıldığı Şehir: İstanbul
  • Basıldığı Ülke: Türkiye
  • Anahtar Kelimeler: connected components, graph algorithm, homomorphic encryption, privacy preservation
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

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.