multiple keys
Recently Published Documents


TOTAL DOCUMENTS

78
(FIVE YEARS 33)

H-INDEX

10
(FIVE YEARS 1)

2022 ◽  
Vol 54 (9) ◽  
pp. 1-37
Author(s):  
Asma Aloufi ◽  
Peizhao Hu ◽  
Yongsoo Song ◽  
Kristin Lauter

With capability of performing computations on encrypted data without needing the secret key, homomorphic encryption (HE) is a promising cryptographic technique that makes outsourced computations secure and privacy-preserving. A decade after Gentry’s breakthrough discovery of how we might support arbitrary computations on encrypted data, many studies followed and improved various aspects of HE, such as faster bootstrapping and ciphertext packing. However, the topic of how to support secure computations on ciphertexts encrypted under multiple keys does not receive enough attention. This capability is crucial in many application scenarios where data owners want to engage in joint computations and are preferred to protect their sensitive data under their own secret keys. Enabling this capability is a non-trivial task. In this article, we present a comprehensive survey of the state-of-the-art multi-key techniques and schemes that target different systems and threat models. In particular, we review recent constructions based on Threshold Homomorphic Encryption (ThHE) and Multi-Key Homomorphic Encryption (MKHE). We analyze these cryptographic techniques and schemes based on a new secure outsourced computation model and examine their complexities. We share lessons learned and draw observations for designing better schemes with reduced overheads.


Author(s):  
Rabia Abid ◽  
Celestine Iwendi ◽  
Abdul Rehman Javed ◽  
Muhammad Rizwan ◽  
Zunera Jalil ◽  
...  

AbstractSecure and reliable exchange of information between devices is crucial for any network in the current digital world. This information is maintained on storage devices, routing devices, and communication over the cloud. Cryptographic techniques are used to ensure the secure transmission of data, ensuring the user’s privacy by storing and transmitting data in a particular format. Using encryption, only the intended user possessing the key can access the information. During data or essential transmission, the channel should be secured by using robust encryption techniques. Homomorphic Encryption (HE) techniques have been used in the past for this purpose. However, one of the flaws of the conventional HE is seen either in its slow transmission or fast key decryption. Thus, this paper proposes an optimized Homomorphic Encryption Chinese Remainder Theorem with a Rivest-Shamir-Adleman (HE-CRT-RSA) algorithm to overcome this challenge. The proposed Technique, HE-CRT-RSA, utilizes multiple keys for efficient communication and security. In addition, the performance of the HE-CRT-RSA algorithm was evaluated in comparison with the classical RSA algorithm. The result of the proposed algorithm shows performance improvement with reduced decryption time. It is observed that the proposed HE-CRT-RSA is 3–4% faster than the classical Rivest-Shamir-Adleman (RSA). The result also suggests that HE-CRT-RSA effectively enhances security issues of the cloud and helps to decrease the involvement of intruders or any third party during communication or inside the data/server centers.


Author(s):  
Chirag Sharma ◽  
Aman Kumar* ◽  
Akancha Sinha ◽  
Meraj Ahmad

In this era where everything is becoming digital the most challenging topic in front of us is Data Security in every aspect even in the secured communication channel. These issues can be tackled by using strong Data Encryption and the trusted third party who maintains the database. The fast development in Digital Technology also comes with the rapid crimes and the insecurity of data theft. From time to time engineers came up with many encryption techniques like Caser Ciphers, Vernam Ciphers, Vigenère Cipher which helped us in securing the data but with lots of flaws that later were exploited by the cybercriminals. So, they cannot provide sufficient security. In this research paper, we have proposed a new, more efficient encryption algorithm. This algorithm will use multiple keys during encryption or decryption so it will be very less vulnerable against the attacks like Brute force.


2021 ◽  
Vol 1770 (1) ◽  
pp. 012034
Author(s):  
R. Vignesh ◽  
D. Deepa ◽  
Suja Cherukullath Mana ◽  
B. Keerthi Samhitha
Keyword(s):  

2021 ◽  
Vol 2021 ◽  
pp. 1-7
Author(s):  
Bingbing Jiang

Multikey fully homomorphic encryption proposed by Lopez-Alt et al. (STOC12) is a significant primitive that allows one to perform computation on the ciphertexts encrypted by multiple different keys independently. Then, several schemes were constructed based on decisional small polynomial ratio or learning with errors. These schemes all require an expansion algorithm to transform a ciphertext under a single key into an encryption of the same message under a set of keys. To achieve the expansion algorithm without interaction with these key-keepers, their encryption algorithm not only outputs a ciphertext of a plaintext but also exports auxiliary information generated from the randomness used in the former encryption process. Beyond that, the size of the ciphertext encrypted by multiple keys increases linearly or quadratically in the number of participants. In this paper, we studied the problem whether someone can directly perform arbitrary computation on ciphertexts encrypted by different keys without any auxiliary information in the output of the encryption algorithm and an increase in the size of the ciphertext in the expansion algorithm. To this end, we proposed a novel and simple scheme of secure computation on ciphertexts under two different keys directly without any auxiliary information. In other words, each party just provides its own ciphertexts encrypted by the GSW scheme (CRYPTO13). In the procedure of executing evaluation on these ciphertexts, the size of the new ciphertext remains the same as that of the GSW ciphertext.


Sign in / Sign up

Export Citation Format

Share Document