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.
2016
2016
Compressed Sensing may offer confidentiality with a good level of security that comes at limited extra costs. By this means… 
2016
2016
Over the last few years a new breed of cryptographic primitives has arisen: on one hand they have previously unimagined utility… 
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… 
2012
2012
Cloud computing has increasingly become a new model in the world of computing, and more businesses are moving to the cloud. As a… 
2011
2011
The goal of the modes of operation for authenticated encryption is to achieve faster encryption and message authentication by… 
2008
2008
A searchable public key encryption (PEKS) scheme allows to generate, for any given message W , a trapdoor TW , such that TW… 
2007
2007
It has always been a critical issue to find efficient methods for fast revocation of a user's identity in traditional ID-based… 
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…