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 Oct 2014-Optik
TL;DR: Wang et al. as discussed by the authors cryptanalyzed the image encryption scheme using chosen plaintext attack, and pointed out that even if possessing good pseudorandom cipher code generation method, the encryption system is still insecure with unreasonable designed encryption scheme.

9 citations

Patent
31 Jan 2006
TL;DR: A symmetric cryptosystem uses cascaded chaotic maps to encrypt plaintext and decrypt ciphertext as mentioned in this paper, which can then be decrypted using the same chaotic maps in order to retrieve the plaintext.
Abstract: A symmetric cryptosystem uses cascaded chaotic maps to encrypt plaintext and decrypt ciphertext. Received plaintext is encrypted using the cascaded chaotic maps to generate a ciphertext. The ciphertext can then be decrypted using the same cascaded chaotic maps in order to retrieve the plaintext.

9 citations

Book ChapterDOI
11 Nov 2018
TL;DR: In this article, the feasibility of achieving simulation security in functional encryption (FE) in the random oracle model was studied. And the main result is negative in that it is impossible to achieve simulation security even with the aid of random oracles.
Abstract: In this work we study the feasibility of achieving simulation security in functional encryption (FE) in the random oracle model. Our main result is negative in that we give a functionality for which it is impossible to achieve simulation security even with the aid of random oracles.

9 citations

Proceedings ArticleDOI
01 Oct 2016
TL;DR: The concept, categories and construction methods of Homomorphic encryption are clarified by sailing in its complicated algorithms from the starting spark of algebraically homomorphic encryption to the approach of constructing fully homomorph encryption from SomeWhat homomorphicryption.
Abstract: Homomorphic encryption is the cryptosystem which allows computations on encrypted data achieving the goal of protecting the privacy of data during communication and storage process. For decades' Homomorphic encryption is the Holy Grail of cryptography, nonetheless constructing algorithms and implementing methods of homomorphic encryption schemes are sophisticated. This paper clarifies the concept, categories and construction methods of Homomorphic encryption by sailing in its complicated algorithms from the starting spark of algebraically homomorphic encryption to the approach of constructing fully homomorphic encryption from SomeWhat homomorphic encryption.

9 citations

Proceedings ArticleDOI
01 Dec 2014
TL;DR: In this article, the authors present an analytical study on the implementation of NTRU encryption scheme which serves as a guideline for security practitioners who are novice to lattice-based cryptography or even cryptography.
Abstract: Nth-Dimensional Truncated Polynomial Ring (NTRU) is a lattice-based public-key cryptosystem that offers encryption and digital signature solutions. It was designed by Silverman, Hoffstein and Pipher. The NTRU cryptosystem was patented by NTRU Cryptosystems Inc. (which was later acquired by Security Innovations) and available as IEEE 1363.1 and X9.98 standards. NTRU is resistant to attacks based on Quantum computing, to which the standard RSA and ECC public-key cryptosystems are vulnerable to. In addition, NTRU has higher performance advantages over these cryptosystems. Considering this importance of NTRU, it is highly recommended to adopt NTRU as part of a cipher suite along with widely used cryptosystems for internet security protocols and applications. In this paper, we present our analytical study on the implementation of NTRU encryption scheme which serves as a guideline for security practitioners who are novice to lattice-based cryptography or even cryptography. In particular, we show some non-trivial issues that should be considered towards a secure and efficient NTRU implementation.

9 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