Search

The rapid growth in the use of multimedia information has made the security of data storage and transmission important in avoiding unlawful, unofficial, unauthorised and illegal use. Encryption is an efficient operation to protect multimedia data secret. A new image encryption approach that uses binary coded decimal (BCD) code-based decomposition, reordering and scrambling bit planes, and an encryption process is suggested in this study. Image decomposition using BCD code for image encryption is introduced in this study. A simple scrambling process is used to shuffle binary bit planes after re-ordering them. A shift column operation is applied to the image that is constructed after scrambling the bit planes to increase the security level. A performance analysis and a comparison with other encryption algorithms are conducted to prove the proposed algorithm's image encryption capabilities. The experimental results show that the suggested method protects secret images against common attacks with shorter encryption/decryption times.

We introduce a hybrid homomorphic encryption that combines public-key encryption (PKE) and somewhat homomorphic encryption (SHE) to reduce the storage requirements of most somewhat or fully homomorphic encryption (FHE) applications. In this model, messages are encrypted with a PKE and computations on encrypted data are carried out using SHE or FHE after homomorphic decryption. To obtain efficient homomorphic decryption, our hybrid scheme combines IND-CPA PKE without complicated message padding with SHE with a large integer message space. Furthermore, if the underlying PKE is multiplicative, the proposed scheme has the advantage that polynomials of arbitrary degree can be evaluated without bootstrapping. We construct this scheme by concatenating the ElGamal and Goldwasser–Micali schemes over a ring $ {\mathbb Z}_{N}$ for a composite integer $N$ whose message space is $ {\mathbb Z}_{N}^\times \vphantom {\sum _{R_{R_{R}}}}$ . To accelerate the homomorphic evaluation of the PKE decryption, we introduce a method to reduce the degree of the exponentiation circuit at the cost of additional public keys. Using the same technique, we present an efficient partial solution to an open problem which is to evaluate $\mod q \bmod p$ arithmetic homomorphically for large $p$ . As an independent interest, we also obtain a generic method for converting from private-key SHE to public-key SHE. Unlike the method described by Rothblum, we are free to choose the SHE message space.

In this study, the authors present an efficient public-key broadcast encryption (PKBE) scheme with sub-linear size of public keys, private keys and ciphertexts and prove its adaptive security under standard assumptions. Compared with the currently best scheme of Garg et al. (CCS 2010) that provides adaptive security under standard assumptions and sub-linear size of various parameters, the ciphertext size of the author's scheme is 94% shorter and the encryption algorithm of their scheme is also 2.8 times faster than the scheme of Garg et al. To achieve their scheme, they adapt the dual system encryption technique of Waters. However, there is a challenging problem to use this technique for the construction of PKBE with sub-linear size of ciphertexts such as a tag compression problem. To overcome this problem, they first devise a novel tag update technique for broadcast encryption. Using this technique, they build an efficient PKBE scheme in symmetric bilinear groups, and prove its adaptive security under standard assumptions.

A ciphertext-policy attribute-based encryption protocol uses bilinear pairings to provide control access mechanisms, where the set of user’s attributes is specified by means of a linear secret sharing scheme. In this paper we present the design of a software cryptographic library that achieves record timings for the computation of a 126-bit security level attribute-based encryption scheme. We developed all the required auxiliary building blocks and compared the computational weight that each of them adds to the overall performance of this protocol. In particular, our single pairing and multi-pairing implementations achieve state-of-the-art time performance at the 126-bit security level.

Advanced Encryption Standard (AES) is used in many security systems for its high security. However, the high computation complexity of the round encryption of AES makes AES hard to be performed on many embedded systems with constrained resource. This paper proposes a novel round encryption method based on a 512-Byte lookup table. The experiments results show that, the AES implementation utilizing the round encryption method proposed reaches an encryption performance comparable to that of the widely used implementation with 4 1-KB lookup tables, while consumes much less storage overhead.

years, security of several kinds of images is a major issue in secure data communication over any unreliable network. In this paper, a new technique to secure images by using grid-based encryption and decryption approach with RSA cryptosystem has been devised. This approach has taken original image, performed block transformation followed by grid transformation, then finally a public key cryptosystem is applied pixel-by-pixel to secure image. Experimental images have been taken and performed encryption and decryption to elaborate this technique. Error analysis shows that the technique is robust.

