Abstract
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.
Go to article