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: A chosen plaintext attack requiring only two plaintexts is proposed and an improved version of this attack that narrows the key space need to be searched is also suggested.
Abstract: An encryption system with discretized skew tent map has been proposed recently by N. Masuda . However, there is a fundamental weakness with this chaotic cryptographic scheme. In this paper, a chosen plaintext attack requiring only two plaintexts is proposed. An improved version of this attack that narrows the key space need to be searched is also suggested. The test results demonstrate that this encryption cryptosystem is easily broken under the proposed chosen plaintext attack.

17 citations

Proceedings ArticleDOI
23 May 2005
TL;DR: The proposed scalable encryption method makes the encrypted images have multi-level encryption and reduces the computational complexity of encryption, since different encryption algorithms can be simultaneously used in its procedure.
Abstract: A new method for encryption of JPEG2000 images, which is referred to as 'scalable encryption', is proposed in this paper. The scalable encryption method makes the encrypted images have multi-level encryption and reduces the computational complexity of encryption, since different encryption algorithms can be simultaneously used in its procedure. Moreover, the encrypted images produced by the proposed method have complete compliance with JPEG2000, so that a standard JPEG2000 decoder can decode the encrypted images and the useful functionalities of the JPEG2000 codestream are preserved after the encryption. For example, the proposed method enables that content holders have no need of preparing two or more encrypted images for various users who are provided different access rights. In addition to this, the time for the encryption can be controlled by selection of adequate encryption algorithms for faster processing.

16 citations

Book ChapterDOI
06 Mar 2016
TL;DR: Wang et al. as discussed by the authors proposed an identity-based hierarchical key-insulated encryption hierarchical IKE scheme without random oracles, which is secure under the symmetric external Diffie-Hellman SXDH assumption.
Abstract: Key-insulated encryption is one of the effective solutions to a key exposure problem. Recently, identity-based encryption IBE has been used as one of fundamental cryptographic primitives in a wide range of various applications, and it is considered that the identity-based key-insulated security has a huge influence on the resulting applications. At Asiacrypt'05, Hanaoka et al. proposed an identity-based hierarchical key-insulated encryption hierarchical IKE scheme. Although their scheme is secure in the random oracle model, it has a "hierarchical key-updating structure," which is attractive functionality that enhances key exposure resistance. In this paper, we first propose the hierarchical IKE scheme without random oracles. Our hierarchical IKE scheme is secure under the symmetric external Diffie---Hellman SXDH assumption, which is known as the simple and static one. Furthermore, when the hierarchy depth is one i.e. not hierarchical case, our scheme is the first IKE scheme that achieves constant-size parameters including public parameters, secret keys, and ciphertexts.

16 citations

Book ChapterDOI
15 Oct 2014
TL;DR: A security model and an efficient construction of this new notion of attribute-based encryption called Group-Oriented Attribute-Based Encryption are given, with rigorous security and efficiency analysis.
Abstract: We introduce a new variant of attribute-based encryption called Group-Oriented Attribute-Based Encryption (GO-ABE for short). In a GO-ABE scheme, each user belongs to a specific group. Users from the same group can pool their attributes and private keys to “match” the decryption policy. That is, if the union of their attributes matches the policy, they can cooperate together to decrypt the ciphertext. But users from different groups cannot make it. We give a security model and an efficient construction of this new notion, with rigorous security and efficiency analysis.

16 citations

Book ChapterDOI
12 Oct 2014
TL;DR: It is proved that, for a KEM/Tag-DEM hybrid encryption scheme, if the adaptive chosen ciphertext secure KEM part has the properties of key malleability and key fingerprint and the Tag-DEM part is a one-time secure tag authenticated encryption, then the hybrid encryption is seucure against related key attacks (RKA).
Abstract: We prove that, for a KEM/Tag-DEM (Key Encapsulation Mechanism/ Tag Data Encapsulation Mechanism) hybrid encryption scheme, if the adaptive chosen ciphertext secure KEM part has the properties of key malleability and key fingerprint and the Tag-DEM part is a one-time secure tag authenticated encryption, then the hybrid encryption is seucure against related key attacks (RKA). We show that several classical KEM schemes satisfy these two properties.

16 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