ขั้นตอนวิธีสำหรับการเข้ารหัสข้อมูลบนฐานข้อมูลแบบกระจาย

The objective of research was to develop analgorithm for cryptic distribute databases (ACDD) for distributed database management of the encrypted data to solve the problem of information leakage caused by fraud DBAs. The used techniques were Paillier homomorphic Polynomials ring, Shamir's Secret Sharing scheme and transformation graph. The Advantages of this algorithm were that it can solve the problem of dishonest dealers and dishonest participants who try to deceive other participants data and enables perform calculations on encrypted data without decryption on which the calculation was carried out, with respect of the data confidentiality

At Last! A Homomorphic AES Evaluation in Less than 30 Seconds by Means of TFHE

Since the pioneering work of Gentry, Halevi, and Smart in 2012, the state of the art on transciphering has moved away from work on AES to focus on new symmetric algorithms that are better suited for a homomorphic execution. Yet, with recent advances in homomorphic cryptosystems, the question arises as to where we stand today. Especially since AES execution is the application that may be chosen by NIST in the FHE part of its future call for threshold encryption. In this paper, we propose an AES implementation using TFHE programmable bootstrapping which runs in less than a minute on an average laptop. We detail the transformations carried out on the original AES code to lead to a more efficient homomorphic evaluation and we also give several execution times on different machines, depending on the type of execution (sequential or parallelized). These times vary from 4.5 minutes (resp. 54 secs) for sequential (resp. parallel) execution on a standard laptop down to 28 seconds for a parallelized execution over 16 threads on a multi-core workstation

An Efficient Secure Message Transmission in Mobile Ad Hoc Networks using Enhanced Homomorphic Encryption Scheme

In MANETs the nodes are capable of roaming independently. The node with inadequate physical protection can be easily captured, compromised and hijacked. Due to this huge dependency's on the nodes, there are more security problems. Therefore the nodes in the network must be prepared to work in a mode that trusts no peer. In this paper we look at the current scheme to transmit the data in MANETs. We then propose a new scheme for secure transmission of message in MANETs as Alternative scheme for DF2019;s new Ph and DF2019;s additive and multiplicative PH. Here we also provide the computational cost of the homomorphic encryption schemes. We also provide the implementation issues of our new scheme in MANETs. For the entire message to be recoverd by the attacker, the attacker needs to compromise atleast g nodes, one node from each group g and know the encryption keys to decrypt the message. The success rate of our proposed new scheme is 100% if there are more number of active paths in each group of the network

A Survey on Homomorphic Encryption Schemes: Theory and Implementation

Legacy encryption systems depend on sharing a key (public or private) among the peers involved in exchanging an encrypted message. However, this approach poses privacy concerns. Especially with popular cloud services, the control over the privacy of the sensitive data is lost. Even when the keys are not shared, the encrypted material is shared with a third party that does not necessarily need to access the content. Moreover, untrusted servers, providers, and cloud operators can keep identifying elements of users long after users end the relationship with the services. Indeed, Homomorphic Encryption (HE), a special kind of encryption scheme, can address these concerns as it allows any third party to operate on the encrypted data without decrypting it in advance. Although this extremely useful feature of the HE scheme has been known for over 30 years, the first plausible and achievable Fully Homomorphic Encryption (FHE) scheme, which allows any computable function to perform on the encrypted data, was introduced by Craig Gentry in 2009. Even though this was a major achievement, different implementations so far demonstrated that FHE still needs to be improved significantly to be practical on every platform. First, we present the basics of HE and the details of the well-known Partially Homomorphic Encryption (PHE) and Somewhat Homomorphic Encryption (SWHE), which are important pillars of achieving FHE. Then, the main FHE families, which have become the base for the other follow-up FHE schemes are presented. Furthermore, the implementations and recent improvements in Gentry-type FHE schemes are also surveyed. Finally, further research directions are discussed. This survey is intended to give a clear knowledge and foundation to researchers and practitioners interested in knowing, applying, as well as extending the state of the art HE, PHE, SWHE, and FHE systems.Comment: - Updated. (October 6, 2017) - This paper is an early draft of the survey that is being submitted to ACM CSUR and has been uploaded to arXiv for feedback from stakeholder

FURISC: FHE Encrypted URISC Design

