TY - JOUR N2 - 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. L1 - http://journals.pan.pl/Content/103848/PDF/26_1290-4314-1-PB.pdf L2 - http://journals.pan.pl/Content/103848 PY - 2018 IS - No 2 DO - 10.24425/119367 KW - cryptography KW - fully homomorphic encryption KW - confidential graph algorithm KW - cloud computing A1 - Waszkiewicz, Daniel A1 - Horubała, Aleksandra A1 - Sapiecha, Piotr A1 - Andrzejczak, Michał PB - Polish Academy of Sciences Committee of Electronics and Telecommunications VL - vol. 64 DA - 2018.05.15 T1 - Confidential Greedy Graph Algorithm UR - http://journals.pan.pl/dlibra/publication/edition/103848 T2 - International Journal of Electronics and Telecommunications ER -