2013
DOI: 10.1109/tifs.2013.2287732
|View full text |Cite
|
Sign up to set email alerts
|

Fully Homomorphic Encryption Using Hidden Ideal Lattice

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
4
4
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 40 publications
(22 citation statements)
references
References 17 publications
0
22
0
Order By: Relevance
“…26 Recently, Qin et al 27 proposed a scheme which can integrate the two functions of data hiding and image compression into a single module seamlessly. Future work aims at designing a more efficient data hiding scheme in the encrypted domain by exploiting the fully homomorphic property of the cryptosystem.…”
Section: Discussionmentioning
confidence: 99%
“…26 Recently, Qin et al 27 proposed a scheme which can integrate the two functions of data hiding and image compression into a single module seamlessly. Future work aims at designing a more efficient data hiding scheme in the encrypted domain by exploiting the fully homomorphic property of the cryptosystem.…”
Section: Discussionmentioning
confidence: 99%
“…Aono et al [41] proposed a system that utilizes homomorphic encryption technology to protect data privacy and avoid leaking local data information to curious servers. Homomorphic encryption technology still has certain limitations, for example, it does not support noninteger data [42]. The chaotic model is highly nonlinear and extremely sensitive to initial values [43].…”
Section: Related Workmentioning
confidence: 99%
“…The present scheme is compared with the literatures ( [5], [11] and [12]) on various parameters and it is tabulated below: scheme. It is simple, noise free, IND-CPA secure, needs no bootstrapping with a message space Z N and the plain text integer is encoded into a matrix M 4 (Z N ) using CRT.…”
Section: Comparison With Other Schemesmentioning
confidence: 99%