How to Enhance the Security of Public-Key Encryption at Minimum Cost(Special Section on Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
This paper presents a simple and generic conversion from a public-key encryption scheme that is indistinguishable against chosen-plaintext attacks into a public-key encryption scheme that is indistinguishable against adaptive chosen-ciphertext attacks in the random oracle model.The scheme obtained by the conversion is as efficient as the original encryption scheme and the security reduction is very tight in the exact security manner.
- 社団法人電子情報通信学会の論文
- 2000-01-25
著者
-
Okamoto T
Ntt Corp. Yokosuka‐shi Jpn
-
Okamoto Tatsuaki
Ntt Laboratories
-
FUJISAKI Eiichiro
NTT Laboratories
関連論文
- Security and Performance Evaluation of ESIGN and RSA on IC Cards by Using Byte-Unit Modular Algorithms(Fundamental Theories for Communications)
- One-Time Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash (Special Section on Cryptography and Information Security)
- Provable Security of Practical Public-Key Encryption Systems
- How to Enhance the Security of Public-Key Encryption at Minimum Cost(Special Section on Cryptography and Information Security)
- Multi-Signature Schemes Secure against Active Insider Attacks (Special Section on Cryptography and Information Security)
- Security of the Extended Fiat-Shamir Schemes (Special Section on Cryptography and Information Security)
- Practical Escrow Cash Schemes (Special Section on Cryptography and Information Security)
- A Note on Computationally Sound Proof in Group of Unknown Order (コンピュータセキュリティ研究報告)
- Threshold Key-Recovery Systems for RSA (Special Section on Cryptography and Information Security)
- Statistical Zero-Knowledge Protocols to Prove Modular Polynomial Relations (Special Section on Cryptography and Information Security)
- A Note on Computationally Sound Proof in Group of Unknown Order