Relationship Between Standard Model Plaintext Awareness and Message Hiding

  • Isamu Teranishi
  • Wakaha Ogata
Conference paper

DOI: 10.1007/11935230_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4284)
Cite this paper as:
Teranishi I., Ogata W. (2006) Relationship Between Standard Model Plaintext Awareness and Message Hiding. In: Lai X., Chen K. (eds) Advances in Cryptology – ASIACRYPT 2006. ASIACRYPT 2006. Lecture Notes in Computer Science, vol 4284. Springer, Berlin, Heidelberg


Recently, Bellare and Palacio succeeded in defining the plaintext awareness, which is also called PA2, in the standard model. They propose three valiants of the standard model PA2 named perfect, statistical, and computational PA2. In this paper, we study the relationship between the standard model PA2 and the property about message hiding, that is, IND-CPA. Although it seems that these two are independent notions at first glance, we show that all of the perfect, statistical, and computational PA2 in the standard model imply the IND-CPA security if the encryption function is oneway. By using this result, we also showed that “PA2 + Oneway \(\Rightarrow\) IND-CCA2”. This result shows the “all-or-nothing” aspect of the PA2. That is, a standard model PA2 secure public-key encryption scheme either satisfies the strongest message hiding property, IND-CCA2, or does not satisfy even the weakest message hiding property, onewayness. We also showed that the computational PA2 notion is strictly stronger than the statistical one.


Plaintext Awareness Standard Model 

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Isamu Teranishi
    • 1
    • 2
  • Wakaha Ogata
    • 2
  1. 1.NEC CorporationKawasaki, KanagawaJapan
  2. 2.Tokyo Institute of TechnologyTokyoJapan

Personalised recommendations