Performing smart computations in a context of cloud computing and big data is highly appreciated today. It allows customers to fully benefit from cloud computing capacities (such as processing or storage) without losing confidentiality of sensitive data. Fully homomorphic encryption (FHE) is a smart category of encryption schemes that enables working with the data in its encrypted form. It permits us to preserve confidentiality of our sensible data and to benefit from cloud computing capabilities. While FHE is combined with verifiable computation, it offers efficient procedures for outsourcing computations over encrypted data to a remote, but non-trusted, cloud server. The resulting scheme is called Verifiable Fully Homomorphic Encryption (VFHE). Currently, it has been demonstrated by many existing schemes that the theory is feasible but the efficiency needs to be dramatically improved in order to make it usable for real applications. One subtle difficulty is how to efficiently handle the noise. This paper aims to introduce an efficient and symmetric verifiable FHE based on a new mathematic structure that is noise free. In our encryption scheme, the noise is constant and does not depend on homomorphic evaluation of ciphertexts. The homomorphy of our scheme is obtained from simple matrix operations (addition and multiplication). The running time of the multiplication operation of our encryption scheme in a cloud environment has an order of a few milliseconds.
Performing smart computations in a context of cloud computing and big data is highly appreciated today. Fully homomorphic encryption (FHE) is a smart category of encryption schemes that allows working with the data in its encrypted form. It permits us to preserve confidentiality of our sensible data and to benefit from cloud computing powers. Currently, it has been demonstrated by many existing schemes that the theory is feasible but the efficiency needs to be dramatically improved in order to make it usable for real applications. One subtle difficulty is how to efficiently handle the noise. This paper aims to introduce an efficient and verifiable FHE based on a new mathematic structure that is noise free.
Data privacy in cloud computing is a fundamental issue today. Fully homomorphic encryption schemes are highly recommended for data security in cloud computing. In fact, confidentiality of sensible data can be preserved even if a non-trusted cloud server processes it; the mystery behind this is that fully homomorphic encryption schemes allow processing encrypted data without the need of a prior decryption. In this paper we present a new fully homomorphic encryption scheme from integers. Our encryption scheme can be used essentially to secure sensible data in cloud computing. The proposed scheme uses a large integer ring as cleartext space and one key for encryption and decryption, i.e. it is a symmetric encryption scheme.
Searching over encrypted data is a very important property that can offer some encryption schemes. It means performing queries on encrypted data in the absence of purpose to decryption, which permits to preserve confidentiality of sensitive data. Private Information Retrieval (PIR) is an essential protocol when selected information from remote databases is wanted to be done in secrecy. Fully homomorphic encryption is a revolutionary domain of cryptography that allows processing encrypted data without the need of any prior decryption, thus generating an encrypted result that corresponds the result of operations performed on the plaintext. In this paper we will exploit the important property that can offer the powerful fully homomorphic encryption to show how to realize a PIR protocol and how to search over encrypted data in a cloud context.
The rise of ransomware poses a significant and widespread threat to both organizations and individuals. The financial impact of ransomware attacks is staggering, with billions of dollars lost in revenue and recovery costs. Therefore, it is imperative to revise conventional malware detection methods that rely on signatures to identify zero-day ransomware. However, these methods may not be sufficient in protecting users’ files against attacks caused by unknown and risky ransomware. Thus, it is essential to develop a novel security mechanism specifically designed to protect against ransomware. This mechanism should focus on ransomware-specific activities and behavior to differentiate ransomware from other categories of malicious software and legitimate files. In this paper, we present a novel approach to identifying and detecting ransomware by analyzing the registry and investigating all changes made to the system during the ransomware infection process.