Provable Security of Practical Public-Key Encryption Systems
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 社団法人電子情報通信学会の論文
- 1998-12-11
著者
関連論文
- 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)
- 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)