Confidential Greedy Graph Algorithm

Daniel Waszkiewicz,Aleksandra Horuhala,Piotr Sapiecha,Michal Andrzejczak

International Journal of Electronics and Telecommunications（2018）

引用 0|浏览2

暂无评分

摘要

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.

查看译文

关键词

cryptography,fully homomorphic encryption,confidential graph algorithm,cloud computing

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要