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 published on a yearly basis
Papers
More filters
IBM1
TL;DR: A simpler construction of a publickey encryption scheme that achieves adaptive chosen ciphertext security (CCA2), assuming the existence of trapdoor permutations is presented, which is believed to be the easiest to understand to date.
Abstract: In this paper we present a simpler construction of a publickey encryption scheme that achieves adaptive chosen ciphertext security (CCA2), assuming the existence of trapdoor permutations. We build on previous works of Sahai and De Santis et al. and construct a scheme that we believe is the easiest to understand to date. In particular, it is only slightly more involved than the Naor-Yung encryption scheme that is secure against passive chosen-ciphertext attacks (CCA1). We stress that the focus of this paper is on simplicity only.
48 citations
TL;DR: This paper presents an efficient certificate-based encryption scheme which is fully secure in the standard model and more efficient (in terms of computational cost and ciphertext size) than any of the previous constructions known without random oracles.
48 citations
TL;DR: This work presents new ciphertext policy attribute based encryption with fast keyword search constructions, which preserve the fine-grained access control inherited from the ABE system while supporting hidden policy and fast keywords search.
Abstract: ABKS has drawn much attention from research and industry in recent years, an ABKS scheme is an encryption scheme that supports keyword search and access control. Attribute-Based Encryption is a public key encryption that enables users to encrypt and decrypt message based on attributes. In a typical implementation, the size of the ciphertext is proportional to the number of attributes associated with it and the decryption time is proportional to the number of attributes used during decryption. Inherit from ABE technology, the computation cost and ciphertext size in most ABKS schemes grow with the complexity of the access policy. On the other hand, we found that the traditional ABKS schemes cannot resist our secret-key-recovery attack. To deal with the above problems, we present new ciphertext policy attribute based encryption with fast keyword search constructions. Our constructions preserve the fine-grained access control inherited from the ABE system while supporting hidden policy and fast keyword search. Our constructions feature multi-value-independent compared with the existing attribute based searchable encryption schemes. The performance analysis demonstrates the efficiency of our constructions. We offer rigorous security proof of our second scheme, which is IND-CKA and IND-CPA secure.
48 citations
TL;DR: A new scheme for joint compression and encryption using the Huffman codec where a basic tree is first generated for a given message and then based on a keystream generated from a chaotic map and depending from the input message, thebasic tree is mutated without changing the statistical model.
48 citations
TL;DR: This paper proposes the first identity based broadcast encryption (IBBE) scheme that is IND-ID-CCA2 secure without random oracles, and is collusion resistant for arbitrarily large collusion of users.
47 citations