This paper proposes an advanced encryption of MP3 and MPEG-4 coder with a quality degradation-based security model. For the MP3 audio, the magnitude and phase information of modified discrete cosine transform (MDCT) coefficients is encrypted. DCT coefficients and motion vectors (MVs) are used for the scrambling of the MPEG-4 video. This encryption scheme has a level of security, secures in perception, keeps format compliance, and obtains better time efficiency by reducing the encrypted volumes of multimedia contents. These properties make it practical to incorporate encryption and decryption process into compression and decompression process, and thus suitable for secure A/V transmission or sharing. Experimental results indicate that the proposed technique provides levels of security for a flexible business model and achieves a simple and coding-efficient architecture with no adverse impact on error resilience.

In this paper, we present an adaptively secure identity-based broadcast encryption system featuring constant sized ciphertext in the standard model. The size of the public key and the private keys of our system are both linear in the maximum number of receivers. In addition, our system is fully collusion-resistant and has stateless receivers. Compared with the state-of-the-art, our scheme is well optimized for the broadcast encryption. The computational complexity of decryption of our scheme depends only on the number of receivers, not the maximum number of receivers of the system. Technically, we employ dual system encryption technique and our proposal offers adaptive security under the general subgroup decisional assumption. Our scheme demonstrates that the adaptive security of the schemes utilizing a composite order group can be proven under the general subgroup decisional assumption, while many existing systems working in a composite order group are secure under multiple subgroup decision assumptions. We note that this finding is of an independent interest, which may be useful in other scenarios.

We reformalize and recast the notion of public key encryption with equality test (PKEET), which was proposed in CT-RSA 2010 and supports to check whether two ciphertexts encrypted under different public keys contain the same message. PKEET has many interesting applications, for example, in constructing searchable encryption and partitioning encrypted data. However, the original PKEET scheme lacks an authorization mechanism for a user to control the comparison of its ciphertexts with others’. In this paper, we study the authorization mechanism for PKEET, and propose four types of authorization policies to enhance the privacy of users’ data. We give the definitions of the policies, propose a PKEET scheme supporting these four types of authorization at the same time, and prove its security based on the computational Diffie–Hellman assumption in the random oracle model. To the best of our knowledge, it is the only PKEET scheme supporting flexible authorization.

Most of the encryption algorithms used today generates huge cipher messages as well as long encryption keys. These approaches require time and are computationally intensive .While sending data packets through the network a compression technique along with cryptography can be applied to reduce the data packet size for better bandwidth utilization and hence faster transmission of data. In this study we propose a new encryption technique which will encrypt data into reduced size cipher text while keeping the check on size of key. The algorithm was first introduced in an earlier paper. In this study we modified algorithm to preprocess text as well as numeric data.

In a cloud scenario, biggest concern is around security of the data. “Both data in transit and at rest must be secure” is a primary goal of any organization. Data in transit can be made secure using TLS level security like SSL certificates. But data at rest is not quite secure, as database servers in public cloud domain are more prone to vulnerabilities. Not all cloud providers give out of box encryption with their offerings. Also implementing traditional encryption techniques will cause lot of changes in application as well as at database level. This paper provides efficient approach to encrypt data using Format Preserving Encryption technique. FPE focuses mainly on encrypting data without changing format so that it’s easy to develop and migrate legacy application to cloud. It is capable of performing format preserving encryption on numeric, string and the combination of both. This literature states various features and advantages of same.

This paper proposes a color image encryption scheme using one-time keys based on crossover operator, chaos and the Secure Hash Algorithm(SHA-2). The (SHA-2) is employed to generate a 256-bit hash value from both the plain-image and the secret hash keys to make the key stream change in each encryption process. The SHA-2 value is employed to generate three initial values of the chaotic system. The permutation-diffusion process is based on the crossover operator and XOR operator, respectively. Experimental results and security analysis show that the scheme can achieve good encryption result through only one round encryption process, the key space is large enough to resist against common attacks,so the scheme is reliable to be applied in image encryption and secure communication.

