Search

© 2013 IEEE. In medical cloud computing, a patient can remotely outsource her medical data to the cloud server. In this case, only authorized doctors are allowed to access the data since the medical data is highly sensitive. Before outsourcing, the data is commonly encrypted, where the corresponding secret key is sent to authorized doctors. However, performing searches on encrypted medical data is difficult without decryption. In this paper, we propose two Secure and Efficient Dynamic Searchable Symmetric Encryption (SEDSSE) schemes over medical cloud data. First, we utilize the secure k-Nearest Neighbor (kNN) and Attribute-Based Encryption (ABE) techniques to construct a dynamic searchable symmetric encryption scheme, which can achieve forward privacy and backward privacy simultaneously. These tow security properties are vital and very challenging in the area of dynamic searchable symmetric encryption. Then, we propose an enhanced scheme to solve the key sharing problem which widely exists in the kNN based searchable encryption scheme. Compared with existing proposals, our schemes are better in terms of storage, search and updating complexity. Extensive experiments demonstrate the efficiency of our schemes on storage overhead, index building, trapdoor generating and query.

The study of sending and receiving secret messages is called cryptography. Generally, senders and receivers are unaware about the process of encryption and decryption. Hence, encryption plays an important role in data communication and data security. The meaning of encryption is not only to keep data confidential from unwanted access but also ensuring the data integrity through available way. As the capacity of breaking the security is increasing rapidly, so, the process that hides information is one of the most concerned topics. Advanced Encryption Standard is a popular, widely used and efficient encryption algorithm, which has been used since it was invented. This paper focuses on the AES key generation process and Substitution box. It modifies the conventional key generation technique and builds the dynamic 3-Dimensional S-box of Advance Encryption Standard. The proposed approach suggests 3-Dimensioanl Key Generation Matrix and S-box. As per shown this novel technique increases the amount of time it needs during encryption and decryption. The experimental result shows that it also enhances the strength of AES algorithm. The proposed approach illustrates the theoretical analysis and corresponding experimented results., 7 pages, 14 figures, 4 tables. Published in IJCSA in 2017

International audience; Functional encryption lies at the frontiers of the current research in cryptography; some variants have been shown sufficiently powerful to yield indistinguishability obfuscation (IO), while other variants have been constructed from standard assumptions such as LWE. Indeed, most variants have been classified as belonging to either the former or the latter category. However, one mystery that has remained is the case of secret-key functional encryption with an unbounded number of keys and ciphertexts. On the one hand, this primitive is not known to imply anything outside of minicrypt, the land of secret-key cryptography, but, on the other hand, we do no know how to construct it without the heavy hammers in obfustopia. In this work, we show that (subexponentially secure) secret-key functional encryption is powerful enough to construct indistinguishability obfuscation if we additionally assume the existence of (subexponentially secure) plain public-key encryption. In other words, secret-key functional encryption provides a bridge from cryptomania to obfustopia. On the technical side, our result relies on two main components. As our first contribution, we show how to use secret-key functional encryption to get “exponentially efficient indistinguishability obfuscation” (XIO), a notion recently introduced by Lin et al. (PKC’16) as a relaxation of IO. Lin et al. show how to use XIO and the LWE assumption to build IO. As our second contribution, we improve on this result by replacing its reliance on the LWE assumption with any plain public-key encryption scheme. Lastly, we ask whether secret-key functional encryption can be used to construct public-key encryption itself and therefore take us all the way from minicrypt to obfustopia. A result of Asharov and Segev (FOCS’15) shows that this is not the case under black-box constructions, even for exponentially secure functional encryption. We show, through a non-black-box construction, that subexponentially secure-key functional encryption indeed leads to public-key encryption. The resulting public-key encryption scheme, however, is at most quasi-polynomially secure, which is insufficient to take us to obfustopia.

Image encryption is rapidly increased recently by the increasing use of the internet and communication media. Sharing important images over unsecured channels is liable for attacking and stealing. Encryption techniques are the suitable methods to protect images from attacks. Hill cipher algorithm is one of the symmetric techniques, it has a simple structure and fast computations, but weak security because sender and receiver need to use and share the same private key within a non-secure channels. A new image encryption technique that combines Elliptic Curve Cryptosystem with Hill Cipher (ECCHC) has been proposed in this paper to convert Hill cipher from symmetric technique to asymmetric one and increase its security and efficiency and resist the hackers. Self-invertible key matrix is used to generate encryption and decryption secret key. So, no need to find the inverse key matrix in the decryption process. A secret key matrix with dimensions 4 × 4 will be used as an example in this study. Entropy, Peak Signal to Noise Ratio (PSNR), and Unified Average Changing Intensity (UACI) will be used to assess the grayscale image encryption efficiency and compare the encrypted image with the original image to evaluate the performance of the proposed encryption technique. Keywords: Elliptic Curve Cryptography, Hill cipher, Self-invertible, Entropy, Peak Signal to Noise Ratio, Unified Average Changing Intensity

