Presentation 1998/12/11
Provable Security of Practical Public-Key Encryption Systems
Tatsuaki Okamoto,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) One of the most important topics in modern cryptography is to prove that a (practical) cryptosystem is secure under a reasonable assumption on the intractability of solving a problem such as the factoring or discrete logarithm problem. Many interesting results on the provable security of practical public-key encryption systems have been presented recently. This paper reviews these results very briefly.
Keyword(in Japanese) (See Japanese page)
Keyword(in English)
Paper # ISEC98-56
Date of Issue

Conference Information
Committee ISEC
Conference Date 1998/12/11(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) Provable Security of Practical Public-Key Encryption Systems
Sub Title (in English)
Keyword(1)
1st Author's Name Tatsuaki Okamoto
1st Author's Affiliation NTT Laboratories()
Date 1998/12/11
Paper # ISEC98-56
Volume (vol) vol.98
Number (no) 465
Page pp.pp.-
#Pages 7
Date of Issue