Security of the Extended Fiat-Shamir Schemes (Special Section on Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
Fiat-Shamir's identification and signature scheme is efficient as well as provably secure, but it has a problem in that the transmitted information size and memory size cannot simultaneously be small. This paper proposes an identification and signature scheme which overcomes this problem. Our scheme is based on the difficulty of extracting the L-th roots mod n (e.g. L=2〜10^<2O>) when the factors of n are unknown. We prove that the sequential version of our scheme is a zero knowledge interactive proof system and our parallel version reveals no transferable information if the factoring is difficult. The speed of our scheme's typical implementation is at least one order of magnitude faster than that of the RSA scheme and is relatively slow in comparison with that of the Fiat-Shamir scheme.
- 社団法人電子情報通信学会の論文
- 1998-01-25
著者
関連論文
- E2-A New 128-Bit Block Cipher(Special Section on Cryptography and Information Security)
- Strict Evaluation of the Maximum Average of Differential Probability and the Maximum Average of Linear Probability (Special Section on Cryptography and Information Security)
- Linear Cryptanalysis of FEAL (Special Section on Cryptography and Information Security)
- Key-Dependency of Linear Probability of RC5 (Special Section on Cryptography and Information Security)
- The Best Linear Expression Search of FEAL (Special Section on Cryptography and Information Security)
- 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)
- Collision Search of a Hash Function by Using Random Mapping (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)