Show simple item record

AuthorWang, Yongge
AuthorMalluhi, Qutaibah M.
Available date2021-09-05T05:40:12Z
Publication Date2016
Publication NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ResourceScopus
ISSN3029743
URIhttp://dx.doi.org/10.1007/978-3-319-45744-4_15
URIhttp://hdl.handle.net/10576/22675
AbstractWith the wide adoption of cloud computing paradigm, it is important to develop appropriate techniques to protect client data privacy in the cloud. Encryption is one of the major techniques that could be used to achieve this goal. However, data encryption at the rest alone is insufficient for secure cloud computation environments. There is also the need for efficient techniques to carry out computation over encrypted data. Fully homomorphic encryption (FHE) and garbled circuits are naturally used to process encrypted data without leaking any information about the data. However, existing FHE schemes are inefficient for processing large amount of data in cloud and garbled circuits are one time programs and cannot be reused. Based on quaternion/octonion algebra and Jordan algebra over finite rings ?q, this paper designs efficient fully homomorphic symmetric key encryption (FHE) schemes without bootstrapping (that is, noise-free FHE schemes) that are secure in the weak ciphertext-only security model assuming the hardness of solving multivariate quadratic equation systems and solving univariate high degree polynomial equation systems in ?q. The FHE scheme designed in this paper is sufficient for privacy preserving computation in cloud. Springer International Publishing Switzerland 2016.
SponsorThe work reported in this paper is supported by Qatar Foundation Grants NPRP8-2158-1-423 and NPRP X-063-1-014.
Languageen
PublisherSpringer Verlag
SubjectAlgebra
Data privacy
Polynomials
Reconfigurable hardware
Security of data
Security systems
Appropriate techniques
Computation environments
Fully homomorphic encryption
Garbled circuits
Multivariate quadratic equations
Polynomial equation system
Privacy preserving computation
Symmetric key encryption
Cryptography
TitlePrivacy preserving computation in cloud using noise-free fully homomorphic encryption (FHE) schemes
TypeConference Paper
Pagination301-323
Volume Number9878 LNCS
dc.accessType Abstract Only


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record