Confidential Greedy Graph Algorithm
Daniel Waszkiewicz , Aleksandra Horubała , Piotr Sapiecha , Michał Andrzejczak
AbstractConfidential 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.
|Journal series||International Journal of Electronics and Telecommunications [do 2009: Electronics and Telecommunications Quarterly], ISSN 2081-8491, e-ISSN 2300-1933, [0867-6747], (B 15 pkt)|
|Publication size in sheets||0.5|
|Keywords in English||cryptography, fully homomorphic encryption, confidential graph algorithm, cloud computing|
|project||The Develpment of Digital Communicatios. Project leader: Siuzdak Jerzy,
, Phone: +48 22 234-7868, start date 07-06-2017, end date 30-11-2018, IT/2017/statut, Completed
|Score||= 15.0, 25-06-2019, ArticleFromJournal|
|Publication indicators||= 0; = 0; : 2017 = 0.693|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.