Searchable encryption allows a cloud server to conduct keyword search over encrypted data on behalf of the data users without learning the underlying plaintexts. However, most existing searchable encryption schemes only support single or conjunctive keyword search, while a few other schemes that are able to perform expressive keyword search are computationally inefficient since they are built from bilinear pairings over the composite-order groups. In this paper, we propose an expressive public-key searchable encryption scheme in the prime-order groups, which allows keyword search policies (i.e., predicates, access structures) to be expressed in conjunctive, disjunctive or any monotonic Boolean formulas and achieves significant performance improvement over existing schemes. We formally define its security, and prove that it is selectively secure in the standard model. Also, we implement the proposed scheme using a rapid prototyping tool called Charm [37], and conduct several experiments to evaluate it performance. The results demonstrate that our scheme is much more efficient than the ones built over the composite-order groups.

This paper considers the security problem of outsourcing storage from user devices to the cloud. A secure searchable encryption scheme is presented to enable searching of encrypted user data in the cloud. The scheme simultaneously supports fuzzy keyword searching and matched results ranking, which are two important factors in facilitating practical searchable encryption. A chaotic fuzzy transformation method is proposed to support secure fuzzy keyword indexing, storage and query. A secure posting list is also created to rank the matched results while maintaining the privacy and confidentiality of the user data, and saving the resources of the user mobile devices. Comprehensive tests have been performed and the experimental results show that the proposed scheme is efficient and suitable for a secure searchable cloud storage system.

Database encryption is essential for cloud database systems. For a large database, decryption could take a lot of computational time. Therefore, verifying an encryption that contains a correct plaintext without decryption becomes significant for a large database system. Plaintext-checkable encryption (PCE) is a potential tool for such database systems, which is first proposed by Canard et al. in CT-RSA 2012. Although the generic PCE in the random oracle model has been studied intensively, the generic PCE in the standard model and its efficient implementation are still challenging problems. This paper presents the first generic PCE in the standard model using smooth projective hash function (SPHF) and prove its s-priv1-cca security, which is independent of current unlink security. Based on the instantiated SPHF from DDH assumption, we obtain the most efficient PCE in the standard model, without any pairing operation. Finally, we improve two existing generic constructions in the random oracle model so that they are secure under chosen ciphertext attack.

Identity-based broadcast encryption (IBBE) is an important type of broadcast encryption. In the paper, we put forward the formal definition and security model of IBBE with leakage-resilience. Furthermore, we propose an IBBE scheme with continuous leakage-resilience. The presented scheme is resilient to private key leakage. By refreshing the private key, our scheme can resist continuous private key leakage. Based on dual system encryption technique, we prove the security of the proposed scheme under subgroup decisional assumptions. We give the specific performance analysis of leakage-resilience. The relative leakage ratio can amount to 1/3.

This paper presents the weaknesses in the cryptosystem proposed by W. Zhang and his colleagues. The proposed method to restore the permutation rule is based on the chosen-ciphertext attack. The method is successful in restoration of the permutation rule in the case of multiple encryption rounds without any knowledge about the cryptosystem. In order to improve the security of W. Zhang's cryptosystem, the proposed modifications are made to the equations to resist against the chosen-ciphertext attack. The specific examples will demonstrate the cryptanalysis and the security improvement.

Lightweight devices, such as a smartcard associated with a top-box decoder in pay-TV or a SIM card coupled with a powerful (but not totally trusted) smartphone, play an important role in modern applications. The essential requirements for a cryptographic scheme to be truly implemented in lightweight devices are that it should have compact secret key size and support fast decryption. Attribute-based broadcast encryption (ABBE) combines the functionalities of both broadcast encryption and attribute-based encryption in an efficient way, ABBE is therefore a promising cryptographic scheme to be used in practical applications such as mobile pay-TV, satellite transmission, or Internet of Things. Designing an ABBE scheme which can be truly implemented in lightweight devices is still an open question. In this study, the authors solve it by proposing an efficient constant-size private key ciphertext-policy ABBE scheme for disjunctive normal form supporting fast decryption and achieving standard security levels of an ABBE scheme. They concretely show that the authors’ scheme can be truly implemented in a prototype for a smartphone-based cloud storage use case. In particular, they show how to alleviate some parts of their scheme so as to obtain a very practical system, and they give some concrete benchmarks.