The main purpose of this work is the management of security. This will allow users authorization and integrity, accuracy and images security circulating on the Internet. Addition to that, more effort is required for an image-based data in the process of encrypting and decrypting the image. Proposed Architecture facilities for encrypting and decrypting an image using the suitable key and is designed to work for the same purpose. In this article we present a strategy for the new permutations based on a combination of different blocks of pixels and the symmetric encryption algorithm newly developed called "Image Symmetric Encryption Based on Block Displacement". The different blocks of the selected image is formed to change the layout of pixels into an image by the interchanging process, and then using the proposed symmetric encryption Algorithm the processed image will be encrypted. Keywords Encryption; Decryption; Security; Image, Cryptography; Algorithm.

The objective of this paper is to provide the dual level security for the key in playfair cipher using modified RSA digital signature scheme. This work has two phases, in the first phase the key is converted into the ASCII code and in the second phase, this work is using the concept of modified RSA digital signature scheme in which user authentication, data integrity and non-repudiation services are provided but as all know that in playfair technique, key exchange process is most important so there is a need to secure the key during key transfer that’s why this work is using the concept of modified RSA public key encryption technique to encrypt the key before sending it to the receiver for decryption. This work use a 10*8 matrix which contain all alphabetic in the uppercase as well as in lowercase, the numeric value from 0 to 9, list of operator and list of bracket. General Terms Key Security.

In 2011, Eissa, Razak and Ngadi proposed a lightweight authentication and encryption scheme to enhance the performance for mobile ad hoc network in Wireless Network, Vol. 17, No. 4, 2011. The main building block of such scheme is an identity-based encryption scheme. The scheme was proven secure in the random oracle model assuming the computational Diffie-Hellman assumption is hard. In this paper, we show that the proposed scheme is not even secure against chosen plaintext attack, which is the lowest acceptable level of security. In addition, we demonstrate the RSA parameter suggested by Eissa et al. to yield a better network performance is not appropriate under a wrong security assumption that each mobile node is totally trusted. Such short RSA parameter leads to a key recovery attack. Copyright © 2015John Wiley & Sons, Ltd.

The comparative analysis of the renowned cryptographic algorithms AES, DES and RSA. The Rijndael algorithm was adapted as Advanced Encryption Standard (AES) algorithm, to Data Encryption algorithm (DES), which have been in the security standards since long time. The comparative analysis is implemented in IEEE 802.11i wireless platform. Compared to DES, AES contains CCMP which is a security standard that provides the highest level of security to encrypt and authenticate the data simultaneously. CCMP protocol is to provide robust security. The CCMP protocol is based on Advanced Encryption Standard (AES) encryption algorithm. It uses the Counter Mode with CBC-MAC (CCM) mode of operation. The CCM mode combines Counter (CTR) mode for privacy and Cipher Block Chaining Message Authentication Code (CBC-MAC) for authentication. The implementation is done on the NS-2 platform to compare and analyzes the performance of this with DES and RSA algorithms, based on the following three criteria: (a) Bit rate; (b) Packet delay; and (c) The number of packets. Thus the motivation is to provide a secure data transfer in the wireless medium in IEEE 802.11i.

In this paper we are going to encrypt plain text to encrypted text. Message encryption is character value based encryption in which 3D message character matrix is replaced with 2D encryption value matrix. It can also know by some kind of message masking which work on upper level to provide maximum security. Password protection increases encrypted message file security.

Data stored in the cloud servers, keyword search, and access controls are two important capabilities which should be supported. Public-keyword encryption with keyword search (PEKS) and attribute based encryption (ABE) are corresponding solutions. Meanwhile, as we step into postquantum era, pairing related assumption is fragile. Lattice is an ideal choice for building secure encryption scheme against quantum attack. Based on this, we propose the first mathematical model for lattice-based authorized searchable encryption. Data owners can sort the ciphertext by specific keywords such as time; data users satisfying the access control hand the trapdoor generated with the keyword to the cloud sever; the cloud sever sends back the corresponding ciphertext. The security of our schemes is based on the worst-case hardness on lattices, called learning with errors (LWE) assumption. In addition, our scheme achieves attribute-hiding, which could protect the sensitive information of data user.

Cloud computing is emerging paradigm provides various IT related services. The security and privacy are two major factors that inhibits the growth of cloud computing. Security factors are reasons behind lesser number of real times and business related cloud applications compared to consumer related cloud application. Firstly, the pros and cons of different Attribute Based encryption methods are analysed. Secondly, a new encryption method based on Attribute Based Encryption (ABE) using hash functions, digital signature and asymmetric encryptions scheme has been proposed. Our proposed algorithm is simplified yet efficient algorithm that can implemented for cloud critical application.

