Skip to search formSkip to main contentSkip to account menu

Ciphertext indistinguishability

Known as: IND-CPA2, IND-CPA, IND-CPA1 
Ciphertext indistinguishability is a property of many encryption schemes. Intuitively, if a cryptosystem possesses the property of… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
We propose HELEN, a code-based public-key cryptosystem whose security is based on the hardness of the Learning from Parity with… 
2012
2012
In this paper, we revisit the private k+ data aggregation problem, and formally define the problem's security requirements as… 
2011
2011
The goal of the modes of operation for authenticated encryption is to achieve faster encryption and message authentication by… 
2009
2009
In applications like wireless content distribution, a central authority needs to deliver encrypted data to a large number of… 
2008
2008
A searchable public key encryption (PEKS) scheme allows to generate, for any given message W , a trapdoor TW , such that TW… 
2005
2005
A predicate is opaque for a given system, if an adversary will never be able to establish truth or falsehood of the predicate for… 
Review
2004
Review
2004
We assessed dung and track counts for indexing brocket deer abundance in seasonal habitats on a ranch where hunting is not… 
2002
2002
This paper considers arbitrary-length chosen-ciphertext secure asymmetric encryption, thus addressing what is actually needed for…