Usage of EC operations as initial random generator and encrypting through AES to generate new pseudo random to mask whole image pixels.Simulations and analysis results show that cooperation of AES and EC random numbers makes great results in randomness and image encryption field.Comparable security and speed with other trend schemes like chaos based encryptions. Elliptic Curve Cryptography (ECC) has proven to be an effective cryptography. ECC has its own advantages such as efficient key size compared to other Public Key Infrastructures. This paper exploits the Elliptic curve random generator defined by National Institute of Standards and Technology (NIST) to generate a sequence of arbitrary numbers based on curves. The random generation phase is based on public shared key and a changing point G, which is a generator of a curve to obtain random sequences. Then, Advanced Encryption System is applied to these sequences acquiring arbitrary keys for encrypting image. Using AES alongside well distributed randoms provides a prominent encryption technique. Our experiments show that the proposed method fulfills the basics of cryptography including simpleness and correctness. Moreover, the results of the evaluation prove the effectiveness and security of the proposed method.

To protect receiver privacy, researchers constructed anonymous multireceiver encryption by implanting anonymity in multireceiver encryption. It allows a sender to produce the identical ciphertext for multiple designated receivers. Every designated receiver can decrypt the ciphertext, but does not know who the other designated receivers are. Recently, several anonymous multireceiver identity (ID)-based encryption (AMIBE) schemes were proposed without the utilization of certificates. However, these AMIBE schemes are not efficient because their decryption cost of each receiver grows linearly with the number of the designated receivers. Moreover, all the ID-based cryptographic schemes suffer from the key escrow problem, which has been resolved by using certificateless public key settings. Very recently, Islam et al. proposed an anonymous multireceiver certificateless encryption (AMCLE) scheme. However, the encryption cost of a sender is quadric with the number of designated receivers, whereas the decryption cost of each receiver is linear with the number. In this paper, we propose an efficient AMCLE scheme with constant decryption cost, namely, the required decryption cost of each receiver is independent of the number of receivers. When compared with previously proposed AMIBE and AMCLE schemes, our scheme solves the key escrow problem and improves the efficiency of encryption/decryption significantly as well.

In this work, we investigate how to protect public key encryption from both key-leakage attacks and tampering attacks. First, we formalize the notions of chosen ciphertext (CCA) security against key-leakage and tampering attacks. To this goal, we then introduce the concept of key-homomorphic hash proof systems and present a generic construction of public key encryption based on this new primitive. Our construction, compared with previous works, realizes leakage-resilience and tampering-resilience simultaneously but completely independently, so it can tolerate a larger amount of bounded-memory leakage and be instantiated with more flexibility. Moreover, it allows for an unbounded number of affine-tampering queries, even after the challenge phase. With slight adaptations, our construction also achieves CCA security against subexponentially hard auxiliary-input leakage attacks and a polynomial of affine-tampering attacks. Thus, to the best of our knowledge, we get the first public key encryption scheme secure against both auxiliary-input leakage attacks and tampering attacks.

Networked control systems with encrypted sensors measurements is considered. Semi-homomorphic encryption, specifically the Paillier encryption, is used so that the controller can perform the required computation on the encrypted data. Conditions on the parameters of the encryption technique are provided that guarantee the stability and the performance of the closed-loop system. The results are subsequently extended Laplacian based distributed systems, such as formation-seeking algorithms. It is shown that the problem of figuring out the state measurements of the neighbouring agents of a compromised agent upon using the proposed algorithm is numerically intractable.