The enlarged size of the internet and vast communication across it and also medical needs digital images require of security plays vital role. So different techniques are used to protect confidential image data from unauthorized access. In this paper, we propose a New encryption technique Using elliptic curve cryptography with a magic matrix operations for securing images that transmits over a public unsecured channel. There are two most important groups of image encryption algorithms: some are non chaos-based selective methods and chaos- based selective methods. The majority of these algorithms is planned for a specific image format, compressed or uncompressed.

With the rapid evolution of data exchange in network environments, information security has been the most important process for data storage and communication. In order to provide such information security, the confidentiality, data integrity, and data origin authentication must be verified based on cryptographic encryption algorithms. This paper presents a new emerging trend of modern symmetric encryption algorithm by development of the advanced encryption standard (AES) algorithm. The new development focuses on the integration between Quantum Key Distribution (QKD) and an enhanced version of AES. A new quantum symmetric encryption algorithm, which is abbreviated as Quantum-AES (QAES), is the output of such integration. QAES depends on generation of dynamic quantum S-Boxes (DQS-Boxes) based quantum cipher key, instead of the ordinary used static S-Boxes. Furthermore, QAES exploits the specific selected secret key generated from the QKD cipher using two different modes (online and off-line).

This paper presents a simple Encryption/Decryption technique which enables all kinds of file for encryption and decryption. The method of encryption is not only simple, but also secured enough for transmission. The technique uses simple key generation using an arbitrary matrix. The final encryption is performed through a set of operations using the generated key and original data block and vice-versa in decryption. The generation of keys along with encryption and decryption is performed by the algorithm by putting in the data block and arbitrary matrix. The encryption process can be done by modifying the arbitrary matrix and multiple key can be generated for a single data block.

In current Internet, data owners can provide integrity and authentication when data is generated. However confidentiality is usually implemented by symmetric keys between two corresponding programs in an end-to-end manner. A symmetric key for confidentiality is not suitable for Internet of Things (IoT) environment where there are one producer of data and multiple consumers of data. Further the consumers differ in their qualification about what part of the data is allowed to access under which context. In the paper we describe our work in progress of confidentiality scheme in which the producer encrypts data along with context. We improve Key Policy Attribute Based Encryption (KP-ABE) and Ciphertext Policy Attribute Based Encryption (CP-ABE) to allow consumers to decrypt data as their contexts dictate. We describe briefly our scheme to implement the idea.

Traditional block cipher Advanced Encryption Standard (AES) is widely used in the field of network security, but it has high overhead on each operation. In the 15th international workshop on information security applications, a novel lightweight and low-power encryption algorithm named low-power encryption algorithm (LEA) was released. This algorithm has certain useful features for hardware and software implementations, that is, simple addition, rotation, exclusive-or (ARX) operations, non-Substitute-BOX architecture, and 32-bit word size. In this study, we further improve the LEA encryptions for cloud computing. The Web-based implementations include JavaScript and assembly codes. Unlike normal implementation, JavaScript does not support unsigned integer and rotation operations; therefore, we present several techniques for resolving this issue. Furthermore, the proposed method yields a speed-optimized result and shows high performance enhancements. Each implementation is tested using various Web browsers, such as Google Chrome, Internet Explorer, and Mozilla Firefox, and on various devices including personal computers and mobile devices. These results extend the use of LEA encryption to any circumstance.

This paper presents analysis of network data encryption and decryption techniques used in communication systems. In network communication systems, exchange of information mostly occurs on networked computers, mobile phones and other internet based electronic gadgets. Unsecured data that travels through different networks are open to many types of attack and can be read, altered or forged by anyone who has access to that data. To prevent such an attack, data encryption and decryption technique is employed. In order to visualize the effect and evaluate the performance of the encryption and decryption of each technique used in communication systems, Visual Basic simulation program that encrypt and decrypt data were developed, written and tested. Different data block sizes were captured and plotted against total time response taken during data encryption using Microsoft Excel. The graph result shows the superiority of RSA and AES algorithms over other algorithms in terms of the processing speed and time. DES has worm holes in its security mechanism whereas Blowfish, AES, and RSA do not have any. Further analysis was made based on the graph result obtained on each data encryption techniques

