Presentation 2000/9/21
On Security Notions for Public-Key Encryption Schemes under Circumstances with Quasi-Random Resources : Semantic Security and Indistinguishability
Takeshi Koshiba,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we introduce a framework in which we can uniformly and comprehensively discuss security notions of public-key encryption schemes even for the case where some weak generator producing seemingly random sequences is used to encrypt plaintext messages. First, we prove that indistinguishability and semantic security are not equivalent in general. On the other hand, we derive some sufficient condition for the enquivalence.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) probabilistic encryption / public-key encryption / semantic security / indistinguishability / ciphertext only attack / chosen plaintext attack / pseudo-randomness
Paper # ISEC2000-64
Date of Issue

Conference Information
Committee ISEC
Conference Date 2000/9/21(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On Security Notions for Public-Key Encryption Schemes under Circumstances with Quasi-Random Resources : Semantic Security and Indistinguishability
Sub Title (in English)
Keyword(1) probabilistic encryption
Keyword(2) public-key encryption
Keyword(3) semantic security
Keyword(4) indistinguishability
Keyword(5) ciphertext only attack
Keyword(6) chosen plaintext attack
Keyword(7) pseudo-randomness
1st Author's Name Takeshi Koshiba
1st Author's Affiliation Telecommunications Advancement Organization of Japan()
Date 2000/9/21
Paper # ISEC2000-64
Volume (vol) vol.100
Number (no) 323
Page pp.pp.-
#Pages 8
Date of Issue