2019
DOI: 10.12928/telkomnika.v17i6.13059
|View full text |Cite
|
Sign up to set email alerts
|

Classifying confidential data using SVM for efficient cloud query processing

Abstract: Nowadays, organizations are widely using a cloud database engine from the cloud service providers. Privacy still is the main concern for these organizations where every organization is strictly looking forward more secure environment for their own data. Several studies have proposed different types of encryption methods to protect the data over the cloud. However, the daily transactions represented by queries for such databases makes encryption is inefficient solution. Therefore, recent studies presented a mec… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 22 publications
0
4
0
Order By: Relevance
“…The performance analysis of the algorithms can be estimated by using two measures sensitivity S and positive predictive value (PPV). They are very much useful for estimation of performance [22][23][24][25]. Sensitivity S is calculated and measured by;…”
Section: Resultsmentioning
confidence: 99%
“…The performance analysis of the algorithms can be estimated by using two measures sensitivity S and positive predictive value (PPV). They are very much useful for estimation of performance [22][23][24][25]. Sensitivity S is calculated and measured by;…”
Section: Resultsmentioning
confidence: 99%
“…The advantage of using N-gram is based on the characteristics of the N-gram as a part of a string, so the error on a partial string only resulting in a difference in some N-gram [33]. Another representation and usage of N-gram advantage can also be seen in the publication of Tayyeh and Al-Jumaili [34].…”
Section: Research Methods 21 N-grammentioning
confidence: 99%
“…However, once a matching occurred in offset 8, the position of the previously matched character along with how many times the matching occurred would be represented as (4, 1) where the 's' character has been occurred at offset 4 and ISSN: 2088-8708  happened for one time. In addition, at offset 14 a match for three characters has been depicted where the subset 'is' has occurred previously before 11 steps and the matching occurred three times thus, the output was (11,3). The final output of encoding can be seen as:…”
Section: Lz77mentioning
confidence: 99%
“…Such an opportunity for communications comes with various risks and vulnerabilities that might threaten information security. Thus, an imperative demand to secure such communications by providing authentic and confidential data access and exchange [2], [3]. Here comes the role of cryptography in which a secure channel for exchanging information can be provided effectively.…”
Section: Introductionmentioning
confidence: 99%