Communication Complexity in Algebraic Two-Party Protocols

Homomorphic encryption (HE) schemes enable computing functions on encrypted data, by means of a public Eval procedure that can be applied to ciphertexts. But the evaluated ciphertexts so generated may differ from freshly encrypted ones. This brings up the question of whether one can keep computing on evaluated ciphertexts. An i-hop homomorphic encryption scheme is one where Eval can be called on its own output up to i times, while still being able to decrypt the result. A multi-hop homomorphic encryption is a scheme which is i-hop for all i. In this work we study i-hop and multi-hop schemes in conjunction with the properties of function-privacy (i.e., Eval's output hides the function) and compactness (i.e., the output of Eval is short). We provide formal definitions and describe several constructions. First, we observe that bootstrapping techniques can be used to convert any (1-hop) homomorphic encryption scheme into an i-hop scheme for any i, and the result inherits the function-privacy and/or compactness of the underlying scheme. However, if the underlying scheme is not compact (such as schemes derived from Yao circuits) then the complexity of the resulting i-hop scheme can be as high as nO(i). We then describe a specific DDH-based multi-hop homomorphic encryption scheme that does not suffer from this exponential blowup. Although not compact, this scheme has complexity linear in the size of the composed function, independently of the number of hops. The main technical ingredient in this solution is a re-randomizable variant of the Yao circuits. Namely, given a garbled circuit, anyone can re-garble it in such a way that even the party that generated the original garbled circuit cannot recognize it. This construction may be of independent interest.

Abstract: Encryption is essential in preventing unauthorized access to sensitive data in light of the growing concerns about data security in cloud computing. Homomorphic encryption promises to enable secure calculations on encrypted data without the need for decryption, particularly for cloud-based operations. To evaluate the effectiveness and applicability of several homomorphic encryption algorithms for safe cloud computing, we compare and contrast them in this research paper. Partially homomorphic encryption (PHE), somewhat homomorphic encryption (SHE), and fully homomorphic encryption (FHE) are the three basic homomorphic encryption subtypes that we examine. The implications of this study can aid cloud service providers and organizations in selecting the most appropriate homomorphic encryption scheme based on their specific security requirements and performance considerations. The research contributes to the ongoing efforts to enhance data privacy in cloud computing environments, opening new possibilities for secure data processing in an increasingly connected digital world. The exploration of homomorphic encryption schemes in this study opens new avenues for research and development in the field of cryptographic techniques. As technology continues to evolve, so too must our approaches to safeguarding data. This research serves as a catalyst for further innovations in homomorphic encryption algorithms, enabling even more efficient and robust methods for secure data processing in cloud environments and beyond. The insights derived from this research paper not only empower cloud service providers and organizations to make informed decisions about selecting the most appropriate homomorphic encryption scheme but also contribute to the broader mission of fortifying data privacy and security in cloud computing.

An encryption scheme is homomorphic if it supports operations on encrypted data. Homomorphic encryption allows a device to perform arbitrary computations on encrypted data without user secret key. Recently it is introduced new homomorphic encryption schemes with improved performance that can be implemented in IoT device in production environments. The IoT concept encompasses devices, sensors, and services existing within an interconnected infrastructure with an efficient access to sample computational facilities. In this paper we evaluated features of exact arithmetic homomorphic encryption mechanisms: BFV and BGV and approximate homomorphic encryption scheme: CKKS. In the paper we measured performances of operations of homomorphic encryption schemes: BGV, BFV and CKKS that are implemented in Raspberry Pi 4 IoT device.

Private information retrieval is an important application of homomorphic encryption. As a hot topic in recent years, homomorphic encryption scheme can operate on the ciphertext and the decryption result is equal to the same operation on the plaintext. Trivial PIR protocol faces the plaintext retrieval, so it could not guarantee the database privacy. In the cloud environment, it is unsafe to store the plaintext in the server. In order to settle the above problem, based on a somewhat homomorphic encryption scheme, we design a multi-server PIR. It can not only achieves the privacy and resisting the colluding attack, but also reaches the information-theoretic security.

The objective of this research is to develop a novel image encryption method that can be used to considerably increase the security of encrypted images. To solve this image security problem, we propose a distributed homomorphic image encryption scheme where the images of interest are those in the visible electromagnetic spectrum. In our encryption phase, a red green blue (RGB) image is first separated into its constituent channel images, and then the numerical intensity value of a pixel from each channel is written as a sum of smaller pixel intensity sub-values, leading to having several component images for each of the R, G, and B-channel images. A homomorphic encryption function is used to separately encrypted each of the pixel intensity sub-values in each component image using an encryption key, leading to a distributed image encryption approach. Each of the encrypted component images can be compressed before transmission and/or storage. In our decryption phase, each encrypted component image is decompressed if necessary, and then the homomorphic property of the encryption function is used to transform the product of individually encrypted pixel intensity sub-values in each encrypted component images, to the encryption of their sum, before applying the corresponding decryption function with a decryption key to recover the original pixel's intensity values for each channel image, and then recovering the original RGB image. Furthermore, a special case of an RGB image encryption and decryption where a pixel's intensity value from each channel is written as a sum of only two sub-values is implemented and simulated with a software. The resulting cipher-images are subject to a range of security tests and analyses. Results from these tests shown that our proposed homomorphic image encryption scheme is robust and can resist security attacks, as well as increases the security of the associated encrypted images. Our proposed homomorphic image encryption scheme has produced highly secure encrypted images.

Homomorphic Encryption has become a viable method for privacy preservation. It basically deals with the computations of encoded data. Homomorphic encryption scheme allows operations on encrypted data which, when decrypted will provide the same results as we performed directly on the raw data. Certain cryptographic algorithms having the homomorphic property. A detailed survey is carried out on the various homomorphic encryption scheme based on the parameter involved, the encryption decryption mechanisms, their hammerphic properties, security considerations etc. The encryption methods with homomorphic property are much suitable for applications require data privacy and security.

In homomorphic encryption schemes, anyone can perform homomorphic operations, and therefore, it is difficult to manage when, where and by whom they are performed. In addition, the property that anyone can ‘‘freely” perform the operation inevitably means that ciphertexts are malleable, and it is well-known that adaptive chosen ciphertext (CCA) security and the homomorphic property can never be achieved simultaneously. In this paper, we show that CCA security and the homomorphic property can be simultaneously handled in situations that the user(s) who can perform homomorphic operations on encrypted data should be controlled/limited, and propose a new concept of homomorphic public-key encryption, which we call keyed-homomorphic public-key encryption (KH-PKE). By introducing a secret key for homomorphic operations, we can control who is allowed to perform the homomorphic operation. To construct KH-PKE schemes, we introduce a new concept, a homomorphic transitional universal hash family, and present a number of KH-PKE schemes through hash proof systems. We also present a practical construction of KH-PKE from the DDH assumption. For ℓ-bit security, our DDH-based scheme yields only ℓ-bit longer ciphertext size than that of the Cramer-Shoup PKE scheme.Keywordshomomorphic public key encryptionCCA2 securityhash proof system

The ability to perform computations on ciphertexts without knowing any information about the plaintexts makes homomorphic encryption technique useful in a wide variety of confidentiality preserving protocols (e.g., e-voting, e-health, etc.). Unfortunately, the traditional encyption schemes support a limited number of homomorphic operations (usually addition or multiplication). Indeed, in 2009, Gentry proposed a fully homomorphic encryption scheme which supports both multiplicative and additive homomorphic operations. Since then, several fully homomorphic encryption schemes have been proposed. However, the fully homomorphic encryption schemes are still undergoing experimentation and improvement. The hybridization of homomorphic encryption schemes seems to be an effective way to overcome their limitations and to benefit from their resistance against the confidentiality attacks. In this paper, we will study the possibility to hybridize the homomorphic encryption schemes so as to support all homomorphic properties.

Somewhat Homomorphic Encryption (SHE) schemes allow to carry out operations on data in the cipher domain. In a cloud computing scenario, personal information can be processed secretly, inferring a high level of confidentiality. Most practical Somewhat Homomorphic Encryption (SHE) schemes require the implementation of fast polynomial arithmetic, that is why hardware accelerators usually target the FFT/NTT algorithm. This paper proposes a co-design hardware/software approach to accelerate SHE using Karatsuba algorithm. Depending on the needs, Karatsuba algorithm allows to implement additional computations to the hardware in order to reduce software computation time. Our accelerator is designed to speed up arithmetic on degree 2560 polynomials with 125 bits coefficients. We provide 3 different approaches: An area efficient design, a balanced design, and a performance-oriented design. Our accelerator performs a polynomial multiplication in respectively 2.46 ms, 1.70 ms and 1.24 ms, and a relinearization operation in 2.28 ms, 1.53 ms and 1.1 ms, while a functionally equivalent design using the FFT [1] performs the multiplication in 1.96 ms and the relinearization in 4.79 ms for hardware resources consumption equivalent to the balanced design.

At present study, homomorphic encryption scheme is most focusing on algorithm efficiency and security and the rare for homomorphic encryption simulation research. This paper for the Gentry's Somewhat Homomorphic Encryption scheme for the simulation research, in clear text size within a certain range simulation was Somewhat Homomorphic Encryption scheme, and presents the relationship between the length of plaintext and ciphertext size.

Multi-key Homomorphic Encryption (MKHE) scheme can homomorphically evaluate ciphertexts encrypted by different keys, which can effectively protect the privacy information of data holders in the joint computing of cloud services. Since the first full Homomorphic encryption scheme was proposed, bootstrapping is the only way to realize the arbitrary depth homomorphic computation of MKHE schemes. But bootstrap operation is quite expensive. In order to implement fast bootstrapping in MKHE schemes, previous works proposed multi-key TFHE schemes to implement low-latency bootstrapping and output a univariate function of messages after bootstrapping, called Programmable Bootstrapping (PBS). However, these schemes can only encrypt single-bit messages. PBS only outputs a function. And after a homomorphic operation, a bootstrap is required, which undoubtedly results in an increase in the cost of the whole multi-key homomorphic encryption operation. In this paper, we propose a MKHE scheme for multi-output PBS. For this purpose, we study the encryption method and homomorphic operation steps of MKHE, and add BFV homomorphic encryption multiplication and multi-key ciphertext relinearization. We separate the homomorphic operation from bootstrapping. We homomorphically evaluate test polynomials for multiple functions. In contrast to previous MKHE schemes, we support the output of multiple message-related functions with a single bootstrapping operation on the ciphertext. It is no longer limited to encrypting single-bit plaintext, and an effective ciphertext packaging technology is added. According to the analysis given in this paper, it is known that in the scenario of multi-party joint computation, the proposed scheme can be implemented with less bootstrapping when the same number of functions are homomorphically operated. This will effectively reduce the computational overhead.

ABSTRACTIn witness encryption (WE), an instance of an NP problem is allowed to be used to encrypt a message, and who holding a witness of the problem can efficiently decrypt the ciphertext. In this work, we put forth the concept of homomorphic witness encryption (HWE), where one can evaluate functions over ciphertexts of the same instance without decrypting them, that is, one can manipulate a set of ciphertexts with messages to obtain the evaluation of , for any function . We declare that such homomorphic witness encryption schemes can be generically constructed from indistinguishable obfuscation () for any classes of functions. Then we propose the instantiate of multiplicatively homomorphic witness encryption (MHWE) and linearly homomorphic witness encryption (LHWE) using an , homomorphic encryption for NP problems such as Subset‐Sum and a batch‐processed GS‐proof system, which enables us to evaluate multiplication operations and linear operations over ciphertext. Furthermore, we show the practicality of homomorphic witness encryption by proposing new protocols for applications of interest, such as homomorphic time‐lock encryption, multi‐party contract signing, and e‐voting.

Homomorphic encryption is a novel encryption method for it enables computing over encrypted data. This has a wide range of real world ramifications such as being able to blindly compute a search result sent to a remote server without revealing it's content. In this paper we summarize how SQL queries can be made secure using a homomorphic encryption scheme based on the ideas of Gahi, et al [1]. Gahi's model is based on the DGHV scheme which is a homomorphic encryption scheme which acts on plaintext bits and produce corresponding ciphertext. We use Gahi's blueprint to propose an improved model which is based on the more recent Ring based homomorphic encryption scheme by Braserski, et al [2]. Our method is more general in the sense that it can be extended to use with any fully homomorphic encryption scheme rather than being restricted to the DGHV scheme as in Gahi's method.

Homomorphic encryption was introduced to enable untrusted parties to apply computation over encrypted data, without decrypting the message. It makes a promising future to solve security challenges with Cloud Computing. Still, because of complex problems, HE is not yet usable in real-world applications. However homomorphic encryption suffers from many complex issues like large-time computation, which is difficult to implement, and huge ciphertext size. In this paper, we take into account many vital homomorphic encryption schemes, all of them is depend on computing over integers, by converting the message to a binary format, then the ciphertext is calculated to every single bit of plaintext. So, we suggested another symmetric Fully Homomorphic encryption that depends on an integer number without converting it to binary format, it encrypts the message using a prime secret key. The proposed system is considered a great improvement to the DGHV system. Where it reduced the ciphertext size and the execution time significantly. The present proposed system shows an improvement of DGHV where it is faster about 23.8 times from DGHV, and we gain one ciphertext for the whole message instead of ciphertext for every bit of the message. The scheme's hardness depends on the greatest common divisor (GCD) problem. We present a detailed explanation of these schemes showing their efficient techniques and compare it with the proposed algorithm in terms of ciphertext size of algorithm, and execution time and analyze their security them finally draw several conclusions.

This paper discusses how to implement Paillier homomorphic encryption (HE) scheme in Java as an API. We first analyze existing Pailler HE libraries and discuss their limitations. We then design a comparatively accomplished and efficient Pailler HE Java library. As a proof of concept, we applied our Pailler HE library in an electronic voting system that allows the voting server to sum up the candidates' votes in the encrypted form with voters remain anonymous. Our library records an average of only 2766ms for each vote placement through HTTP POST request.