Cryptographic architectures provide different security properties to sensitive usage models. However, unless reliability of architectures is guaranteed, such security properties can be undermined through natural or malicious faults. In this paper, two underlying block ciphers which can be used in authenticated encryption algorithms are considered, i.e., light encryption device and high security and lightweight block ciphers. The former is of the Advanced Encryption Standard type and has been considered area-efficient, while the latter constitutes a Feistel network structure and is suitable for low-complexity and low-power embedded security applications. In this paper, we propose efficient error detection architectures including variants of recomputing with encoded operands and signature-based schemes to detect both transient and permanent faults. Authenticated encryption is applied in cryptography to provide confidentiality, integrity, and authenticity simultaneously to the message sent in a communication channel. In this paper, we show that the proposed schemes are applicable to the case study of simple lightweight CFB for providing authenticated encryption with associated data. The error simulations are performed using Xilinx Integrated Synthesis Environment tool and the results are benchmarked for the Xilinx FPGA family Virtex-7 to assess the reliability capability and efficiency of the proposed architectures.

Cryptographyis the process of data hiding from unauthorised users. Historically, the term “Cryptography” has been associated with the problem of designing and analyzing encryptionschemes (i.e., scheme that provide secret communication over insecure communication media). With the growth of internet secure data transmission is more and more essential and important. Sometime single encryption technique is not sufficient to protect the valuable data. We developed a new algorithm which can change the encryptiontechnique with change of plane textpattern to enhance the confusion and as well as diffusion.

We develop a new cryptosystem for fine-grained sharing of encrypted data that we call Key-Policy Attribute-Based Encryption (KP-ABE).As more sensitive data is shared and stored by third-party sites on the Internet, there will be a need to encrypt data stored at these sites. One drawback of encrypting data, is that it can be selectively shared only at a coarse-grained level (i.e., giving another party your private key). Instead of trusting a middle layer authority , we perform an end to end encryption using the Key-Policy Attribute-Based Encryption (KP-ABE).Moreover the proposed system is proved to be secured under standard assumption. With the number of the files increasing, the advantages of our scheme become more and more usefull.

Efficient searching on encrypted data outsourced to the cloud remains a research challenge. Identity-based encryption with equality test (IBEET) scheme has recently been identified as a viable solution, in which users can delegate a trapdoor to the server and the server then searches on user outsourced encrypted data to determine whether two different ciphertexts are encryptions of the same plaintext. Such schemes are, unfortunately, inefficient particularly for deployment on mobile devices (with limited power/battery life and computing capacity). In this paper, we propose an efficient IBEET scheme with bilinear pairing, which reduces the need for time-consuming HashToPoint function. We then prove the security of our scheme for one-way secure against chosen identity and chosen ciphertext attacks (OWIDCCA) in the random oracle model (ROM). The performance evaluation of our scheme demonstrates that in comparison to the scheme of Ma (2016), our scheme achieves a reduction of 36.7% and 39.24% in computation cost during the encryption phase and test phase, respectively, and that our scheme is suitable for (mobile) cloud deployment. We propose an identity-based encryption with equality test (IBEET) scheme using bilinear pairing for cloud storage.We show that our proposed concrete scheme is provably secure. It satisfies required security properties.Detailed performance analysis and experimental result are given.

Hierarchical identity-based encryption is an important extension from IBE and has found many applications in the network world. Private key revocation is a crucial requirement for any public key system. In this paper, we propose a novel revocation method for the hierarchical identity-based encryption. Existing revocable hierarchical identity-based encryption schemes have several disadvantages: the key update size increases logarithmically with the number of users in the system, the public information of key update received by each user is different and always related to the level of the identity hierarchy and the security proof of the revocable scheme is very complex. In our scheme, cryptographic accumulators are used to compress hierarchical levels and revoked users’ information into constant values. So we achieve almost constant size of private key update which is irrelevant with the user number in the system. Because of the compression of hierarchical information we can use simple dual system encryption techniques to prove our scheme to be fully secure under several common assumptions without resorting to complex nested dual system encryption techniques.

One of the interesting secure applications in the smart city is broadcasting information to legitimate users, desirably with user privacy. Broadcast encryption has been considered as a useful tool to protect the data security and provide data access control. Most works in broadcast encryption are about the data security, while less attention is paid to the data access control and the identity privacy. In this paper, based on broadcast encryption, we present a scheme called Fully Privacy-Preserving and Revocable Identity-Based Broadcast Encryption, which preserves the data privacy and the identity privacy of the receiver as well as the revoked user. The data can be securely protected and only the authorized user can access the data. The revocation process does not reveal any information about the data contents and the receiver identity. The public learns nothing about the receiver identity and the revoked user identity. These properties lead to nice applications in the smart city where identity privacy is desirable. The security of our scheme is proved to be semantically secure in the random oracle model.

