- Tytuł:
- Confidential Greedy Graph Algorithm
- Autorzy:
-
Waszkiewicz, D.
Horubala, A.
Sapiecha, P.
Andrzejczak, M. - Powiązania:
- https://bibliotekanauki.pl/articles/226681.pdf
- Data publikacji:
- 2018
- Wydawca:
- Polska Akademia Nauk. Czytelnia Czasopism PAN
- Tematy:
-
cryptography
fully homomorphic encryption
confidential graph algorithm
cloud computing - Opis:
- Confidential algorithm for the approximate graph vertex covering problem is presented in this article. It can preserve privacy of data at every stage of the computation, which is very important in context of cloud computing. Security of our solution is based on fully homomorphic encryption scheme. The time complexity and the security aspects of considered algorithm are described.
- Źródło:
-
International Journal of Electronics and Telecommunications; 2018, 64, 2; 179-183
2300-1933 - Pojawia się w:
- International Journal of Electronics and Telecommunications
- Dostawca treści:
- Biblioteka Nauki
Artykuł