Presentation 2008-09-12
The security analysis using meta-reduction under several computational : assumptions in the case of ElGamal encryption
Yutaka KAWAI, Kazuo OHTA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Meta-reduction technique is the method that the security of single key factoring-based encryption or signature is analyzed. In the previous works, the meta-reduction technique was discussed only under single computational assumption. In this paper, we show that more rigorous security analysis is possible by using the meta-reduction under several computational assumptions. We discuss, as an example, the security analysis of ElGamal encryption using the meta-reduction under Computational Diffie-Hellman problem, Decisional Diffie-Hellman problem, and Strong Diffie-Hellman problem.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) impossibility / meta-reduction technique / ElGamal encryption
Paper # ISEC2008-70
Date of Issue

Conference Information
Committee ISEC
Conference Date 2008/9/5(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 security analysis using meta-reduction under several computational : assumptions in the case of ElGamal encryption
Sub Title (in English)
Keyword(1) impossibility
Keyword(2) meta-reduction technique
Keyword(3) ElGamal encryption
1st Author's Name Yutaka KAWAI
1st Author's Affiliation The University of Electro-Communications()
2nd Author's Name Kazuo OHTA
2nd Author's Affiliation The University of Electro-Communications
Date 2008-09-12
Paper # ISEC2008-70
Volume (vol) vol.108
Number (no) 207
Page pp.pp.-
#Pages 8
Date of Issue