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
26 Nov 2016
TL;DR: This paper proposes an efficient CP-ABE construction with hidden policy and proves it to be fully secure under static assumptions applying the dual system encryption methodology.
Abstract: In ciphertext policy attribute-based encryption scheme, access policies are associated with ciphertext and tied to it. It is necessary to hide the access policy in the most sensitive spots such as political, medical and economic fields, that is, receiver's anonymity. In this paper, we propose an efficient CP-ABE construction with hidden policy and prove it to be fully secure under static assumptions applying the dual system encryption methodology. Access structures in our construction are AND gates on positive, negative and wildcard attributes and the ciphertext size is short, which is only concerned with the number of wildcards.

17 citations

Journal ArticleDOI
TL;DR: A binary-tree encryption strategy for multiple images is proposed to resist the attacks in this case and can not only increase the security of multiple-image encryption, but also realize an authority management with high security among the users sharing a cipher image.
Abstract: In traditional optical multiple-image encryption schemes, different images typically have almost the same encryption or decryption process. Provided that an attacker manages to correctly decrypt some image, the conventional attacks upon other images are much easier to be made. In this paper, a binary-tree encryption strategy for multiple images is proposed to resist the attacks in this case. The encryption schemes produced by this strategy can not only increase the security of multiple-image encryption, but also realize an authority management with high security among the users sharing a cipher image. For a simulation test, we devise a basic binary-tree encryption scheme, whose encryption nodes are based on an asymmetric double random phase encoding in the gyrator domain. The favorable simulation results about the tested scheme can testify to the feasibility of the strategy.

17 citations

Book ChapterDOI
01 Jan 2011
TL;DR: This chapter gives an overview and the state of the art in the field of Chaos-based cryptography, which is closer to the spirit of both cryptography and chaos theory than the way the subject has been treated recently by many researchers.
Abstract: In this chapter we give an overview and the state of the art in the field of Chaos-based cryptography. The public key cryptosystems based on Chebyshev polynomials enjoy some nice chaotic properties, which makes them suitable for use in both encryption and digital signature. The cryptosystem can work either on real or integer numbers. The cryptosystem that works on real numbers is not secure and permits to recover the corresponding plaintext from a given ciphertext. In addition, it also allows forgeries if the cryptosystem is used for signing messages. On the other hand, ElGamal-like and RSA-like algorithms when using Chebyshev polynomials on integer numbers are secure as the aforementioned encryption algorithms. The chaos-based cryptography is discussed from a point of view which we believe is closer to the spirit of both cryptography and chaos theory than the way the subject has been treated recently by many researchers.

17 citations

Posted Content
TL;DR: This work proposes a method in which the access policy need not be sent along with the ciphertext, by which the privacy of the encryptor is preserved, and is provably secure under Decision Bilinear Diffe-Hellman assumption.
Abstract: In Ciphertext Policy Attribute based Encryption scheme, the encryptor can fix the policy, who can decrypt the encrypted message The policy can be formed with the help of attributes In CP-ABE, access policy is sent along with the ciphertext We propose a method in which the access policy need not be sent along with the ciphertext, by which we are able to preserve the privacy of the encryptor The proposed construction is provably secure under Decision Bilinear Diffe-Hellman assumption

17 citations

Book ChapterDOI
01 Jan 2018
TL;DR: This paper proposes a fully Homomorphic Encryption Scheme with probabilistic encryption for better security in cloud computing.
Abstract: Homomorphic encryption is an encryption scheme that allows different operations on encrypted data and produces the same result as well that the operations performed on the plaintext. Homomorphic encryption can be used to enhance the security measure of un-trusted systems which manipulates and stores sensitive data. Therefore, homomorphic encryption can be used in cloud computing environment for ensuring the confidentiality of processed data. In this paper, we propose a fully Homomorphic Encryption Scheme with probabilistic encryption for better security in cloud computing.

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