@article{Waszkiewicz_Daniel_Confidential_2018,
 author={Waszkiewicz, Daniel and Horubała, Aleksandra and Sapiecha, Piotr and Andrzejczak, Michał},
 howpublished={online},
 year={2018},
 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.},
 title={Confidential Greedy Graph Algorithm},
 type={Artykuły / Articles},
 volume={vol. 64},
 number={No 2},
 journal={International Journal of Electronics and Telecommunications},
 publisher={Polish Academy of Sciences Committee of Electronics and Telecommunications},
 doi={10.24425/119367},
 keywords={cryptography, fully homomorphic encryption, confidential graph algorithm, cloud computing},
}