Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Chosen-ciphertext attack

Known as: Indifferent chosen-ciphertext attack, CCA, Chosen ciphertext attack 
A chosen-ciphertext attack (CCA) is an attack model for cryptanalysis where the cryptanalyst can gather information by obtaining the plaintexts of… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Attribute-based encryption provides good solutions to the problem of anonymous access control by specifying access policies among… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
In a proxy re-encryption (PRE) system [4], a proxy, authorized by Alice, can convert a ciphertext for Alice into a ciphertext for… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Lossy encryption was originally studied as a means of achieving efficient and composable oblivious transfer. Bellare, Hofheinz… Expand
  • figure 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We initiate the study of one-wayness under correlated products . We are interested in identifying necessary and sufficient… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
In ciphertext policy attribute-based encryption (CP-ABE), every secret key is associated with a set of attributes, and every… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Security against adaptive chosen ciphertext attacks (or, CCA security) has been accepted as the standard requirement from… Expand
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We present a chosen-ciphertext attack against the public key cryptosystem called NTRU. This cryptosystem is based on polynomial… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
The zero-knowledge proof of knowledge, first denned by Fiat, Fiege and Shamir, was used by Galil, Haber and Yung as a means of… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We present two efficient constructions aimed at making public key systems secure against chosen ciphertext attacks. The first one… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We show how to construct a public-key cryptosystem (as originally defined by DiNe and Hellman) secure against chosen ciphertezt… Expand
Is this relevant?