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
Proceedings ArticleDOI
01 Sep 2015
TL;DR: A brief description of proposed framework is defined which uses the random combination of public and private keys and includes Integrity, Availability, Authentication, Nonrepudiation, Confidentiality and Access control which is achieved by private-private key model.
Abstract: The paper will describe various types of security issues which include confidentality, integrity and availability of data. There exists various threats to security issues traffic analysis, snooping, spoofing, denial of service attack etc. The asymmetric key encryption techniques may provide a higher level of security but compared to the symmetric key encryption Although we have existing techniques symmetric and assymetric key cryptography methods but there exists security concerns. A brief description of proposed framework is defined which uses the random combination of public and private keys. The mechanisms includes: Integrity, Availability, Authentication, Nonrepudiation, Confidentiality and Access control which is achieved by private-private key model as the user is restricted both at sender and reciever end which is restricted in other models. A review of all these systems is described in this paper.

10 citations

Journal ArticleDOI
TL;DR: A new secure cryptosystem based on the BB equation and chaos is proposed for image encryption and decryption and the efficacy of the proposed cryptos system is illustrated through implementation results on two images.
Abstract: Illegal data access has become prevalent in wireless and general communication networks. Recently, the use of chaotic signals for secure data transmission has shown significant growth in developing chaotic encryption and decryption algorithms. The application of the Brahmagupta–Bhaskara (BB) equation for encryption is reported in a very recent article. However, a number of chaos-based algorithms are proved to be insecure in the literature. It is also shown in the literature that the BB equation based algorithm can be broken by a low complexity known plaintext attack. Hence, in this paper, a new secure cryptosystem based on the BB equation and chaos is proposed for image encryption and decryption. Cryptanalysis of the proposed cryptosystem is also provided. The efficacy of the proposed cryptosystem is illustrated through implementation results on two images.

10 citations

Proceedings ArticleDOI
18 Mar 2008
TL;DR: A concrete stateful IBE scheme is demonstrated, whose security meets the strongest definition in the setting in random oracle model, and whose encryption and decryption are very efficient, compared to existing IBEs.
Abstract: In this paper, we first present the notion of stateful identity-based encryption (IBE) and then extend standard security definitions for IBE to the stateful setting. After that, we demonstrate a concrete stateful IBE scheme, whose security meets the strongest definition in the setting in random oracle model, and whose encryption and decryption are very efficient, compared to existing IBEs: one pairing each for encryption and decryption.

10 citations

Proceedings ArticleDOI
28 Dec 2009
TL;DR: For implementing the data safe transmission in Internet, a safe transmission mechanism which base on RSA and triple DES algorithm is put forward, which realizes the confidentiality, completeness, authentication and non- repudiation.
Abstract: For implementing the data safe transmission in Internet, a safe transmission mechanism which base on RSA and triple DES algorithm is put forward. The mechanism makes full use of advantage of DES and RSA. Because encryption speed of triple DES algorithm is faster than RSA algorithm for long plaintext, and RSA algorithm distribute key safely and easily. Date encryption security of triple DES algorithm is far higher than DES algorithm. Digital abstract algorithm MD5 is adopted in this mechanism. Through comparing the digital signature which is transmitted by dispatcher and digital signature result of plaintext which is got by receiver through MD5 algorithm, data security can be guaranteed. This mechanism realizes the confidentiality, completeness, authentication and non- repudiation. It is an effective method to resolve the problem of safe transmission in Internet.

10 citations

Posted Content
TL;DR: It is concluded that Micciancio's cryptosystem can be securely used only in lattice dimensions ≥ 782 and that it requires key sizes of 1MByte and more and that the key generation as well as the decryption take inacceptibly long.
Abstract: We report experiments on the security of the GGH-like cryptosystem proposed by Micciancio Based on these experiments, we conclude that the system can be securely used only in lattice dimensions ≥ 782 Further experiments on the efficiency of the system show that it requires key sizes of 1MByte and more and that the key generation as well as the decryption take inacceptibly long Therefore, Micciancio’s cryptosystem seems currently far from being practical

10 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