WSNs is usually deployed in opening wireless environment, its data is easy to be intercepted by attackers. It is necessary to adopt some encryption measurements to protect data of WSNs. But the battery capacity, CPU performance and RAM capacity of WSNs sensors are all limited, the complex encryption algorithm is not fitted for them. The paper proposed a light-level symmetrical encryption algorithm: LWSEA, which adopt minor encryption rounds, shorter data packet and simplified scrambling function. So the calculation cost of LWSEA is very low. We also adopt longer-bit Key and circular interpolation method to produce Child-Key, which raised the security of LWSEA. The experiments demonstrate that the LWSEA possess better ―avalanche effect‖ and data confusion degree, furthermore, its calculation speed is far faster than DES, but its resource cost is very low. Those excellent performances make LWSEA is much suited for resource-restrained WSNs.

Location privacy is a concern in mobile networks monitoring systems. We propose a model using homomorphic encryption, where researchers can compute aggregations, learning nothing more about users' location than the result of the aggregation. We build a location privacy layer on top of Adkintun Mobile using a Partial Homomorphic Encryption Scheme (Paillier) and a Fully Homomorphic Encryption scheme (HElib) and compared the performance. The result shows that both systems are practical for off-line statistical computation.

Retaining electronic privacy requires more political engagement.

Inside a dispersed foriegn atmosphere, anyone receives a untrusted company which has a change for better crucial allowing this foriegn to turn any kind of ABE ciphertext fulfilled through the wearer's features. Stability of ABE technique with outsourced decryption makes certain that a foe (including any destructive cloud) aren't going to be capable to study everything about the encrypted meaning. Anyway, this product doesn't ensure this correctness with the change for better completed through the foriegn. Verifiability ensures if thez change for better offers transpired appropriately or maybe certainly not. With this paper, it all recommend a improvised version of ABE with verifiability. A new concrete scheme pertaining to ABE with verifiable outsourced decryption can be recommended which is both safe along with verifiable without having based after hit-or-miss oracles.

A cryptographic algorithm is very important in securing the confidential data while transmitting over the network. Modern cryptography is suggesting a variety of encryption schemes for protecting & securing the data. This paper focuses on developing a new method to generate the key & algorithm by using cryptographic techniques which will all together make an encryption scheme which is secure for generating the key. The proposed scheme does not require any specialized hardware or software, so basically it is low-cost & flexible for peer to peer networks & entity communication, which is based on the matrix. Finally, the paper concludes that simulation results are important for the feasibility of the algorithm.

Attribute-Based Encryption (ABE) is a generalized cryptographic primitive from normal public key encryption. It provides an access control mechanism over encrypted message using access policies and ascribed attributes. This scheme can solve the privacy issue when data is outsourced to cloud for storage well. However, there are some practical issues which must be fixed before ABE becomes applicable. One is that both the ciphertext size and the decryption time grows with the complexity of the access policy, which brings pressure to mobile devies. The other is that, from practical point of view, some users might be disabled for some attributes or be removed from the system. It demands on flexible revocation mechanism supporting both user and attribute granularities. In this research, we propose a solution adopting techniques on secure outsourcing of pairings to support outsourcing computation and adopting some techniques based on the tree-based scheme to solve user revocation and attribute revocation. We also give its security model and proof.

Data security is a major concern in cloud computing. It must satisfy three goals of security in computing—integrity, confidentiality, and availability. User or cloud service provider (CSP) can perform operations on cloud data without performing decryption by using homomorphic encryption. Many algorithms are available for homomorphic encryption. These algorithms are generating large size cipher text. In this chapter, small-size cipher text homomorphic encryption algorithm is proposed. This scheme is a modified scheme proposed by Dijk et al. The experimentation is performed on data stored on DynamoDB of Amazon Web Services (AWS) public cloud. All arithmetic computations are performed on low-size encrypted data. Data can be downloaded on users machine as per the requirement and then decrypt it.

Searchable Symmetric Encryption is a mechanism that facilitates search over encrypted data that are outsourced to an untrusted server. SSE schemes are practical as they trade nicely security for efficiency. However, the supported functionalities are mainly limited to single keyword queries.In this paper, we present a new efficient SSE scheme, called REX, that supports range queries. REX is a no interactive (single round) and response-hiding scheme. It has optimal communication and search computation complexity, while it is much more secure than traditional Order Preserving Encryption based range SSE schemes.

