Presentation 1999/11/8
The Decision Diffie-Hellman problem and probabilistic encryptions
Taiichi SAITO, Takeshi KOSHIBA, Akihiro YAMAMURA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We define an equivalence relation on the direct product of cyclic groups, reformulate the Decision Diffie-Hellman problem using the equivalence and discuss its variants. An easy proof is given for the equivalence between the Decision Diffie-Hellman assumption and the Matching Diffie-Hellman assumption. We prove that a variant of the Matching Diffie-Hellman assumption, which asserts that randomly chosen classes are computationally indistinguishable, is equivalent to the Decision Diffie-Hellman assumption. We propose two probabilistic encryptions semantically secure under the Decision Diffie-Hellman assumption.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Decision Diffie-Hellman Problem / Matching Diffie-Hellman Problem / Probabilistic encryption
Paper # ISEC99-52
Date of Issue

Conference Information
Committee ISEC
Conference Date 1999/11/8(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 JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) The Decision Diffie-Hellman problem and probabilistic encryptions
Sub Title (in English)
Keyword(1) Decision Diffie-Hellman Problem
Keyword(2) Matching Diffie-Hellman Problem
Keyword(3) Probabilistic encryption
1st Author's Name Taiichi SAITO
1st Author's Affiliation Research Project of Info-Communication Security, Telecommunications Advancement Organization of Japan()
2nd Author's Name Takeshi KOSHIBA
2nd Author's Affiliation Research Project of Info-Communication Security, Telecommunications Advancement Organization of Japan
3rd Author's Name Akihiro YAMAMURA
3rd Author's Affiliation Communication Research Laboratory
Date 1999/11/8
Paper # ISEC99-52
Volume (vol) vol.99
Number (no) 414
Page pp.pp.-
#Pages 8
Date of Issue