More and more sensitive information is transmitted and stored in computer networks. Security has become a critical issue. As traditional cryptographic systems are now vulnerable to attacks, DNA based cryptography has been identified as a promising technology because of the vast parallelism and extraordinary information density. While a body of research has proposed the DNA based encryption algorithm, no research has provided solutions to distribute complex and long secure keys. This paper introduces a Hamming code and a block cipher mechanism to ensure secure transmission of a secure key. The research overcomes the limitation on the length of the secure key represented by DNA strands. Therefore it proves that real biological DNA strands are useful for encryption computing. To evaluate our method, we apply the block cipher mechanism to optimize a DNA-based implementation of a conventional symmetric encryption algorithm, described as “yet another encryption algorithm”. Moreover, a maximum length matching algorithm is developed to provide immunity against frequency attacks.

Multimedia is currently seen to dominate the internet network and the mobile network traffic; hence, it is seen as the largest Big data. Generally, the symmetric encryption algorithms are applied to the ‘big multimedia data’; however; these algorithms are thought as very slow. In our study, we developed and designed a resource-efficient encryption algorithm system which applies the multithreaded programming process for the encryption of the big multimedia data. This proposed system describes a multi-level encryption model which uses the Feistel Encryption Scheme, genetic algorithms and the Advanced Encryption Standard (AES). Our system has been assessed for actual medical-based big multimedia data and compared to the benchmarked encryption algorithms like the RC6, MARS, 3-DES, DES, and Blowfish with regards to the computational run time and its throughput for the encryption and decryption procedures. In addition, the multithreaded programming approach is adopted to implement the proposed encryption system in order to enhace the system effeciencey and porfermance. Furthermore, we also compared our system with its sequential version for showing its resource efficiency. Our results indicated that our system had the least run time and a higher throughput for the encryption and decryption processes in comparison to the already existing standard encryption algorithms. Also, our system could improve the computation run time by approximately 75% and its throughput was also increased by 4-times in comparison to its sequential version. For fulfilling the security objectives, our algorithm showed a better Avalanche Effect in comparison to the existing algorithms and therefore, could be included in any encryption/decryption process of a big plain multimedia data.

At FOCS2011 Brakerski and Vaikuntanathan proposed a single-server LWE-based private information retrieval (abbreviated as PIR) protocol with a security reduction to hard standard lattice problems and nearly optimal communication complexity. However, Brakerski just described a generic PIR protocol that utilized a somewhat homomorphic encryption and an arbitrary symmetric encryption as building blocks, he did not instantiate the generic construction. In this work, we first modify Brakerski's construction without the evaluating key and construct a new PIR model. Moreover, we instantiate our new model via matrix FHE first proposed by Ryo et al. at PKC2015 and vector symmetric encryption scheme proposed in this work as building block. Then we optimize the Response operations and several other aspects of the scheme.

In modern day technology, the Information Society is at risk. Passwords are a multi-user computer systems usual first line of defence against intrusion. A password may be textual with any combination of alphanumeric characters or biometric or 3-D. But no authentication protocol is fully secured against todays hackers as all of them are Static in type. Dynamic authentication protocol is still a theoretical concept. In this paper, we are focusing on a concept of authentication technique which is actually dynamic in genre, i.e. the password here will change in t time (where t is as small as possible). This technique comprises of both hardware and software part. In this paper, we have covered the idea of generating an efficient algorithm that can work as the final in the Dynamic Password Authentication system. We have used standard deviation within statistics to generalize the possible password which is further secured by Feistel Block Cipher and Advanced Encryption Standard technique (AES), leading and following the said mathematics respectively. In order to allow the system to create variable password in the least time interval possible, we must make sure our process is not much complex.

