2017
DOI: 10.1007/978-3-319-65930-5_32
|View full text |Cite
|
Sign up to set email alerts
|

Using Homomorphic Encryption to Compute Privacy Preserving Data Mining in a Cloud Computing Environment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 18 publications
0
3
0
Order By: Relevance
“…The procedure produced a stego file that appeared identical to the cover file, ensuring that the data's presence remained secret. The challenge of maintaining the secrecy of data undergoing data mining in a cloud context is discussed in [33]. The challenge was to ensure that given n sites containing the data being mined for patterns, I would not be able to determine the patterns discovered from the site.…”
Section: Literature Surveymentioning
confidence: 99%
“…The procedure produced a stego file that appeared identical to the cover file, ensuring that the data's presence remained secret. The challenge of maintaining the secrecy of data undergoing data mining in a cloud context is discussed in [33]. The challenge was to ensure that given n sites containing the data being mined for patterns, I would not be able to determine the patterns discovered from the site.…”
Section: Literature Surveymentioning
confidence: 99%
“…Compared with the scheme with strong privacy in [60], which had the same privacy as theirs, their scheme is 3 to 5 orders of magnitude higher. Soon after [55], Hammami et al [64] also used homomorphic encryption to achieve privacy preserving data mining in a cloud computing environment. The processing time consumption of their algorithm is superior to the approach proposed in [65] fitting in the same trend and in the same data characteristics.…”
Section: A: Privacy Preserving Association Rule Mining Over Verticallmentioning
confidence: 99%
“…The database is vertically distributed so that the rows are the same, but the columns are different. Many PPARM schemes [16][17][18][19][20][21][22][23][24][25] have been proposed to find frequent attribute sets within vertically distributed datasets without revealing private data.…”
Section: Introductionmentioning
confidence: 99%