scispace - formally typeset
Search or ask a question
Topic

Plaintext-aware encryption

About: Plaintext-aware encryption is a research topic. Over the lifetime, 1980 publications have been published within this topic receiving 101775 citations. The topic is also known as: Plaintext awareness.


Papers
More filters
Journal ArticleDOI
TL;DR: This paper introduces a new family of lattices, namely QC-MDPC lattices which are a special case of LDPC lattice, and an improved bit flipping algorithm for decoding of these lattices and shows that the cryptosystem is resistant against all known attacks both on lattice-based and code-based cryptosSystems for different levels of security.
Abstract: In this paper, we introduce a new family of lattices, namely QC-MDPC lattices, which are a special case of LDPC lattices, and an improved bit flipping algorithm for decoding of these lattices. Encoding and decoding implementations of QC-MDPC lattices are practical in high dimensions. Indeed, to take advantage of practical decoding, we use “Construction-A” lattices which makes a tight connection between the structure of lattices and codes. Using these features, we design a lattice-based public key encryption scheme enjoying linear encryption and decryption complexities. The proposed scheme has a reasonable key size due to the sparseness of the parity-check matrix, and the quasi-cyclic structure of the parity-check and generator matrices. Besides, the message expansion of the proposed scheme is smaller than other lattice-based and code-based cryptosystems with comparative parameters. All these features provide a lattice-based public key encryption scheme with reasonable key size, linear encryption, and decryption algorithms and small message expansion. On the other hand, we show that the cryptosystem is resistant against all known attacks both on lattice-based and code-based cryptosystems for different levels of security.

13 citations

Proceedings ArticleDOI
04 Aug 2016
TL;DR: A new chaotic, permutation-substitution architecture based, image encryption algorithm is introduced in this paper and it is demonstrated that the proposed images' encryption algorithm has a desirable level of security.
Abstract: A new chaotic, permutation-substitution architecture based, image encryption algorithm is introduced in this paper. In order to reduce redundancies of Fridrich's structure based image encryption scheme, a novel inter-intra bit-level permutation based confusion strategy is appealed. By means of the proposed confusion stage, statistical properties of the image produced at its output are enhanced (that is, the bit distribution of each bit plane is more uniform and correlation between neighboring higher bit planes is reduced). Also, the proposed image cryptosystem takes advantage of Sudoku grids as to ensure a high performance diffusion process and a higher key space as well. Based on the theoretical arguments and the Matlab implementation, the conducted study demonstrates that the proposed images' encryption algorithm has a desirable level of security.

12 citations

Journal ArticleDOI
TL;DR: This paper proposes a variant of the McEliece scheme that is non-malleable under the adaptive chosen ciphertext attack and also proposes some secure and efficient variants of theMceliece scheme in order to improve the information rate.
Abstract: Berson pointed out that the McEliece public-key cryptosystem suffers from two weaknesses: (1) failure to protect any message which is encrypted more than once; and (2) failure to protect any messages which have a known linear relationship with one another. In this paper, we propose some variants of the McEliece scheme to prevent Berson's attacks. In addition, we also propose some secure and efficient variants of the McEliece scheme in order to improve the information rate. On the other hand, designing a public-key cryptosystem which is theoretically secure has become more and more important since the introduction of notions of public-key encryption security by Bellare, Desai, Pointcheval, and Rogaway. In this paper, we also propose a variant of the McEliece scheme that is non-malleable under the adaptive chosen ciphertext attack.

12 citations

Proceedings ArticleDOI
01 Dec 2014
TL;DR: The main idea is to divide the encryption into two phases, offline preprocessing phase which is done when the device is otherwise not in use and an online phase when the data is actually encrypted with the policy, which makes encryption faster and more efficient than existing decentralized ABE schemes.
Abstract: Fine grained access control is a requirement for data stored in untrusted servers like clouds. Owing to the large volume of data, decentralized key management schemes are preferred over centralized ones. Often encryption and decryption are quite expensive and not practical when users access data from resource constrained devices. We propose a decentralized attribute based encryption (ABE) scheme with fast encryption and outsourced decryption. The main idea is to divide the encryption into two phases, offline preprocessing phase which is done when the device is otherwise not in use and an online phase when the data is actually encrypted with the policy. This makes encryption faster and more efficient than existing decentralized ABE schemes. For decryption outsourcing, data users need to generate a transformed version of the decryption key allowing an untrusted proxy server to partially decrypt the ciphertext without gaining any information about the plaintext. Data users can then fully decrypt the partially decrypted ciphertext without performing any costly pairing operations. Comparison with other CP-ABE schemes shows that our scheme significantly reduces computation times for both data owners and data users.

12 citations

Proceedings Article
16 Sep 2010
TL;DR: This work makes use of a notion of new cryptographic primitive, identity-based hash proof system, to construct a leakage-resilient IB-HPS based on a simple assumption and proves its security by the variant of dual system encryption.
Abstract: We present an identity-based encryption in the relative-leakage model. In our construction, we firstly make use of a notion of new cryptographic primitive, identity-based hash proof system(IB-HPS), to construct a leakage-resilient IB-HPS based on a simple assumption and also prove its security by the variant of dual system encryption. Then, based on our IB-HPS scheme, we construct directly an efficient leakage-resilient identity-based encryption(IBE) scheme in the model.

12 citations


Network Information
Related Topics (5)
Encryption
98.3K papers, 1.4M citations
90% related
Cryptography
37.3K papers, 854.5K citations
89% related
Public-key cryptography
27.2K papers, 547.7K citations
88% related
Hash function
31.5K papers, 538.5K citations
87% related
Key (cryptography)
60.1K papers, 659.3K citations
86% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202318
202230
20211
20202
20194
201822