Newly applies transparent and reduced encryption to scalable video.Introduces two ways to lower encryption latency in the context of scalable video.Maintains decoder compatibility and adds no bitrate overhead after encryption.Analyses overall distortion from transparent encryption, with clear base layer.Application is protection of rapidly available streaming of short-lived material. Selective encryption masks all of the content without completely hiding it, as full encryption would do at a cost in encryption delay and increased bandwidth. Many commercial applications of video encryption do not even require selective encryption, because greater utility can be gained from transparent encryption, i.e. allowing prospective viewers to glimpse a reduced quality version of the content as a taster. Our lightweight selective encryption scheme when applied to scalable video coding is well suited to transparent encryption. The paper illustrates the gains in reducing delay and increased distortion arising from a transparent encryption that leaves reduced quality base layer in the clear. Reduced encryption of B-frames is a further step beyond transparent encryption in which the computational overhead reduction is traded against content security and limited distortion. This spectrum of video encryption possibilities is analyzed in this paper, though all of the schemes maintain decoder compatibility and add no bitrate overhead as a result of jointly encoding and encrypting the input video by virtue of carefully selecting the entropy coding parameters that are encrypted. The schemes are suitable both for H.264 and HEVC codecs, though demonstrated in the paper for H.264. Selected Content Adaptive Binary Arithmetic Coding (CABAC) parameters are encrypted by a lightweight Exclusive OR technique, which is chosen for practicality.

Cloud computing is used to share computing resources and data over internet. When sensitive data is shared over Internet, it should be transferred in secured manner. Data security is ensured using Identity Based Encryption mechanism. In the existing Cloud Computing system which is implemented using Identity Based Encryption mechanism, authorized user can share their credential to unauthorized user and data can be accessed by unauthorized user who hasn’t subscribed to Cloud Computing System. To overcome this issue, we propose a notion called Extended Identity Based Encryption(E-IBE) system, which ensures authentication and confidentiality. In this approach, we use Kerberos authentication protocol along with Identity Based Encryption methodology to ensure authentication and confidentiality.

The secure storage of the sensitive data in mobile devices is an urgent issue. Most of the existed encryption algorithms are location independent, which means the encrypted data can be decrypted anywhere. In this work, we propose a novel location-based encryption model using a fuzzy vault scheme. First, we may choose a proper encryption algorithm, a symmetric algorithm or an asymmetric encryption algorithm, to encrypt the sensitive data in mobile devices. Then, the crucial issue comes to securely storing the secret key in the encryption algorithm, and it will be solved in the secret key protection phase by applying a fuzzy vault scheme using a location-based digital fingerprint, which represents the valid user in the valid location region. We bind the digital fingerprint and the secret key together to construct a fuzzy vault for storing the both securely. We simulate our model on an Android device and make some performance and security analysis on it. The main contribution of our model is applying a fuzzy vault scheme which uses the location information captured by the user’s mobile devices to securely protect the secret key used in the cryptosystem for encrypting the users sensitive data on the user’s mobile devices.

Cloud computing is one of the great tasks in the business world nowadays, which provides shared processing resources. In cloud area network, security is the main challenge faced by cloud providers and their customers. The advantage of cloud computing includes reduced cost, re-provisioning of resources etc. The cloud network makes use of standard encryption method to secure documents while storing in online. In this paper, we have depicted two efficient encryption algorithms that meet security demand in cloud. Probabilistic encryption, one of these algorithms may be used to produce randomness of text encryption. With this algorithm, if the same message is encrypted twice it should yield different secret coded texts on both calculations. Another crucial algorithm is homomorphic encryption, is a cryptographic method to define the sample system and to provide a software implementation. In order to maintain quality of service (QoS) and improve customer satisfaction, we are going to propose an efficient algorithm which combines the characteristics of both probabilistic and homomorphic encryption techniques, to provide high level of security. Our proposed scheme will yield better encryption techniques reduce security attacks, increased throughput and improve the QoS.

Data and network security is one among the foremost necessary factors in today’s business world. In recent, businesses and firms like financial institutions, law firms, schools, health sectors, telecommunications, mining and a number of government agencies want a strategic security technique of managing its data. Organizations managing bigger monetary information, bio-data and alternative relevant info are losing its valuable information or data at rest, in usage or in motion to unauthorized parties or competitors as a result of activities of hackers. Organizations are losing millions of dollars as a result of unprotected data that gets into the hands of malicious persons. Data protection in an organization has become vital in today’s business. In order to possess secure information, this information should be protected in order that although malicious persons get access to the info, it becomes wealthless and useless to them. Advanced Encryption Standard (AES), could be a scientific discipline rule that may be used for secured data and communication in an organization, it uses same key that's isobilateral key for transmission additionally as reception. The AES rule is capable of using cryptographic keys of 128, 192, and 256 bits, this paper implement AES block cipher of 256-bits and 256-bit key size, developed with C# as a front-end client machine and MS SQL used for the database as a back-end machine.