We introduce identity-based format-preserving encryption (IB-FPE) as a way to localize and limit the damage to format-preserving encryption (FPE) from key exposure. We give definitions, relations between them, generic attacks and two transforms of FPE schemes to IB-FPE schemes. As a special case, we introduce and cover identity-based tweakable blockciphers. We apply all this to analyze DFF, an FPE scheme proposed to NIST for standardization.

Time and again, attribute-based encryption has been shown to be the natural cryptographic tool for building various types of conditional access systems with far-reaching applications, but the deployment of such systems has been very slow. A central issue is the lack of an encryption scheme that can operate on sensitive data very efficiently and, at the same time, provides features that are important in practice. This paper proposes the first fully secure ciphertext-policy and key-policy ABE schemes based on a standard assumption on Type-III pairing groups, which do not put any restriction on policy type or attributes. We implement our schemes along with several other prominent ones using the Charm library, and demonstrate that they perform better on almost all parameters of interest.

Security is a challenging issue in today’s digital world and for this, role of cryptography is significant. Cryptography secures data and information using an encryption algorithm and keys. There is always demand for a stronger encryption algorithm that would be very hard or impossible to crack without valid keys so that the privacy of intended sender and receiver information can be protected from hackers. This paper suggests a novel encryption scheme for SMS communication that uses multiple rounds of encryption to provide better privacy to the transmitted message against unauthorized access. Message integrity and authentication have been ensured by addition of authentication characters to the message. Keeping in mind the limited memory and processing capacity of mobile devices, the algorithm has been kept simpler and at the same time the strength of the scheme has been ensured with a stronger key and better mix of confusion and diffusion principles.

Remote sensing has the characteristics of multi-temporal, multi-semantic and multi-spectral, and it plays an important role in most kinds of fields, so we should take some measures to protect the security of the remote sensing. With the rapid development of technology in three-dimensional remote sensing, it has promoted the remote sensing data growth explosively, and it has shown the big data characteristics obviously. Because of the non-complete trusted cloud environment, we consider a security homomorphic encryption scheme over the most significant bit in cloud, which can support the operation for ciphertext remote image in cloud.

In broadcast encryption schemes, a distribution center broadcasts an encrypted message to a subset chosen from a universe of receivers and only the intended users are able to decrypt the message. Most broadcast encryption schemes do not provide anonymity and the identities of target receivers are sent in plaintext. However, in several applications, the authorized users’ identities have the same sensitivity as the broadcasted messages. Yu, Ren and Lou (YRL) considered this issue and introduced an e€icient anonymous a‚ribute-based broadcast encryption scheme. In this paper, we first propose an a‚ack on the YRL scheme and showthat the unauthorized receivers can also decrypt the broadcasted message. Next, we propose the Improved-YRL scheme and prove that it achieves anonymity and semantic security under adaptive corruptions in the chosen ciphertext se‚ing. The proof is provided using the dual system encryption technique and is based on three complexity assumptions in composite order bilinear maps. The Improved-YRL scheme is a step forwardin solving the long-standing problem of secure and low overhead anonymous broadcast encryption.

International audience; Somewhat Homomorphic Encryption (SHE) schemes can be used to carry out operations on ciphered data. In a cloud computing scenario, personal information can be processed secretly, inferring a high level of confidentiality. The principle limitation of SHE is the size of ciphertext compared to the size of the message. This issue can be addressed by using a batching technique that "packs" several messages into one ciphertext. However, this method leads to important drawbacks in standard implementations. This paper presents a fast hardware/software co-design implementation of an encryption procedure using the Karatsuba algorithm. Our hard- ware accelerator is 1.5 times faster than the state of the art for 1 encryption and 4 times faster for 4 encryptions.

International audience; Over the last 30 years, a number of secure processor architectures have been proposed to protect software integrity and confidentiality during its distribution and execution. In such architectures, encryption (together with integrity checking) is used extensively, on any data leaving a defined secure boundary. In this paper, we show how encryption can be achieved at the instruction level using a stream cipher. Thus encryption is more lightweight and efficient, and is maintained deeper in the memory hierarchy than the natural off-chip boundary considered in most research works. It requires the control flow graph to be used and modified as part of the off-line encryption process, but thanks to the LLVM framework, it can be integrated easily in a compiler pipeline, and be completely transparent to the programmer. We also describe hardware modifications needed to support this encryption method, the latter were added to a 32 bit MIPS soft core. The synthesis performed on a Altera Cyclone V FPGA shows that encryption requires 26% of extra logic, while slowingdown execution time by an average of 48% in the best setting.

