Login / Signup
Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem.
Khin Mi Mi Aung
Hyung Tae Lee
Benjamin Hong Meng Tan
Huaxiong Wang
Published in:
Theor. Comput. Sci. (2019)
Keyphrases
</>
non binary
homomorphic encryption
constraint satisfaction problems
privacy preserving
data sharing
arc consistency
frequent pattern mining
constraint satisfaction
data structure
encryption scheme
data analysis
high dimensional
hidden variables