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
01 Jan 2009
TL;DR: A Cryptosystem which is complete for the class of probabilistic public-key cryptosystems with bounded error, which contains also Ajtai-Dwork and NTRU cryptosSystems.
Abstract: We present a cryptosystem which is complete for the class of probabilistic public-key cryp- tosystems with bounded error. Besides traditional encryption schemes such as RSA and El Gamal, this class contains probabilistic encryption of Goldwasser-Micali as well as Ajtai-Dwork and NTRU cryptosystems. The latter two are known to make errors with some small positive probability. To our best knowledge, no complete public-key cryptosystem has been known before, whether encryp- tion/decryption errors are allowed or not. At the same time, other complete primitives such as Levin's universal one-way function (1) have been known for a long time.

17 citations

Proceedings ArticleDOI
03 Nov 2011
TL;DR: It is shown that the proposed algorithm is capable of encrypting images eight times faster than AES, and compares with results obtained from Advanced Encryption Standard.
Abstract: In this paper we propose a cryptographic transformation based on matrix manipulations for image encryption. Substitution and diffusion operations, based on the matrix, facilitate fast conversion of plaintext and images into ciphertext and cipher images. The paper describes the encryption algorithm, discusses the simulation results and compares with results obtained from Advanced Encryption Standard (AES). It is shown that the proposed algorithm is capable of encrypting images eight times faster than AES.

17 citations

Book ChapterDOI
19 Mar 2012
TL;DR: It is proved that there is no black-box construction of a threshold predicate encryption system from identity-based encryption, marking nontrivial progress in a line of research suggested by Boneh, Sahai and Waters (TCC '11), where they proposed a study of the relative power of predicate encryption for different functionalities.
Abstract: We prove that there is no black-box construction of a threshold predicate encryption system from identity-based encryption. Our result signifies nontrivial progress in a line of research suggested by Boneh, Sahai and Waters (TCC '11), where they proposed a study of the relative power of predicate encryption for different functionalities. We rely on and extend the techniques of Boneh et al. (FOCS '08), where they give a black-box separation of identity-based encryption from trapdoor permutations. In contrast to previous results where only trapdoor permutations were used, our starting point is a more powerful primitive, namely identity-based encryption, which allows planting exponentially many trapdoors in the public-key by only planting a single master public-key of an identity-based encryption system. This makes the combinatorial aspect of our black-box separation result much more challenging. Our work gives the first impossibility result on black-box constructions of any cryptographic primitive from identity-based encryption. We also study the more general question of constructing predicate encryption for a complexity class F, given predicate encryption for a (potentially less powerful) complexity class G. Toward that end, we rule out certain natural black-box constructions of predicate encryption for NC1 from predicate encryption for AC0 assuming a widely believed conjecture in communication complexity.

17 citations

Journal ArticleDOI
TL;DR: A selective encryption method named Selective significant data encryption (SSDE) for text data encryption, which provides sufficient uncertainty to the data encryption process as it selects only significant data out of the whole message, which reduces the encryption time overhead and enhances the performance.

17 citations

Journal ArticleDOI
TL;DR: QR code is introduced to resist the noise which contaminates the retrievals of normal optical cryptosystems and is supposed to against existing attacks.
Abstract: A novel secure and noise-free nonlinear optical cryptosystem based on phase-truncated Fresnel diffraction (PTFD) and QR code is proposed. In this paper, we introduce QR code to resist the noise which contaminates the retrievals of normal optical cryptosystems. The plaintext is transformed into a QR code and then the code is encrypted into a real-valued noise-like ciphertext by employing the PTFD-based cryptosystem. The two private encryption keys (EKs) are generated by the PTFD of a random amplitude mask with the two public keys. In the process of generating the EKs, just the amplitude in the Fresnel and output planes need to be recorded. There are no iterative calculations in the whole encryption and decryption process. Moreover, owing to the nonlinear operation of PTFD and the two generated private EKs, the proposed scheme is supposed to against existing attacks. Numerical simulations are carried out to demonstrate the validity and security of the proposed cryptosystem.

17 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