Cloud computing is a technology that facilitates numerous configurable resources in which the data is stored and managed in a decentralized manner. However, since the data is out of the owner's control, concerns have arisen regarding data confidentiality. Encryption techniques have previously been proposed to provide users with confidentiality in terms of outsource storage; however, many of these encryption algorithms are weak, enabling data security to be breached simply by compromising an algorithm. We propose a combination of encryption algorithms and a distribution system to improve database confidentiality. This scheme distributes the database across the clouds based on the level of security that is provided by the encryption algorithms utilized. We analyzed our scheme by designing and conducting experiments and by comparing our scheme with existing solutions. The results demonstrate that our scheme offers a highly secure approach that provides users with data confidentiality and provides acceptable overhead performance.

Securing Data in the cloud based on Fully Homomorphic Encryption (FHE) is a new and potential form of security that allows computing on encrypted data without decrypted it first. However, a practical FHE solution is not available for implementation today. In this work, we propose a platform based on open source solutions to perform data computations (addition and multiplication) on encrypted form. In addition, taking account of efficiently and the security component, the most popular partially homomorphic encryption algorithms (RSA, Paillier and ElGamal) are studied to analyze the process times of encryption, decryption and computation of each algorithm. Furthermore, to compromise between performance and security, we need to study different key sizes and different data sizes as parameters.

Outsourcing data to the cloud is becoming increasingly prevalent. To ensure data confidentiality, encrypting the data before outsourcing it is advised. While encryption protects the secrets in the data, it also prevents operations on the data. For example in a multi-user setting, data is often accessed via search, but encryption prevents search. Searchable encryption solves this dilemma. However, in a multi-user setting not all users may be allowed to access all data, requiring some means of access control. We address the question how searchable encryption and access control can be combined. Combining these technologies is required to achieve strong notions of confidentiality: if a ciphertext occurs as a search result, we learn something about the underlying document, even if access control does not let us access the document. This illustrates a need to link search and access control, so that search results presented to users only feature data the users are allowed to access. Our searchable encryption scheme with access control establishes that link.

Video data are being compressed and distributed using one of several coding standards, among which the most recent and popular is the High Efficiency Video Coding (HEVC) standard. The threatening growth of security attacks, on the other hand, has brought security and privacy concerns to the attention of governments and people as well. In the absence of a reliable security system, shared multimedia data used on the public networks such as the internet will continue to be exposed to different types of attacks, making end-to-end encryption for video data a necessity to protect their sensitive information. Therefore, providing a reliable video security technique that complies to and fulfills the requirements of HEVC is pertinent. In this paper, a fast selective encryption approach is developed to provide protection for video bitstreams of HEVC, which can be used in real-time video applications, with low computational overhead and maintaining the standard’s video bit rate. This approach employs the popular Advance Encryption Standard (AES) algorithm to encrypt selected elements in the horizontal intra prediction modes. Experimental evaluations confirm the provision of adequate security level of video information, with no bitrate increase, no increase in computational delay and no additional impact on the compression performance when compared to non-secure techniques, while also achieving a satisfactory trade-off between the encryption reliability, flexibility, and computational complexity. The security level of this method was found to be strongly secure against plaintext and brute force attacks.

Cloud computing is like a daily routine now a day. Even though it has numbers of advantages in technical and business view, still there are some challenges there like data storage security, confidentiality and integrity. Main risk in cloud data is about to trust on cloud owner. Encrypted data is not useful for any computational process, so we cannot store as encrypted data. In recommendation system cloud plays very important role. Using homomorphic encryption, we can perform cloud data analyzation. This paper discusses about different homomorphic encryption technique and solution to recommendation system.

In this paper, we propose a variant of searchable public-key encryption named hidden-token searchable public-key encryption with two new security properties: token anonymity and one-token-per-trapdoor. With the former security notion, the client can obtain the search token from the data owner without revealing any information about the underlying keyword. Meanwhile, the client cannot derive more than one token from one trapdoor generated by the data owner according to the latter security notion. Furthermore, we present a concrete hiddentoken searchable public-key encryption scheme together with the security proofs in the random oracle model.