Confidential Greedy Graph Algorithm

Daniel Waszkiewicz , Aleksandra Horubała , Piotr Sapiecha , Michał Andrzejczak

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.
Author Daniel Waszkiewicz (FEIT / IT)
Daniel Waszkiewicz,,
- The Institute of Telecommunications
, Aleksandra Horubała (FEIT / IT)
Aleksandra Horubała,,
- The Institute of Telecommunications
, Piotr Sapiecha (FEIT / IT)
Piotr Sapiecha,,
- The Institute of Telecommunications
, Michał Andrzejczak - Wojskowa Akademia Techniczna (WAT)
Michał Andrzejczak,,
-
Journal seriesInternational Journal of Electronics and Telecommunications, ISSN 2081-8491, e-ISSN 2300-1933 [0867-6747], (B 15 pkt)
Issue year2018
Vol64
No2
Pages179-183
Publication size in sheets0.5
Keywords in Englishcryptography, fully homomorphic encryption, confidential graph algorithm, cloud computing
DOIDOI:10.24425/119367
URL http://ijet.pl/index.php/ijet/article/view/10.24425-119367/456
Languageen angielski
File
2018 Sapiecha Confidential Greedy Graph Algorithm.pdf 1.15 MB
Score (nominal)15
ScoreMinisterial score = 15.0, 08-10-2018, ArticleFromJournal
Ministerial score (2013-2016) = 15.0, 08-10-2018, ArticleFromJournal
Citation count*
Cite
Share Share

Get link to the record


* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Back