We give a new black-box transformation from any semantically secure encryption scheme into a non-malleable one which has a better rate than the best previous work of Coretti et al. (in: Kushilevitz and Malkin (eds) TCC 2016-A, Part I, Springer, Heidelberg, 2016). We achieve a better rate by departing from the "matrix encoding" methodology used by previous constructions, and working directly with a single codeword. We also use a Shamir secret-share packing technique to improve the rate of the underlying error-correcting code.

Automatic Dependent Surveillance-Broadcast (ADS-B) is one of the key technologies for future “e-Enabled” aircrafts. ADS-B uses avionics in the e-Enabled aircrafts to broadcast essential flight data such as call sign, altitude, heading, and other extra positioning information. On the one hand, ADS-B brings significant benefits to the aviation industry, but, on the other hand, it could pose security concerns as channels between ground controllers and aircrafts for the ADS-B communication are not secured, and ADS-B messages could be captured by random individuals who own ADS-B receivers. In certain situations, ADS-B messages contain sensitive information, particularly when communications occur among mission-critical civil airplanes. These messages need to be protected from any interruption and eavesdropping. The challenge here is to construct an encryption scheme that is fast enough for very frequent encryption and that is flexible enough for effective key management. In this paper, we propose a Staged Identity-Based Encryption (SIBE) scheme, which modifies Boneh and Franklin's original IBE scheme to address those challenges, that is, to construct an efficient and functional encryption scheme for ADS-B system. Based on the proposed SIBE scheme, we provide a confidentiality framework for future e-Enabled aircraft with ADS-B capability.

With increasing dependence on communications over internet and networks, secure data transmission is coming under threat. One of the best solutions to ensure secure data transmissions is encryption. Multiple forms of data, such as text, audio, image, and video can be digitally transmitted, nowadays images being the most popular and old encryption techniques such as: AES,DES,RSA etc., show low security level when used for image encryption. This problem was resolved by using of chaos encryption which is an acceptable form of encryption for image data. The sensitivity to initial conditions and control parameters make chaos encryption suitable for image applications. This study discusses various chaos encryption techniques.

Revocation and key evolving paradigms are central issues in cryptography, and in PKI in particular. A novel concern related to these areas was raised in the recent work of Sahai, Seyalioglu, and Waters (CRYPTO 2012) who noticed that revoking past keys should at times (e.g., the scenario of cloud storage) be accompanied by revocation of past ciphertexts (to prevent unread ciphertexts from being read by revoked users). They introduced revocable-storage attribute-based encryption (RS-ABE) as a good access control mechanism for cloud storage. RS-ABE protects against the revoked users not only the future data by supporting key-revocation but also the past data by supporting ciphertext-update, through which a ciphertext at time T can be updated to a new ciphertext at time T + 1 using only the public key. Motivated by this pioneering work, we ask whether it is possible to have a modular approach, which includes a primitive for time managed ciphertext update as a primitive. We call encryption which supports this primitive a "self-updatable encryption" (SUE). We then suggest a modular cryptosystems design methodology based on three sub-components: a primary encryption scheme, a key-revocation mechanism, and a time-evolution mechanism which controls the ciphertext self-updating via an SUE method, coordinated with the revocation (when needed). Our goal in this is to allow the self-updating ciphertext component to take part in the design of new and improved cryptosystems and protocols in a flexible fashion. Specifically, we achieve the following results:We first introduce a new cryptographic primitive called self-updatable encryption (SUE), realizing a time-evolution mechanism. In SUE, a ciphertext and a private key are associated with time. A user can decrypt a ciphertext if its time is earlier than that of his private key. Additionally, anyone (e.g., a cloud server) can update the ciphertext to a ciphertext with a newer time. We also construct an SUE scheme and prove its full security under static assumptions. Following our modular approach, we present a new RS-ABE scheme with shorter ciphertexts than that of Sahai et al. and prove its security. The length efficiency is mainly due to our SUE scheme and the underlying modularity. We apply our approach to predicate encryption (PE) supporting attribute-hiding property, and obtain a revocable-storage PE (RS-PE) scheme that is selectively-secure. We further demonstrate that SUE is of independent interest, by showing it can be used for timed-release encryption (and its applications), and for augmenting key-insulated encryption with forward-secure storage. A new cryptographic primitive called self-updatable encryption is introduced to realize a time-evolution mechanism.A revocable-storage attribute-based encryption scheme with shorter ciphertexts was proposed by following our modular approach.A revocable-storage predicate encryption scheme that additionally supports attribute-hiding property is presented.