Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,995,821 papers from all fields of science
Search
Sign In
Create Free Account
Ciphertext indistinguishability
Known as:
IND-CPA2
, IND-CPA
, IND-CPA1
Expand
Ciphertext indistinguishability is a property of many encryption schemes. Intuitively, if a cryptosystem possesses the property of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
25 relations
Adaptive chosen-ciphertext attack
Anti-computer forensics
Averaging argument
Ciphertext
Expand
Broader (1)
Cryptography
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems
Alexandre Duc
,
S. Vaudenay
International Conference on Cryptology in Africa
2013
Corpus ID: 7194512
We propose HELEN, a code-based public-key cryptosystem whose security is based on the hardness of the Learning from Parity with…
Expand
2012
2012
Private Over-Threshold Aggregation Protocols
Myungsun Kim
,
Aziz Mohaisen
,
J. Cheon
,
Yongdae Kim
International Conference on Information Security…
2012
Corpus ID: 2092771
In this paper, we revisit the private k+ data aggregation problem, and formally define the problem's security requirements as…
Expand
2012
2012
An efficient IND-CCA2 secure Paillier-based cryptosystem
Angsuman Das
,
A. Adhikari
Information Processing Letters
2012
Corpus ID: 7290364
2011
2011
ASC-1: An Authenticated Encryption Stream Cipher
G. Jakimoski
,
Samant Khajuria
ACM Symposium on Applied Computing
2011
Corpus ID: 27072066
The goal of the modes of operation for authenticated encryption is to achieve faster encryption and message authentication by…
Expand
2009
2009
Certificateless Encryption Scheme Secure in Standard Model
Guoyan Zhang
,
Xiaoyun Wang
2009
Corpus ID: 62697900
2009
2009
Cryptanalysis of Mu et al.'s and Li et al.'s Schemes and a Provably Secure ID-Based Broadcast Signcryption (IBBSC) Scheme
S. D. Selvi
,
S. Vivek
,
R. Gopalakrishnan
,
Naga Naresh Karuturi
,
C. Rangan
Web Information System and Application Conference
2009
Corpus ID: 1096255
In applications like wireless content distribution, a central authority needs to deliver encrypted data to a large number of…
Expand
2008
2008
Searchable encryption with decryption in the standard model
D. Hofheinz
,
Enav Weinreb
IACR Cryptology ePrint Archive
2008
Corpus ID: 5790050
A searchable public key encryption (PEKS) scheme allows to generate, for any given message W , a trapdoor TW , such that TW…
Expand
2005
2005
Probabilistic Opacity for a Passive Adversary and its Application to Chaum's Voting Scheme
Y. Lakhnech
,
L. Mazaré
IACR Cryptology ePrint Archive
2005
Corpus ID: 6087230
A predicate is opaque for a given system, if an adversary will never be able to establish truth or falsehood of the predicate for…
Expand
Review
2004
Review
2004
Estimating brocket deer (Mazama gouazoubira and M. americana) abundance by dung pellet counts and other indices in seasonal Chiquitano forest habitats of Santa Cruz, Bolivia
K. Rivero
,
D. Rumiz
,
A. Taber
Zeitschrift f\ ur Jagdwissenschaft
2004
Corpus ID: 20412399
We assessed dung and track counts for indexing brocket deer abundance in seasonal habitats on a ranch where hunting is not…
Expand
2002
2002
Optimal Chosen-Ciphertext Secure Encryption of Arbitrary-Length Messages
J. Coron
,
H. Handschuh
,
M. Joye
,
Pascal Paillier
,
D. Pointcheval
,
Christophe Tymen
International Conference on Theory and Practice…
2002
Corpus ID: 1696198
This paper considers arbitrary-length chosen-ciphertext secure asymmetric encryption, thus addressing what is actually needed for…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE