Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Confidential Greedy Graph Algorithm

Waszkiewicz D., Horubala A., Sapiecha P., Andrzejczak M.

International Journal of Electronics and Telecommunications

2018

Vol. 64, No. 2

179--183

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.