2017 IEEE 2nd International Conference on Big Data Analysis (ICBDA)( 2017
DOI: 10.1109/icbda.2017.8078836
|View full text |Cite
|
Sign up to set email alerts
|

A faster fully homomorphic encryption scheme in big data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
2
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 14 publications
(4 citation statements)
references
References 9 publications
0
4
0
Order By: Relevance
“…Concerning securing BD, an improved FHE-DGHV scheme with shorter public key size was proposed by Wang et al [17]. Considering the error-free approximate GCD problem, they claimed that the novel scheme was semantically secure.…”
Section: B Access Control and Encryption Techniquesmentioning
confidence: 99%
“…Concerning securing BD, an improved FHE-DGHV scheme with shorter public key size was proposed by Wang et al [17]. Considering the error-free approximate GCD problem, they claimed that the novel scheme was semantically secure.…”
Section: B Access Control and Encryption Techniquesmentioning
confidence: 99%
“…The other emerging application of homomorphic encryption is in the field of big data and cloud computing.Chakraborty and K Patra [49] investigated the use of functional encryption in big data analytics and concluded that functional encryption algorithms that create public keys and secret masters keys have an added advantage because all the generated keys are based the master key and the computation involved in decrypting the message is dependent on the value of the generated key [32]. Liu et al [50] and other authors Dijk and Gentry [40], Jie and Jing [51], Wang et al [52], Tsoutsos and Maniatakos [53], Geetanjali and Sambhaji [54], Chou et al [55] also discussed the application of homomorphic encryption in online systems and proposed di erent points of integrating the encryptions within the big data systems. Besides, the Paillier and ElGamal cryptosystems [56], Menandas and Joshi [57] postulated that Okamoto Uchiyama Cryptosystem, despite its complexity, is more suited for big data systems with sensitive information.…”
Section: Big Data and Cloud Computingmentioning
confidence: 99%
“…Another related problem is that if an adversary is able to observe the analytic operations or data storage read/write requests, sensitive information might be leaked. One way to tackle this problem is to use privacy-preserving cryptographic techniques [4] [5], [6]. However, so far these approaches have large overhead and thus severely limits the type of analytic operations that can be supported in the system.…”
Section: Introductionmentioning
confidence: 99%