Relationship between Standard Model Plaintext Awareness and Message Hiding

スポンサーリンク

概要

• 論文の詳細を見る

• Recently, Bellare and Palacio defined the plaintext awareness (PA-ness) in the standard model. In this paper, we study the relationship between the standard model PA-ness and the property about message hiding, that is, IND-CPA. Although these two notions seem to be independent at first glance, we show that PA-ness in the standard model implies the IND-CPA security if the encryption function is oneway. By using this result, we also showed that “PA+Oneway⇒IND-CCA2.” We also show that the computational PA-ness notion is strictly stronger than the statistical one.

• （社）電子情報通信学会の論文
• 2008-01-01

著者

• OGATA Wakaha

  Tokyo Institute of Technology

• Ogata Wakaha

  Tokyo Inst. Of Technol. Tokyo Jpn

• Ogata Wakaha

  Department Of Computer Engineering Faculty Of Engineering Himeji Institute Of Technology

• Ogata Wakaha

  Faculty Of Engineering Tokyo Institute Of Technology

• TERANISHI Isamu

  NEC Corporation

• Ogata Wakaha

  Faculty Of Engineering Himeji Institute Of Technology

• Ogata Wakaha

  Himeji Institute Of Technology

• Teranishi Isamu

  Nec Corp.

関連論文

• Collision-Based Power Attack for RSA with Small Public Exponent
• New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
• New Identity-Based Blind Signature and Blind Decryption Scheme in the Standard Model
• Analysis on Secret Sharing Schemes with Non-Graphical Access Structures (Special Section on Cryptography and Information Security)
• Electronic Ticket Scheme for ITS(Special Section on Cryptography and Information Security)
• Provably Secure On-Line Secret Sharing Scheme
• Comments on the Security Proofs of Some Signature Schemes Based on Factorization(Information Security)
• New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
• New Identity-Based Blind Signature and Blind Decryption Scheme in the Standard Model
• Collision-Based Power Attack for RSA with Small Public Exponent
• Forgery Attacks on Time-Stamp, Signed PDF and X.509 Certificate
• General Conversion for Obtaining Strongly Existentially Unforgeable Signatures
• On Some Variations of Kurosawa-Desmedt Public-Key Encryption Scheme(Cryptography and Information Security)
• Efficient Divisible Voting Scheme(Application)(Cryptography and Information Security)
• Some new results on nonperfect secret sharing schemes
• Efficient Almost Secure 1-Round Message Transmission Schemes for 3t+1 Channels
• k out of n Oblivious Transfer without Random Oracles (Protocol) (Cryptography and Information Security)
• 4-Move Perfect ZKIP for Some Promise Problems
• Relationship between Standard Model Plaintext Awareness and Message Hiding
• A General Model of Structured Multisignatures with Message Flexibility(Signatures,Cryptography and Information Security)
• Provably Secure On-Line Secret Sharing Scheme
• On Claw Free Families (Special Section on Cryptography and Information Security)
• Matching Oblivious Transfer : How to Exchange Valuable Data(Special Section on Cryptography and Information Security)
• k out of n Oblivious Transfer without Random Oracles
• On the Practical Secret Sharing Scheme : Special Section on Cryptography and Information Security
• Reshufflable and Laziness Tolerant Mental Card Game Protocol (Special Section on Cryptography and Information Security)
• A Simple and Efficient Secret Sharing Scheme Secure against Cheating
• Anonymous Credential with Attributes Certification after Registration
• Undeniable and Unpretendable Signatures

もっと見る 閉じる

スポンサーリンク