This paper proposes design of a Fully Homomorphic Ultimate RISC (FURISC) based processor. The FURISC architecture supports arbitrary operations on data encrypted with Fully Homomorphic Encryption (FHE) and allows the execution of encrypted programs stored in processors with encrypted memory addresses. The FURISC architecture is designed based on fully homomorphic single RISC instructions like {\em Subtract Branch if Negative} (SBN) and {\em MOVE}. This paper explains how the use of FHE for designing the ultimate RISC processor is better in terms of security compared to previously proposed somewhat homomorphic encryption (SHE) based processor. The absence of randomization in SHE can lead to Chosen Plaintext Attacks (CPA) which is alleviated by the use of the FHE based Ultimate RISC instruction. Furthermore, the use of FURISC helps to develop fully homomorphic applications by tackling the {\em termination} problem, which is a major obstacle for FHE processor design. The paper compares the MOVE based FHE RISC processor with the SBN alternative, and shows that the later is more efficient in terms of number of instructions and time required for the execution of a program. Finally, an SBN based FURISC processor simulator has been designed to demonstrate that various algorithms can indeed be executed on data encrypted with FHE, providing a solution to the termination problem for FHE based processors and the CPA insecurity of SHE processors simultaneously

Criptografía en bases de datos en cloud computing.

The IT managers of companies who are considering migrating their systems to the cloud computing have their reservationsabout the security and reliability of cloud-based services, these are not yet fully convinced that deliver sensitive data companies or theirclients is a good idea, in this context the use of encryption systems, in particular homomorphic encryption schemes are useful, since theoperations in the cloud provider are made with the encrypted information, providing a level of reliability and safety databases fromattacks as well as internal and external in cloud computing. This paper proposes a scheme to protect the different attributes ofinformation (confidentiality, integrity and authentication), stored in a BD in the Cloud.Los responsables de informática de las empresas que están pensando migrar sus sistemas de cómputo a la nube tienensus reservas con respecto a la seguridad y la confiabilidad de los servicios basados en la nube, éstos aún no están plenamenteconvencidos de que entregar datos sensibles de las empresas o de sus clientes sea buena idea, en este contexto el uso de los sistemas decifrado, y en especial los esquemas de cifrado homomórficos son de gran utilidad, ya que las operaciones realizadas en el proveedorcloud se realizan con la información cifrada, brindando así un nivel de confiabilidad y seguridad a las bases de datos frente a posiblesataques tanto internos como externos en el cloud computing. En el presente trabajo se propone un esquema para proteger los diferentesatributos de la información (confidencialidad, integridad y autenticación) almacenada en una BD en el Cloud

Searching and Sorting of Fully Homomorphic Encrypted Data on Cloud

The challenge of maintaining confidentiality of stored data in cloud is of utmost importance to realize the potential of cloud computing. Storing data in encrypted form may solve the problem, but increases the security issues and diminishes the essence of cloud while performing operations on cloud data by repeated decryption-encryption. Hence, Fully homomorphic encryption (FHE) is an effective scheme to support arbitrary operations directly on encrypted data. Further, cloud mostly acts as storage database, hence secured sorting and searching of FHE cloud data can be an effective field of research. We have investigated the feasibility of performing comparison as well as partition based sort on CPA resistant FHE data and highlight an important observation that time requirement of partition based sort on FHE data is no better than comparison based sort owing to the security of the cryptosystem. We identify the recrypt operation, which is the denoising step of FHE as the main reason of costly timing requirement of such operations. Finally, we propose a two stage sorting technique termed as Lazy sort with reduced recrypt operation, which proves to be better in terms of performance on FHE data in comparison to partition as well as comparison sort

Advances in Homomorphic Cryptosystems

During the last few years homomorphic encryption techniques have been studied extensively since they have become more and more important in many different cryptographic protocols such as voting protocols, lottery protocols, anonymity, privacy, and electronic auctions. This paper critically summarizes the current state-of-art of homomorphic cryptosystems. It recalls the basic ideas, discusses their parameters, performances and security issues. And, finally we present their capabilities in the future applications. Attention: Based on the investigations by the J.UCS office, this article needs to be retracted due to plagiarism issue. The paper was found to duplicate word by word without proper citation significant parts of the content from Fontaine, C., Galand, F. (2007). A survey of homomorphic encryption for nonspecialists. Journal of Information Security, 1, 41-50. Retrieved from http://downloads.hindawi.com/journals/is/2007/013801.pdf As a consequence, this conference paper has been formally retracted, and the relevant parties informed about this step. The J.UCS office apologizes to the authors of the plagiarized article. One of the conditions of submission of a paper for publication is that authors declare explicitly that the paper is not under consideration for publication elsewhere. Re-use of any data should be appropriately cited. As such this article represents a severe abuse of the scientific publishing system. The scientific community takes a very strong view on this matter and apologies are offered to the authors of the original article and readers of the journal that this was not detected during the submission process. August 4, 2014

Advances in Homomorphic Cryptosystems

Abstract: During the last few years homomorphic encryption techniques have been studied extensively since they have become more and more important in many different cryptographic protocols such as voting protocols, lottery protocols, anonymity, privacy, and electronic auctions. This paper critically summarizes the current state-of-art of homomorphic cryptosystems. It recalls the basic ideas, discusses their parameters, performances and security issues. And, finally we present their capabilities in the future applications